Explore relationships

Quadratic residuosity problem

The quadratic residuosity problem (QRP) in computational number theory is to decide, given integersa{\displaystyle a} and N{\displaystyle N}, whether a{\displaystyle a} is a quadratic residuemoduloN{\displaystyle N} or not.

Use + to expand a branch. Click a topic name to open its summary.