Consider an integer sequence satisfying: for ( ) Let be a prime, (when this is possible) . Prove that Have fun!
Follow Math Help Forum on Facebook and Google+
Originally Posted by PaulRS Consider an integer sequence satisfying: for ( ) Let be a prime, (when this is possible) . Prove that Have fun! the main idea is to prove that for any we have the proof is by induction over and noting that if then: by induction hypothesis. if is a prime, then for all so the above gives us: but for any integer Q.E.D.
View Tag Cloud