If we assume that n satisfies the equation:
Then what can we say about this equation for n?
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.
We are given that 5 ∣ n 2 − n − 2 . We can factorize that to make it easier.
By factorization we get: 5 ∣ ( n + 1 ) ( n − 2 )
Because 5 is a prime, we know that either 5 ∣ n + 1 is true, or 5 ∣ n − 2 is true.
Now let's take a look at our second equation: n 3 + n 2 − 2 . We can also factorize this.
By factorization we get: n ( n − 1 ) ( n + 2 )
We can prove this can never be divisible by 5 by using contradiction.
Assume that 5 ∣ n ( n − 1 ) ( n + 2 )
Again since 5 is a prime number this means that either 5 ∣ n is true, or 5 ∣ n − 1 is true, or 5 ∣ n + 2 is true.
Let's consider the numbers: n − 2 , n − 1 , n , n + 1 , n + 2
Those are 5 consecutive numbers, which mean there is exactly 1 number in those 5 which is divisible by 5.
However our first equation says that either n + 1 or n − 2 is divisible by 5.
And our second equation, if true, tells us that either n or n − 1 or n + 2 is divisble by 5.
This is, however, a contradiction since that means 2 numbers in n − 2 , n − 1 , n , n + 1 , n + 2 is divisible by 5, which is not true.
So therefore we must conclude that our assumption was false and therefore n ( n − 1 ) ( n + 2 ) or n 3 + n 2 − 2 n is never divisible by 5.