What is the largest even number that divides the difference of squares of any 2 distinct odd integers?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let m , n be the odd distinct integers.
We can write m = 2 p + 1 , n = 2 q + 1 for p = q and p , q ∈ Z .
m 2 − n 2 = ( 2 p + 1 ) 2 − ( 2 q + 1 ) 2 = 4 p 2 + 4 p − 4 q 2 − 4 q
⟹ 4 ( p 2 + p − q 2 − q )
⟹ 4 ( p − q ) ( p + q + 1 )
Remember that p , q ∈ Z . We can use parity rules here to determine the largest even integer dividing the difference of the squares of two odd distinct numbers.
Since at least one of the factors are even in all cases, we can factor out an additional 2 and get 4 ⋅ 2 = 8 .
Problem Loading...
Note Loading...
Set Loading...
Note that a 2 ≡ 1 ( m o d 8 ) for any odd a ; check a = 1 , 3 , 5 , 7 . Thus a 2 ≡ b 2 ( m o d 8 ) , meaning that 8 divides a 2 − b 2 . The example a 2 = 1 and b 2 = 9 shows that 8 is maximal.