Proving Divisibility of m by 24

In summary, to prove that if n^2+m and n^2-m are perfect squares, m must be divisible by 24, we can consider squares mod 16 and show that if n^2 is congruent to 0, 1, or 9 modulo 16, then m must be congruent to 0, 0, or 8 modulo 16 respectively. This leads to m being divisible by 8, and therefore 24. Alternatively, we can consider squares mod 24 and show that n^2+m and n^2-m cannot both be in the set {0,1,4,9,12,16}. This leads to m being divisible by 8, and therefore 24
  • #1
ehrenfest
2,020
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
  • #2
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.
 
  • #3
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:
  • #4
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.)
 
  • #5
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...
 

FAQ: Proving Divisibility of m by 24

What is the rule for proving divisibility of a number by 24?

The rule for proving divisibility of a number by 24 is that the number must be divisible by both 3 and 8.

How can I check if a number is divisible by 24 without using a calculator?

One way to check if a number is divisible by 24 without using a calculator is to divide the number by 3 and then divide the result by 8. If the result is a whole number, then the original number is divisible by 24.

Can a number be divisible by 24 if it is not divisible by 3?

No, a number must be divisible by 3 in order to be divisible by 24. This is because 24 is a multiple of 3, meaning it can be divided evenly by 3.

Is there a pattern to determine if a number is divisible by 24?

Yes, there is a pattern that can help determine if a number is divisible by 24. This pattern involves looking at the last two digits of the number. If the last two digits are divisible by 4, and the sum of all the digits is divisible by 3, then the number is divisible by 24.

Can a number be divisible by 24 if it is not divisible by 8?

No, a number must be divisible by 8 in order to be divisible by 24. This is because 24 is a multiple of 8, meaning it can be divided evenly by 8.

Back
Top