For how many integer pairs (x,y) is a whole 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.
Simple proof 1: 2 ≡ 2 ( m o d 3 ) , 2 x 2 = 1 ( m o d 3 ) , 2 x 2 x 2 ≡ 2 ( m o d 3 ) . As you can see the mods cycle between 1 and 2 and never hit 0, so it will never be divisible by 3.
Simple proof 2: prime factorization of 2 n = 2 x 2 x 2 x 2)... Prime factorization of 3 y = 3 . A . B . C . D . . . (A,B,C,D... Are y's prime factorization), as you can see, 2^n prime factorization has no three in it, therefore it's not divisible by 3 times anything.