scientific article; zbMATH DE number 2154272
Let \(f\) be a nonconstant squarefree polynomial of \(\mathbb{Z}[X]\) and \(c,H,h\in\mathbb{Z}\) with \(H>0\) and \(h>2\log H\). The paper under review presents an algorithm for the following problem: Which of the values \(f(c+1)\), \(f(c+2),\dots,f(c+H)\) are locally square at all primes \(p\geq h\) (i.e., square in the \(p\)-adic field \(\mathbb{Q}_p)\). It is proved that the average time for this algorithm, when \(c\) is a uniform random element of an interval of length about \(H^2\), is \(H/M^{2+o(1)}\), where \(M=H^{1/\text{lglog}H}\), for fixed \(f\) as \(H\to\infty\), provided that \(c\) has at most \(M^{o(1)}\) digits and \(h\) is in \(M^{o(1)}\). Moreover, the paper presents the results of two record-setting computations: an enumeration of locally square integers up to \(24\times 2^{64}\) and an enumeration of all small coprime integer pairs \((x,y)\) such that \(x^3+y^7\) is locally square at all primes \(p<300\). For the entire collection see [Zbl 1051.11008].
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4664833)