- #1

- 45

- 0

proof:

n^2 congruent 0 or 1 (mod3) for any integer n

n^2 congruent 0 or 1 (mod3) for any integer n

- Thread starter phyguy321
- Start date

- #1

- 45

- 0

proof:

n^2 congruent 0 or 1 (mod3) for any integer n

n^2 congruent 0 or 1 (mod3) for any integer n

- #2

- 135

- 0

- #3

- 1,101

- 3

Consider just the squares of the integers from 1 to 9 modulo 3. Then you could generalize to higher numbers since powers of 10 are congruent to 1 (mod 3).

Or, consider a number in base 3. It can end in 0, 1 or 2. Thus a square in base 3 can only end in 0^2 = 0, 1^2 = 1, or 2^2 = 4 = 1 base 3. So a square in base 3 can only end in 0 or 1, which is equivalent to the square leaving a remainder of 0 or 1 upon division by 3.

- #4

- 623

- 0

- Last Post

- Replies
- 11

- Views
- 4K

- Last Post

- Replies
- 1

- Views
- 2K

- Last Post

- Replies
- 4

- Views
- 2K

- Last Post

- Replies
- 1

- Views
- 3K

- Last Post

- Replies
- 2

- Views
- 5K

- Replies
- 1

- Views
- 2K

- Replies
- 2

- Views
- 2K

- Last Post

- Replies
- 8

- Views
- 4K

- Replies
- 1

- Views
- 2K

- Last Post

- Replies
- 3

- Views
- 2K