The first ten solutions to the equation m 2 = n 3 + n 2 where m and n are positive integers are listed below.
3 3 8 3 1 5 3 2 4 3 3 5 3 4 8 3 6 3 3 8 0 3 9 9 3 1 2 0 3 + + + + + + + + + + 3 2 8 2 1 5 2 2 4 2 3 5 2 4 8 2 6 3 2 8 0 2 9 9 2 1 2 0 2 = = = = = = = = = = 6 2 2 4 2 6 0 2 1 2 0 2 2 1 0 2 3 3 6 2 5 0 4 2 7 2 0 2 9 9 0 2 1 3 2 0 2
Is the highlighted pattern occurring within the unit digit for all m ever disrupted?
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.
Out of curiosity, do you also know how to show the reason for the relationship between m and n being able to be expressed as the following?
m a = n a × ( a + 1 )
Where n a is the a th n term and m a is the a th m term
Problem Loading...
Note Loading...
Set Loading...
Given that m 2 = n 3 + n 2 = n 2 ( n + 1 ) , we note that solution exist when n + 1 is a perfect square. Let a 2 = n + 1 for a ≥ 2 , then n = k 2 − 1 and m 2 = ( a 2 − 1 ) 2 a 2 = ( ( a − 1 ) a ( a + 1 ) ) 2 . Therefore, m is the product of three consecutive integers. Let m k = k ( k + 1 ) ( k + 2 ) , where k is a positive integer. Let i ∈ [ 1 , 1 0 ] and j , a positive integer. We note that m 1 0 j + i ≡ ( 1 0 j + i ) ( 1 0 j + i + 1 ) ( 1 0 j + i + 2 ) ≡ ( i ) ( i + 1 ) ( i + 2 ) ≡ m i (mod 10) . Therefore, the pattern of the unit digit repeats and has a period of 5. No , the pattern is not disrupted.