A binary additive problem of Erdős and the order of \(2 \bmod {p^2}\) (Q1265273)

The authors show the problem of representing odd positive integers as the sum of a squarefree number and power of 2 is closely related to that of showing that \(p^2\) divides \(2^{p-1}-1\) for comparatively few primes \(p\). Amongst the six theorems proved, two are particularly interesting: A. Suppose that every odd positive integer is the sum of a squarefree number and a power of 2. Then there are infinitely many primes \(p\) for which \(p^2\) does not divide \(2^{p-1} -1\). Their Theorem 1 is a more precise version of \(A\) above. B. Assume that there are \(\leq 2\log x/(\log \log x)^2\) primes \(\leq x\) for which \(p^2\) divides \(2^{p-1}-1\), whenever \(x\geq 3\). Then all but \(O(x/ \log x)\) of the odd integers \(\leq x\) can be written as the sum of a squarefree number and a power of 2.