Is $2^{2^k}+1$ always a prime number? [on hold]












0















Is $2^{2^k}+1$ always a prime number ?




If yes how to prove? Remark : $k$ is any natural number.






number-theory elementary-number-theory prime-numbers







share|cite|improve this question









New contributor




Kshitij Singh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











put on hold as off-topic by José Carlos Santos, Giuseppe Negro, Nosrati, Eevee Trainer, KM101 2 days ago


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Giuseppe Negro, Nosrati, Eevee Trainer, KM101

If this question can be reworded to fit the rules in the help center, please edit the question.









  • 14




    Yes if you are Fermat, no if you are not. Look up "Fermat number".
    – KCd
    2 days ago






  • 7




    $641mid(2^{2^5}+1)$.
    – Lord Shark the Unknown
    2 days ago






  • 2




    It seems that the converse statement is true : For every $nge 5$, the number $$2^{2^n}+1$$ is composite.
    – Peter
    2 days ago






  • 2




    @Peter No one knows that, though it's suspected.
    – Ethan Bolker
    2 days ago






  • 2




    The first unknown case is $$F_{33}=2^{2^{33}}+1$$
    – Peter
    2 days ago
















0















Is $2^{2^k}+1$ always a prime number ?




If yes how to prove? Remark : $k$ is any natural number.






number-theory elementary-number-theory prime-numbers







share|cite|improve this question









New contributor




Kshitij Singh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











put on hold as off-topic by José Carlos Santos, Giuseppe Negro, Nosrati, Eevee Trainer, KM101 2 days ago


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Giuseppe Negro, Nosrati, Eevee Trainer, KM101

If this question can be reworded to fit the rules in the help center, please edit the question.









  • 14




    Yes if you are Fermat, no if you are not. Look up "Fermat number".
    – KCd
    2 days ago






  • 7




    $641mid(2^{2^5}+1)$.
    – Lord Shark the Unknown
    2 days ago






  • 2




    It seems that the converse statement is true : For every $nge 5$, the number $$2^{2^n}+1$$ is composite.
    – Peter
    2 days ago






  • 2




    @Peter No one knows that, though it's suspected.
    – Ethan Bolker
    2 days ago






  • 2




    The first unknown case is $$F_{33}=2^{2^{33}}+1$$
    – Peter
    2 days ago














0












0








0








Is $2^{2^k}+1$ always a prime number ?




If yes how to prove? Remark : $k$ is any natural number.






number-theory elementary-number-theory prime-numbers







share|cite|improve this question









New contributor




Kshitij Singh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












Is $2^{2^k}+1$ always a prime number ?




If yes how to prove? Remark : $k$ is any natural number.






number-theory elementary-number-theory prime-numbers




number-theory elementary-number-theory prime-numbers






share|cite|improve this question









New contributor




Kshitij Singh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




Kshitij Singh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited 2 days ago









Peter

46.7k1039125




46.7k1039125






New contributor




Kshitij Singh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 2 days ago









Kshitij Singh

21




21




New contributor




Kshitij Singh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Kshitij Singh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Kshitij Singh is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




put on hold as off-topic by José Carlos Santos, Giuseppe Negro, Nosrati, Eevee Trainer, KM101 2 days ago


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Giuseppe Negro, Nosrati, Eevee Trainer, KM101

If this question can be reworded to fit the rules in the help center, please edit the question.




put on hold as off-topic by José Carlos Santos, Giuseppe Negro, Nosrati, Eevee Trainer, KM101 2 days ago


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – José Carlos Santos, Giuseppe Negro, Nosrati, Eevee Trainer, KM101

