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.
Get Ṁ200 play money
More related questions
Related questions
Is Rudin's conjecture true?
69% chance
Is Hadwiger's conjecture true?
56% chance
Is the Jacobian conjecture true?
76% chance
Is Goodman's Conjecture true?
71% chance
Is the four exponentials conjecture true?
85% chance
Is de Polignac's conjecture true?
87% chance
Is Schanuel's conjecture true?
78% chance
Is Haborth's Conjecture true?
70% chance
Is Beal's conjecture true?
60% chance
Is Toeplitz's conjecture (inscribed square problem) true?
80% chance