Thursday, 24 November 2016

Proof for Elementary Number Theory

Prove that for any positive integer n, there exist n consecutive positive integers a1,a2,...,an such that pi divides ai for each i, where pi denotes the i-th prime.



I'm not sure how to prove this. Could we possibly use the Chinese Remainder theorem? If so how?

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...