Tuesday, 16 May 2017

number theory - How to prove that the numerator is divided by 101 1+frac12+ldots+frac1100




How to prove that: 1+12++1100=pq,gcd(p,q)=1p101





I tried to allocate a numerator, but nothing happened, I tried to calculate the amount manually, but this also did not lead to success, I will be happy with any help.


Answer



For 1n100 let 1r(n)100 where 100!nr(n)(mod101).



We have $1\leq n

Another way is to consider this in the field F=Z101. Let S=100n=11/n. Now F does not have characteristic 2, so in F we have S=xF{0}(x1)=yF{0}(y)=0. The implication is that in Z we have S=A/100! for some AZ, and if 101 does not divide A then in Z101 we would have S0.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

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