maths
posted 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).
Respond to this Question
Similar Questions

math/integers
how do you solve integers? There are about a thousand different types of problems with integers, so it depends on what type of problem. Do you have something specific in mind? 
Reply to Yorkie16
Original qustion posted here: http://www.jiskha.com/display.cgi? 
math
FIND THE MODULO CLASS TO WHICH THE NUMBER BELONGS FOR THE GIVEN MODULO SYSTEM 53 mod 12 
Math
N is an integer such that N≡179(mod233) and N≡233(mod179). Determine a three digit positive integer M such that N≡M(mod179×233). Details and assumptions You may use the fact that 179 and 233 are primes. 
Math algebra
Let N be the sum of all positive integers q of the form q=p^k with prime p, such that for at least four different integer values of x from 1 to q, x^3−3x≡123(modq). What are the last 3 digits of N? 
algebra
Find the largest possible integer n such that there exists a nonconstant quadratic polynomial f(x) with integer coefficients satisfying f(1)∣f(2),f(2)∣f(3),…f(n−1)∣f(n). Details and assumptions: ~For (possibly … 
math alggggggggggggebra
Find the largest possible integer n such that there exists a nonconstant quadratic polynomial f(x) with integer coefficients satisfying f(1)∣f(2),f(2)∣f(3),…f(n−1)∣f(n). 
MATHS
Find the largest possible integer n such that there exists a nonconstant quadratic polynomial f(x) with integer coefficients satisfying f(1)∣f(2),f(2)∣f(3),…f(n−1)∣f(n). Details and assumptions For (possibly … 
heeeeeeeelp math
Find the smallest n such that for some prime p, at least 20 of the numbers 1,2,...,n are quadratic nonresidues modulo p. 
math
Using fermats little theorm, find the least residue of 8^123 modulo 61