Please turn JavaScript on
Recent Questions - MathOverflow icon

Recent Questions - MathOverflow

Want to stay in touch with the latest updates from Recent Questions - MathOverflow? That's easy! Just subscribe clicking the Follow button below, choose topics or keywords for filtering if you want to, and we send the news to your inbox, to your phone via push notifications or we put them on your personal page here on follow.it.

Reading your RSS feed has never been easier!

Website title: MathOverflow

Is this your feed? Claim it!

Publisher:  Unclaimed!
Message frequency:  22.07 / day

Message History

I am a mathematics student, and I have been struggling with a particular way of studying that is becoming quite painful, both mathematically and personally.

Very often, when I study a course in the ordinary way, I can learn the definitions, follow the proofs, and eventually solve the exercises, but I still have the feeling that I do not really understand what is going ...


Read full story

Let $a$, $b$, and $c$ be three consecutive prime numbers. Does the following inequality always hold?

$$(c-b)(b-a) < a+b+c$$


Read full story

Principal Component Analysis is used to reduced the dimensions of atmospheric pressure grids (lat X long X time) into their most important modes of behaviour (e.g, the North Atlantic Oscillation is the PC1 of the North Atlantic pressure field).

I would like to know if there is a way to find the modes/splits of variance within a dataset (such as pressure grids) that are...


Read full story

Let $p_n$ denote the $n$-th prime, and set

$$ g_n=p_{n+1}-p_n. $$

Consider the two alternating series

$$ S_1= \sum_{n\ge1} (-1)^{n-1}\frac{g_n}{p_n\log p_n}, $$

and

$$ S_2= \sum_{n\ge1} (-1)^{n-1}\frac{\log g_n}{p_n}. $$

The convergence of $S_2$ is equivalent to that of

$$ \sum_{n\ge2} (-1)^{n-1}\frac{\log g_n}{n\log n}. $$

...

Read full story

I would like to introduce and request a structural review on an automated formal verification framework, SieveFramework, which formally anchors the absolute bounding geometries under user-defined quadratic barriers up to milestone stages (N ≥ 10000). The core mathematical architecture utilizes a discrete sieve confinement law. Let $k, x \in \mathbb{N}$ such that $k \le x^2$, ...


Read full story