If , , , are consecutive odd numbers, then is always divisible by ?
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.
Assume, a < b < c < d and let a = 2 n + 1 where n is an integer. Since a , b , c , d are consecutive odd integers, it follows that b = 2 n + 3 , c = 2 n + 5 , d = 2 n + 7 .
Observe that a 2 + b 2 + c 2 + d 2 = ( 2 n + 1 ) 2 + ( 2 n + 3 ) 2 + ( 2 n + 5 ) 2 + ( 2 n + 7 ) 2 = ( 2 n ) 2 + ( 2 n ) 2 + ( 2 n ) 2 + ( 2 n ) 2 + 2 ( 2 n ) ( 1 ) + 2 ( 2 n ) ( 3 ) + 2 ( 2 n ) 5 + 2 ( 2 n ) 7 + 1 2 + 3 2 + 5 2 + 7 2 . It is quite obvious that the terms but 1 2 + 3 2 + 5 2 + 7 2 have a factor of 4 , it suffices to check if 1 2 + 3 2 + 5 2 + 7 2 has a factor of 4 and indeed it does as 1 2 + 3 2 + 5 2 + 7 2 = 8 4 .