The concrete theory of numbers : Problem of simplicity of Fermat number-twins
英文摘要：
The problem of simplicity of Fermat number-twins $f_{n}^{\pm}=2^{2^n}\pm3$ is studied. The question for what $n$ numbers $f_{n}^{\pm}$ are composite is investigated. The factor-identities for numbers of a kind $x^2 \pm k $ are found.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
