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.