Show that for all integers n>2, n does not divide n^2+2

  • Thread starter numba
  • Start date
  • #1
2
0

Homework Statement


Show that for all integers n>2, n does not divide n^2+2.

2. The attempt at a solution
I believe this solution can be solved by induction, I just don't know how to phrase it recursively.

For all n>2, n^2+2 mod n ≠ 0

Base case n=3
3^2 + 2 =11
11 mod 3 = 2 ≠ 0.

Show that
(n-1)^2 +2 mod n-1 ≠ 0
 

Answers and Replies

  • #2
Office_Shredder
Staff Emeritus
Science Advisor
Gold Member
4,365
466
I don't think induction is the right way to do this. n divides n2, can you use that in this problem?
 
  • #3
2
0
I can use that, but I'm not sure how it would be done. Intuitively it makes sense, but is there an axiom that I could use that proves this?
 
  • #4
HallsofIvy
Science Advisor
Homework Helper
41,833
963
Suppose n does divide n2+ 2. Then there exist integer m such that mn= n2+ 2. Now divide both sides by n.
 

Related Threads on Show that for all integers n>2, n does not divide n^2+2

Replies
9
Views
7K
Replies
4
Views
842
Replies
1
Views
7K
Replies
3
Views
725
Replies
2
Views
1K
Replies
6
Views
1K
Top