- #1
JdotAckdot
- 4
- 0
Just a couple questions that I'd appreciate any help on.
1. if [(2^d) - 1] is prime, prove that d is prime as well.
2. Prove that (p-1)C(k) is congruent to (-1)^k mod p.
I've started them both but ended up getting stuck.
Any ideas?
Thanks
1. if [(2^d) - 1] is prime, prove that d is prime as well.
2. Prove that (p-1)C(k) is congruent to (-1)^k mod p.
I've started them both but ended up getting stuck.
Any ideas?
Thanks