Intereting Posts

Mathematical Telescoping
Embeddings of finite groups into $\mathrm{GL}_n(\mathbb{Z})$
Does $M_n^{-1}$ converge for a series of growing matrices $M_n$?
About fibers of an elliptic fibration.
Is an irreducible ideal in $R$ irreducible in $R$?
Reducing the form of $2\sum\limits_{j=0}^{n-2}\sum\limits_{k=1}^n {{k+j}\choose{k}}{{2n-j-k-1}\choose{n-k+1}}$.
$A$ is skew hermitian, prove $(I-A)^{-1} (I+A)$ is unitary
Intuition: Power Set of Intersection/Union (Velleman P77 & Ex 2.3.10, 11)
Definition functions, integrals on $\mathbb R^{|N|}, \mathbb R^{\mathbb R}$
Is $[a, a)$ equal to $\{a\}$ or $\varnothing$?
If the tensor product of two modules is free of finite rank, then the modules are finitely generated and projective
Mapping Irregular Quadrilateral to a Rectangle
Growth of $\Gamma(n+1,n)$ and $\operatorname{E}_{-n}(n)$
How to prove the inequality between mathematical expectations?
How can a = x (mod m) have multiple meanings in modular arithmetic?

Is there a polynomial-time algorithm to find a prime larger than $n$?

If Cramér’s conjecture is true, we can use AKS to test $n+1$, $n+2$, etc. until the next prime is found, and this method will find a prime in polynomial time (in $\log n$) because AKS runs in polynomial time and Cramér’s conjecture guarantees $O((\log{n})^2)$ primes to test.

Without assuming Cramér’s conjecture, and without requiring that the prime to be found is the next prime following $n$, only that it is larger than $n$, can such a prime be found in time $O((\log{n})^k)$ for some $k$?

- What is the best way to solve discrete divide and conquer recurrences?
- What is the number of full binary trees of height less than $h$
- Concrete FFT polynomial multiplication example
- Largest Equilateral Triangle in a Polygon
- Looking to understand the rationale for money denomination
- How to find a closed form solution to a recurrence of the following form?

This question is motivated by some thoughts I wrote about in the comments on this answer by Gerry Myerson.

- Calculation of product of all coprimes of number less than itself
- How to solve the matrix minimization for BFGS update in Quasi-Newton optimization
- Is this a wrong solution to the smallest enclosing circle problem?
- Are points on the complex plane sufficient to solve every solvable equation composed of the hyperoperators, their inverses, and complex numbers?
- All pairs shortest path in undirected and unweighted graphs
- Intuition behind the concept of indicator random variables.
- How can I solve $8n^2 = 64n\,\log_2(n)$
- Least Impossible Subset Sum
- How to prove the optimal Towers of Hanoi strategy?
- Finding the intersection point of many lines in 3D (point closest to all lines)

This is Rick Sladkey’s comment as a CW answer. An algorithm is given in this paper: “Deterministic Methods to Find Primes”.

- Show that $L^1$ is strictly contained in $(L^\infty)^*$
- How does a non-mathematician go about publishing a proof in a way that ensures it to be up to the mathematical community's standards?
- Distance between closed and compact sets.
- Is $0^\infty$ indeterminate?
- Are the $\mathcal{C}^k$ functions dense in either $\mathcal{L}^2$ or $\mathcal{L}^1$?
- A $\log \Gamma $ identity: Where does it come from?
- Matrices whose Linear Combinations are All Singular
- Optimal path around an invisible wall
- Infinite coproduct of affine schemes
- Non-centered Gaussian moments
- Integers expressible in the form $x^2 + 3y^2$
- Cardinality of sets regarding
- Does $X\times S^1\cong Y\times S^1$ imply that $X\times\mathbb R\cong Y\times\mathbb R$?
- Proof of Eberlein–Smulian Theorem for a reflexive Banach spaces
- How to determine the density of the set of completely splitting primes for a finite extension?