- #1
mgiddy911
- 335
- 0
I just took a number theory midterm, the professor had a question the that said
"Show by induction that for all integers n, 4[tex]^{n}[/tex] is congruent to 1 +3n mod(9).
Now am I crazy or did the professor probably mean to say integers greater or equal to 0, or for any natural number n, ...
couldn't you show a counter example for instance n = -2, such that the congruence is false?
"Show by induction that for all integers n, 4[tex]^{n}[/tex] is congruent to 1 +3n mod(9).
Now am I crazy or did the professor probably mean to say integers greater or equal to 0, or for any natural number n, ...
couldn't you show a counter example for instance n = -2, such that the congruence is false?