The concrete theory of numbers : Problem of simplicity of Fermat number-twins

Simple item page
dc.creatorTarasov, Boris V.
dc.date2007-07-06
dc.date.accessioned2026-07-07T08:14:17Z
dc.date.available2026-07-07T08:14:17Z
dc.descriptionThe 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.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/0707.0907
dc.identifierhttp://arxiv.org/abs/0707.0907
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133070
dc.subjectGeneral Mathematics
dc.subject11A51
dc.titleThe concrete theory of numbers : Problem of simplicity of Fermat number-twins
dc.typetext

Files

Collections

arXiv