154k views
4 votes
Show that if 2^m is an odd prime then m = 2^n for some nonnegative integer n

User Xue
by
8.6k points

1 Answer

2 votes
Okay, im not sure if this is what you needed but if we are saying its (2^m)+1, we know that m={1,2} will all result in an odd prime. You can use log₂(m)=n and you will find that for the sequence m={1,2}, the corresponding n values are n={0,1} which are nonnegative integers.

I do not know if you need to show proof but both m={1,2} and the corresponding n values show that this works.
User Shunya
by
8.8k points

No related questions found

Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories