Is the strong Rudin's conjecture true?
Basic
3
Ṁ232031
64%
chance
1D
1W
1M
ALL
For natural numbers N, q, and a, the function Q(N,q,a) is equal to the number of perfect squares in the finite arithmetic progression {qn+a | n = 0,1,...N-1}, and Q(N) is the maximum value of Q(N,q,a) for all values of q and a. The stronger version of Rudin's conjecture states that Q(N) = Q(N,24,1) for all N>6.
This question is managed and resolved by Manifold.
Get
1,000
and3.00
Related questions
Related questions
Is Rudin's conjecture true?
69% chance
Is Haborth's Conjecture true?
70% chance
Is Hadwiger's conjecture true?
58% chance
Is Schanuel's conjecture true?
78% chance
Is Szymanski's conjecture true?
81% chance
Is Goodman's Conjecture true?
71% chance
Is the Unique Games Conjecture true?
65% chance
Will Goldbach's conjecture be proved before 2040?
42% chance
Is Beal's conjecture true?
60% chance
Is the Hodge conjecture true?
80% chance