Ask a New Question

Asked by maths

Find the smallest n such that for any prime p, at least 20 numbers 1,2, ..., n are quadratic residues not modulo p.
k is quadratic residue modulo p if there exists an integer j such that j^2 ≡ k (mod p).
12 years ago

Answers

There are no human answers yet.
There are no AI answers yet. The ability to request AI answers is coming soon!

Submit Your Answer


We prioritize human answers over AI answers.

If you are human, and you can answer this question, please submit your answer.

Related Questions

Find the smallest n>0 for which moving its terminal digit to the front results in 3n. How would I find the smallest three digit number that is divisible by exactly three different prime... Find the smallest value of x such that x^2+6x + 9 = 24 Please help me! I am very confused. Thank... Find the smallest value of x such that x^2+6x + 9 = 24. Find the smallest value of x for which the following curve has vertical tangent lines: y= x^2 + xy^2... Find the smallest n such that for some prime p, at least 20 of the numbers 1,2,...,n are quadratic n... Find the sum of the smallest 2 digit prime number and the largest 2 digit prime number. Find the smallest N such that N!is evenly divisable by 12^19. Find the smallest possible sum of six consecutive integers such that none of the integers is prime. Find the smallest value of x that satisfies the equation. absolute value of (x+5) = 3
Submit Your Answer

Question

Find the smallest n such that for any prime p, at least 20 numbers 1,2, ..., n are quadratic residues not modulo p.
k is quadratic residue modulo p if there exists an integer j such that j^2 ≡ k (mod p).

Ask a New Question
Archives Contact Us Privacy Policy Terms of Use