If this question can be reworded to fit the rules in the help center, please edit the question.








  • 14




    Yes if you are Fermat, no if you are not. Look up "Fermat number".
    – KCd
    2 days ago






  • 7




    $641mid(2^{2^5}+1)$.
    – Lord Shark the Unknown
    2 days ago






  • 2




    It seems that the converse statement is true : For every $nge 5$, the number $$2^{2^n}+1$$ is composite.
    – Peter
    2 days ago






  • 2




    @Peter No one knows that, though it's suspected.
    – Ethan Bolker
    2 days ago






  • 2




    The first unknown case is $$F_{33}=2^{2^{33}}+1$$
    – Peter
    2 days ago














  • 14




    Yes if you are Fermat, no if you are not. Look up "Fermat number".
    – KCd
    2 days ago






  • 7




    $641mid(2^{2^5}+1)$.
    – Lord Shark the Unknown
    2 days ago






  • 2




    It seems that the converse statement is true : For every $nge 5$, the number $$2^{2^n}+1$$ is composite.
    – Peter
    2 days ago






  • 2




    @Peter No one knows that, though it's suspected.
    – Ethan Bolker
    2 days ago






  • 2




    The first unknown case is $$F_{33}=2^{2^{33}}+1$$
    – Peter
    2 days ago








14




14




Yes if you are Fermat, no if you are not. Look up "Fermat number".
– KCd
2 days ago




Yes if you are Fermat, no if you are not. Look up "Fermat number".
– KCd
2 days ago




7




7




$641mid(2^{2^5}+1)$.
– Lord Shark the Unknown
2 days ago




$641mid(2^{2^5}+1)$.
– Lord Shark the Unknown
2 days ago




2




2




It seems that the converse statement is true : For every $nge 5$, the number $$2^{2^n}+1$$ is composite.
– Peter
2 days ago




It seems that the converse statement is true : For every $nge 5$, the number $$2^{2^n}+1$$ is composite.
– Peter
2 days ago




2




2




@Peter No one knows that, though it's suspected.
– Ethan Bolker
2 days ago




@Peter No one knows that, though it's suspected.
– Ethan Bolker
2 days ago




2




2




The first unknown case is $$F_{33}=2^{2^{33}}+1$$
– Peter
2 days ago




The first unknown case is $$F_{33}=2^{2^{33}}+1$$
– Peter
2 days ago










0






active

oldest

votes

















0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes

-

Popular posts from this blog

An IMO inspired problem

Image
14 4 This problem from IMO 1988 is said to be one of the most elegant ones in functional equations. Problem : The function $f$ is defined on the set of all positive integers as follows: begin{align} f(1) = 1, f(3) &= 3, f(2n) = f(n), \ f(4n+1) &= 2f(2n+1) - f(n), \ f(4n+3) &= 3 f(2n+1) - 2f(n) end{align} Find the number of $n$ with $f(n) = n, 1 leq n leq 1988$. The main idea towards the solution is realizing that these conditions stand for the fact that $f(n)$ just reverses the digits in the binary representation of the number $n$. So, essentially the solution is finding the number of binary pallindromes $leq 1988_{10}$. My question is the following : How to reformulate the problem so that $f(n)$ reverses the digits of $n$ in its ternary representation. Or even better, can we reformulate it for a
Read more

Management

Image
Management From Wikipedia, the free encyclopedia Jump to navigation Jump to search "Manager" redirects here. For other uses, see Management (disambiguation) and Manager (disambiguation). An organization chart for the United States Coast Guard shows the hierarchy of managerial roles in that organization. Business administration Management of a business Accounting Management accounting Financial accounting Financial audit Business entities Cooperative Corporation Limited liability company Partnership Sole proprietorship State-owned enterprise Corporate governance Annual general meeting Board of directors Supervisory board Advisory board Audit committee Corporate law Commercial law Constitutional documents Contract Corporate crime Corporate liability Insolvency law International trade law Mergers and acquisitions Economics Commodity Pu
Read more

Investment

Image
Investment From Wikipedia, the free encyclopedia Jump to navigation Jump to search This article is about investment in finance. For investment in macroeconomics, see Investment (macroeconomics). For other uses, see Investment (disambiguation). "Invest" redirects here. For the term in meteorology, see Invest (meteorology). This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. ( February 2017 ) (Learn how and when to remove this template message) In general, to invest is to distribute money in the expectation of some benefit in the future – for example, investment in durable goods, in real estate by the service industry, in factories for manufacturing, in product development, and in research and development. However, this article focuses specifically on investment in financial
Read more