Question
For any positive integer $n>1$, show that $x^2 \bmod n=(n-x)^2 \bmod n$.
Step 1
This means we are interested in the remainder when \( x^2 \) is divided by \( n \). Show more…
Show all steps
Your feedback will help us improve your experience
James Chok and 69 other educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Show that if $n$ is an integer then $n^{2} \equiv 0$ or 1$(\bmod 4)$
Number Theory and Cryptography
Divisibility and Modular Arithmetic
Transcript
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD