It was not so hard. Having proved that the proposition is true for e =3, I have that 2^3 does not divide 3^k + 1 for k any natural number. But then, all the more so 2^e does not divide 3^k + 1 for e > 3. I've made a fool of myself!
mod for e > 2, k > 0. Is this true? I have tried to prove it by expanding (1 + 2)^k. [Notation: (n; m) := n! / (m! (n - m)!)] E.g., for e = 3 I get: (1+2)^k + 1 = 2 + (k; 1) 2 + (k; 2) 2^2 + (k; e) 2^e + ... So, here it's enough to prove that 2^3 does not divide 2 + (k; 1) 2 + (k; 2) 2^2. The validity for general e seems very hard to prove.
It was not so hard. Having proved that the proposition is true for e =3, I have that 2^3 does not divide 3^k + 1 for k any natural number. But then, all the more so 2^e does not divide 3^k + 1 for e > 3. I've made a fool of myself!