0
$\begingroup$

$\left\{\begin{matrix}u_{1}=5 \\ u_{n}=\frac{2^{u_{n-1}}+1}{3} \end{matrix}\right.$

I conjecture that $u_{n}$ is prime number. But I can not prove it. So I want to know my conjecture is right or wrong.

$\endgroup$
  • 1
    $\begingroup$ Why do you think this works? $\endgroup$ – Alfred Yerger Jul 1 '15 at 16:33
  • $\begingroup$ Reminds me of a famous conjecture by Fermat, disproved by Euler... $\endgroup$ – lhf Jul 1 '15 at 17:08
7
$\begingroup$

No. WolframAlpha says that $u_4$ is not prime and is equal to $$1676083\times \\26955961001\times\\ 29608434354586376051669975373338765263536609888911641073166192\\ 42535637290590853367799328108998193136129252550026666912268005\\ 07277398580985624625950496168983999760414855301693388419156899841$$

$\endgroup$
  • $\begingroup$ What did you put as the query in WA? $\endgroup$ – GFauxPas Jul 1 '15 at 16:18
  • 2
    $\begingroup$ I put "Is (2^683+1)/3 prime?" (where I determined earlier that $u_1=5, u_2=11, u_3=683$ are prime). $\endgroup$ – n55 Jul 1 '15 at 16:21
  • 2
    $\begingroup$ It's amazing to me that Mathematica can handle such large numbers. CASs are pretty sweet. $\endgroup$ – Cameron Williams Jul 1 '15 at 16:45

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.