thanks for the tips guys!
for Q.1 i have arrived at the result of proving that 2^0+2^1+2^3+2^...2^(p-1) = 2^p - 1 i tried couple numbers and it is true... but how do i go about doing that? : <
this might be answered already, but i didnt find a detailed proof... so here it goes:
1. an integer n is perfect if the sum of its divisors including 1 and itself is 2n. show that if 2^p-1 is a prime number, then n=2^(p-1) (2^p -1) is perfect.
2. show that 1+ 1/2 + 1/3 +... +1/n can never...
hi all,
i am wondering how to go about proofs such as the following:
1. if p is an odd prime, show that x^2== a(mod p) has a solution for exactly half the values of a between 1 and p-1 inclusive. if 1<=a<=p-1, and x^2 == a (mod p) has a solution show that it has exactly 2 congrence classes of...