0

Composite $2^{398}+1$ in its prime factors.

Now I haven’t come around such problems in their general form, mostly I have proved if they prime or not rather than composing it in its prime factors.

I don’t know if this may lead somewhere however :

$$4\equiv -1\pmod 5$$ $$4^{199}\equiv -1^{199}\pmod 5$$ $$4^{199}+1\equiv 0\pmod 5$$ $$2^{398}+1\equiv 0\pmod 5$$

Showing 1 of its prime factors is essentially 5, but I don’t know how to continue. I’m also interested in the general case or optimisation of such problems in general. Thanks.

Bill Dubuque
  • 282,220

1 Answers1

2

As explained in the comments, $$ 2^{398}+1=(1-2^{100}+2^{199})(1+2^{100}+2^{199}). $$ This is enough for pari-gp to factorize it: \begin{align*} 1-2^{100}+2^{199}& =797 \\ & \cdot 1008116715344410461444141839610180239223178503751442552629, \end{align*} and

\begin{align*} 1+2^{100}+2^{199} & =5\cdot 76554648784441 \\ &\cdot 2099073106303095025303885460879717918033130293 \end{align*}

Dietrich Burde
  • 140,055