- #1

- 18

- 0

**Prime Division HELP!!!**

## Homework Statement

I need to be able to understand and likely prove that for any positive odd integer n,

8 | (n^2 -1 )

## Homework Equations

## The Attempt at a Solution

odd can be said to be n = 2k +1

so 8 | (2k + 1)^2 -1

- Thread starter PennState666
- Start date

- #1

- 18

- 0

I need to be able to understand and likely prove that for any positive odd integer n,

8 | (n^2 -1 )

odd can be said to be n = 2k +1

so 8 | (2k + 1)^2 -1

- #2

phyzguy

Science Advisor

- 4,740

- 1,670

Keep going. Now expand out (2k+1)^2 - 1 and collect terms. Then think about the terms in k and k+1.

- #3

- 18

- 0

I got stumped trying mathematical induction i was hoping for a new approach

- #4

Mark44

Mentor

- 34,675

- 6,386

Try the approach that phyzguy is suggesting.

- Last Post

- Replies
- 5

- Views
- 1K

- Last Post

- Replies
- 2

- Views
- 646

- Last Post

- Replies
- 3

- Views
- 1K

- Last Post

- Replies
- 5

- Views
- 3K

- Last Post

- Replies
- 1

- Views
- 4K

- Replies
- 1

- Views
- 2K

- Replies
- 3

- Views
- 2K

- Last Post

- Replies
- 2

- Views
- 2K

- Last Post

- Replies
- 7

- Views
- 2K

- Last Post

- Replies
- 4

- Views
- 1K