If \( n \equiv 1 \pmod{3} \), then \( n^2 \equiv 1 \pmod{3} \),
Related Articles
- Step 1: Check modulo 3
- The possible residues modulo 3 are 0, 1, and 2:
- If \( n \equiv 0 \pmod{3} \), then \( n^2 \equiv 0 \pmod{3} \),
- If \( n \equiv 2 \pmod{3} \), then \( n^2 \equiv 4 \equiv 1 \pmod{3} \).
- Thus, \( n^2 \equiv 1 \pmod{3} \) when \( n \equiv 1 \) or \( 2 \pmod{3} \).
- Step 2: Check modulo 5
Trending Articles
Lord of the Rings Board Game Strategy: Why Aggression Always Loses
Secret C+P Mini Figure Glitches That Will Shock You
Is This Rare Mega Stone Glitching You Out?
I Finally Built The Ultimate End Rod Machine In Minecraft
Unlock Secret Strategies: The Chess Rival You've Never Tried
Why Howl is the Next Big Horror Game You Can't Ignore
Player Zombie Games PS5 You NEED to Play (Co-op Chaos)
The Truth Behind Gaming's Most Secret Hideouts
The Ultimate Glitch: Can You Even See Marshall in This Level
Solo Central V2 Secrets: What They Don't Want You To Know