m and n are positive integers:
m ( m + 1 ) ( m + 2 ) ( m + 3 ) = n ( n + 1 )
Which statemants can be true?
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.
This is brilliant. In my solution i wrote that, but I overcomplicated this.
n x = x + 2 n + 1
If x=n it isn't work.
If x>n n x > 1 and x + 2 n + 1 < 1 . It isn't good too.
If x<n n x < 1 and x + 2 n + 1 > 1 except x = n − 1 , but if it is true: x + 2 n + 1 = 1 . So it's not good.
Consider the numbers m ( m + 3 ) and ( m + 1 ) ( m + 2 ) , which multiply to give m ( m + 1 ) ( m + 2 ) ( m + 3 ) . For example, 6 × 7 × 8 × 9 = 3 0 2 4 = ( 6 × 9 ) ( 7 × 8 ) = 5 4 × 5 6 Notice that the difference between these two numbers is 2 . This is in fact true for any value of m : ( m + 1 ) ( m + 2 ) − m ( m + 3 ) = m 2 + 3 m + 2 − m 2 − 3 m = 2 Call these two numbers n and k . If we want n k to equal a fixed number, in this case m ( m + 1 ) ( m + 2 ) ( m + 3 ) , then if we increase n we must decrease k , and vice versa.
We currently have k = n + 2 , So, in order to have k = n + 1 , we have to increase n and decrease k . But, there is no way to do this while keeping n and k as integers and having n < k , so it is not possible to achieve the required result.
Hence, given a positive integer m it is impossible to find a positive integer n so that m ( m + 1 ) ( m + 2 ) ( m + 3 ) = n ( n + 1 ) .
m ( m + 1 ) ( m + 2 ) ( m + 3 ) = n ( n + 1 )
( m 2 + m ) ( m 2 + 5 m + 6 ) = n 2 + n
m 4 + 5 m 3 + 6 m 2 + m 3 + 5 m 2 + 6 m = n 2 + n
Add one to each side:
m 4 + 6 m 3 + 1 1 m 2 + 6 m + 1 = n 2 + n + 1
Formulas: a 2 + 2 a b + b 2 = ( a + b ) 2 and a ( b ) + c ( b ) = b ( a + c )
[ m 4 + 6 m 3 + 9 m 2 ] + [ 2 m 2 + 6 m ] + 1 = n 2 + n + 1
[ ( m 2 + 3 m ) 2 + 2 ( m 2 + 3 m ) ] + 1 = n 2 + n + 1
( m 2 + 3 m ) ( m 2 + 3 m + [ 2 ] ) + 1 = n 2 + n + 1
( m 2 + 3 m ) ( m 2 + 3 m + 1 ) + m 2 + 3 m + 1 = n 2 + n + 1
( m 2 + 3 m + 1 ) ( m 2 + 3 m + 1 ) = n 2 + n + 1
Now we know that:
n 2 < n 2 + n + 1 < n 2 + 2 n + 1
n 2 < n 2 + n + 1 < ( n + 1 ) 2
So:
n 2 < ( m 2 + 3 m + 1 ) 2 < ( n + 1 ) 2
But in this interval there is no integer square.
There is no solution |
Problem Loading...
Note Loading...
Set Loading...
substitute m 2 + 3 m = x .Then, x(x+2)=n(n+1).
Here, if x>n then LHS >RHS.n=x doesn't work.Again if n>x then n+1>x+1 and consequently n+1 ≥ x + 2 ,which implies RHS>LHS.
So,either way we get a contradiction.