a,c,m a,c<=m, and the problem is to decide if there is an 1<=x<=c for which
x^(2)-=amodm. For example, (3,7,11) is a positive instance of QR since x=6<=7 and
62-=3mod11. Hint: x-=ymodm iff x and y both yield the same remainder when
divided by m.
aa,c,m a,c,m ia,c,m (a,c,m)a,c,m b is a more appropriate size parameter than m.
Hint: think about the definition of the size of a problem instance.
db. Hint:
think about the big-O number of steps required for certain arithmetic operations.