Variants of the Diophantine equation \(n! + 1 = y^2\) (Q2269736)

Assume that \(p\) is a prime such that \(p\parallel A \). The authors prove that if \((n,y)\) are positive integers such that \(n!+A=y^2\), then \(n<2p\). It follows that the only solutions \((n,y)\) to the Diophantine equation \(n!+505=y^2\) are \((4,23),(5,25),(6,35)\). Let \(k\geq 0\) be a fixed integer. All positive integer solutions \((n,y)\) of the Diophantine equation \(n!+3k+2=y^2\) have \(n<3\). All positive integer solutions \((n,y)\) of the Diophantine equation \(n!+4k+3=y^2\) have \(n<4\). Each of these equations has at most one solution. All positive integer solutions \((n_1,n_2,A,y)\) of the simultaneous equations \(n_1!+A+1=y^2\) and \(n_2!+A=y^2\) have \((n_1,n_2)=(2,1)\). The only positive integer solutions \((y,n)\) of the Diophantine equation \(n!=y^r(y+1)\) with \(r=3\) and \(y+1\) cube-free are \((1,2),(2,4)\). If \(r=2\) and \(y+1\) is square-free, the only positive integer solution is \((1,2)\). For the set \[ S=\Big\{\Big|\prod_{\substack{ k\nmid n \\1\leq k\leq n }} k-y^2\Big|:n,y\in{\mathbb N}\Big\} \] let \(S(T)=S\cap[1,T]\). Then \(|S(T)|=T^{\frac 12+o(1)}\) as \(T\to\infty\).