How to prove that: 1+12+…+1100=pq,gcd(p,q)=1⇒p⋮101
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 1≤n≤100 let 1≤r(n)≤100 where 100!n≡r(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=∑x∈F∖{0}(x−1)=∑y∈F∖{0}(y)=0. The implication is that in Z we have S=A/100! for some A∈Z, and if 101 does not divide A then in Z101 we would have S≠0.
No comments:
Post a Comment