If p are primes and m any integer, show that , i was told it can be done by induction but still can't prove it...
Follow Math Help Forum on Facebook and Google+
Originally Posted by vincent If p are primes and m any integer, show that , i was told it can be done by induction but still can't prove it... I'll let you verify the base case. So assume true for all and let's use this to show the case for is true too. Now, we have that By our inductive hypothesis, So Notice that Thus .
This beautiful theorem and proof are due to Erdös.
wow thanks, it wasn't simple after all!
Originally Posted by vincent wow thanks, it wasn't simple after all! Somebody gave you this problem as a challenge? That's mean!
View Tag Cloud