1. Hey, I am sticked by a problem about number theory, i hope someone can give me some hints or steps on it.

Here is the problem, let p=2^n+1, show that n must be even.
And if p=2^n+1, and 3^((p-1)/2)=-1(mod p) show that p is a prime.

I tried to let when n is odd, p=2*2^k+1 and try to find the divisiors, but i failed

Also, for the second problem, i used the quardratic reciprocity law to do this problem but it seems not working.

Thanks for helping me guys!  2.

3. Originally Posted by ryancheng
Hey, I am sticked by a problem about number theory, i hope someone can give me some hints or steps on it.

Here is the problem, let p=2^n+1, show that n must be even.
And if p=2^n+1, and 3^((p-1)/2)=-1(mod p) show that p is a prime.

I tried to let when n is odd, p=2*2^k+1 and try to find the divisiors, but i failed

Also, for the second problem, i used the quardratic reciprocity law to do this problem but it seems not working.

Thanks for helping me guys!
This has all the earmarks of a homework problem in a class on elementary number theory.

You need to do your own homework assignments.  4. This has all the earmarks of a homework problem in a class on elementary number theory.

You need to do your own homework assignments
he is asking for hints and steps, not a solution.

Surely this is something the forum can do  5. I am not going to do your homework either, especially as I loath number theory. But I cannot resist the temptation to ask if you posed the question as it was asked. Consider which is clearly prime.

Or have I misunderstood something?  6. Originally Posted by Guitarist
Or have I misunderstood something?
You have not so much misunderstood something as failed to realize it for what it is. This is what it is:

• (Prove this by induction.) A positive integer that is divisible by 3 obviously cant be prime unless it is equal to 3 itself.  7. Originally Posted by JaneBennet Originally Posted by Guitarist
Or have I misunderstood something?
You have not so much misunderstood something as failed to realize it for what it is. This is what it is:

• (Prove this by induction.) A positive integer that is divisible by 3 obviously cant be prime unless it is equal to 3 itself.
Even easier , 4 is congruent to 1 mod 3, 2 is congruent to 2 mod 3 so is congruent to 2 mod 3 and hence is congruent to 3 mod 3.

It is largely for this reason that I concluded that the OP was asking for homework help and he needed to do the work himself. This is so simple that any hint is tantamount to handing him the answer.  Bookmarks
 Posting Permissions
 You may not post new threads You may not post replies You may not post attachments You may not edit your posts   BB code is On Smilies are On [IMG] code is On [VIDEO] code is On HTML code is Off Trackbacks are Off Pingbacks are Off Refbacks are On Terms of Use Agreement