MathDB

Erdős Problem #200 — Does the longest arithmetic progression of primes in {1,…,N}\{1,\ldots,N\} have length o(log⁡N)o(\log N)?

At least 46 years old · documented by

Does the longest arithmetic progression of primes in {1,…,N}\{1,\ldots,N\} have length o(log⁡N)o(\log N)?

References

Primary source

ULAM AI, UnsolvedMath dataset, Erdős Problems set, revision b9437975f3c873f635a13c48f8b022f5ba80898a; CC BY 4.0.

Additional references

UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.

arithmetic-progressionsprime-numbers
InErdős Problems
Posted · edited

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.