Proving Divisibility of m by 24

  • Thread starter Thread starter ehrenfest
  • Start date Start date
  • Tags Tags
    Divisibility
Click For Summary

Homework Help Overview

The problem involves proving that if both \( n^2 + m \) and \( n^2 - m \) are perfect squares, then \( m \) must be divisible by 24. The discussion centers around properties of squares modulo various integers, particularly 24, 16, 8, 4, and 3.

Discussion Character

  • Exploratory, Mathematical reasoning, Assumption checking

Approaches and Questions Raised

  • Participants explore the implications of squares modulo 24 and question whether certain congruences can lead to contradictions. There are attempts to analyze the problem using modular arithmetic, particularly focusing on mod 3 and mod 4 as simpler cases. Some participants suggest considering squares mod 16 to derive conditions on \( m \).

Discussion Status

The discussion is ongoing, with participants providing various approaches and questioning the validity of their reasoning. Some guidance has been offered regarding the use of modular arithmetic, but there is no explicit consensus on a definitive method or conclusion yet.

Contextual Notes

There is an emphasis on the need to show that \( m \) is even and congruent to specific values modulo 8 and 16. Participants express uncertainty about the elegance and completeness of their proofs, indicating a need for further exploration.

ehrenfest
Messages
2,001
Reaction score
1

Homework Statement


Prove that if n^2+m and n^2-m are perfect squares, then m is divisible by 24.

Homework Equations


The Attempt at a Solution


I found all of the squares mod 24. They are:{0,1,4,9,12,16}. We want to show that if we take anyone of these as n^2, then n^2+m and n^2-m cannot be in that set. However, if we take n^2=0 and m=12, then n^2+12=n^2-12=12. What is wrong here?
,
 
Physics news on Phys.org
Just because some square is congruent to s modulo n it doesn't follow that everything congruent to s modulo n is a square.

Personally I wouldn't work directly with squares mod 24, but instead with squares mod 3 and mod 4 - they're particularly straightforward. After you show that m=0 mod 3 and mod 4, proceed to show that m is necessarily even.
 
It is even because it is congruent to 0 mod 4. What we need to show is that it is congruent to 0 mod 8.

When I try to do that, I run into the same problem as with mod 24. n^2 could be congruent to 0 mod 8, m could be congruent to 4 mod 8, then it is possible that n^2-m and n^2+m are squares since n^2-4 = n^2+4=4=2^2 mod 8
 
Last edited:
Wow... How silly of me! :redface:

OK, how about this: Consider squares mod 16 instead. They are {0,1,4,9}. 2n^2 is the sum of two squares, and it's twice a square, so we get that n^2-m=n^2+m (mod 16), so that either m=0 or m=8 (mod 16), and consequently m=0 (mod 8).

Try to fill in the details.

(Hopefully I haven't said anything stupid this time.)
 
morphism said:
Wow... How silly of me! :redface:

OK, how about this: Consider squares mod 16 instead. They are {0,1,4,9}. 2n^2 is the sum of two squares, and it's twice a square, so we get that n^2-m=n^2+m (mod 16), so that either m=0 or m=8 (mod 16), and consequently m=0 (mod 8).

Try to fill in the details.

(Hopefully I haven't said anything stupid this time.)

Yes, that works. The only possibilities for n^2 are 0,1,9.

2*0=0+0 and 2*1 = 1+1 and 2*9=2=1+1

so m = 0,0,8 respectively

I am not sure that's really an elegant proof because I just checked all the cases mentally, though...
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
2K
Replies
9
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
15
Views
4K