Prove that there does not exist a composite odd number N>1 which does not divide 2k−1 for k=1,2,…,N−2.
I conjectured this result, but wasn't sure how to prove it. I tried it for many cases and it seems to be true.
How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
No comments:
Post a Comment