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}\pm 3$ 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.