We know that the number 1234567 is not divisible by 3 because the sum of its digits is not divisible by 3. Is 1 2 3 4 5 6 7 3 − 1 2 3 4 5 6 7 divisible by 3?
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.
Nice work. Sam, even if you wrote something that does not make sense, I was going to agree with you because my son's name is Sam.
Log in to reply
Please respect other members. How come this does not make sense?
Log in to reply
I did not say it does not make sense. I said "even if". I was just trying to be nice to him because I have a son whose name is Sam, nothing more or less.
Log in to reply
@Hana Wehbi – Sorry I didn't see the words 'even if'. But for me it's still weird to see something like this......
For any positive integer n , n 3 − n is divisible by 3 .
Applying Fermat's Little Theorem, as 3 is prime and ( 3 , 1 2 3 4 5 6 7 ) = 1 , then 1 2 3 4 5 6 7 3 ≡ 1 2 3 4 5 6 7 ( m o d 3 )
Nice, never thought of it like that.
Problem Loading...
Note Loading...
Set Loading...
n 3 − n = n ( n 2 − 1 ) = n ( n + 1 ) ( n − 1 )
These are three consecutive numbers so at least one will be divisible by 3.