The square pyramidal number is equal to the sum of all perfect squares up to and including .
What is the highest power of that will divide into the square pyramidal number?
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.
The n t h square pyramidal number can be found by using ∑ i = 1 n i 2 = 6 ( n ) ( n + 1 ) ( 2 n + 1 ) . Prime factorzing 4 9 3 0 7 6 9 8 9 9 2 leads to 4 9 3 0 7 6 9 8 9 9 2 = 6 ∗ 2 0 1 8 3 n = 6 ∗ 2 0 1 8 3 Thus let P = 6 ∗ 2 0 1 8 3 pyramidal number which means P = 6 ( 6 ∗ 2 0 1 8 3 ) ( 6 ∗ 2 0 1 8 3 + 1 ) ( 2 ( 6 ∗ 2 0 1 8 3 ) + 1 ) Let m be the maximum number whereby 2 0 1 8 m ∣ P . Simplifying P P = ( 2 0 1 8 3 ) ( 6 ∗ 2 0 1 8 3 + 1 ) ( 2 ( 6 ∗ 2 0 1 8 3 ) + 1 ) We then want to find 2 0 1 8 m ∣ ( 2 0 1 8 3 ) ( 6 ∗ 2 0 1 8 3 + 1 ) ( 2 ( 6 ∗ 2 0 1 8 3 ) + 1 ) Clearly, the highest power of 2 0 1 8 that divides P is 3 because of the first term. The second and third term both are not divisible by 2 0 1 8 .