Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Claim. T. H. Chan, Factors of almost squares and lattice points on circles, Int. J. Number Theory 11 (2015), no. 5, 1701--1708 (card), Theorem 2 (arXiv numbering): every sufficiently large n=(N−a)(N+b)n=(N-a)(N+b) with integers 0≤a≤b≤e(log⁡n)2/70\le a\le b\le e^{(\log n)^{2/7}} has at most eighteen divisors in [n−n1/4(log⁡n)1/14,n+n1/4(log⁡n)1/14][\sqrt n-n^{1/4}(\log n)^{1/14},\sqrt n+n^{1/4}(\log n)^{1/14}]. For each C>0C>0, Cn1/4<n1/4(log⁡n)1/14Cn^{1/4}<n^{1/4}(\log n)^{1/14} once nn is large, so the answer to Problem 887 is yes for these nn, with K=18K=18. The site prints the factorization as (N−a)(N−b)(N-a)(N-b); the paper's is (N−a)(N+b)(N-a)(N+b).

Covers. The question with nn restricted to these numbers, a class that contains N2−1N^2-1, N2−4N^2-4 and the perfect squares.

Depends on. No page of this wiki.

Acceptance. Refereed: International Journal of Number Theory. The site labels the problem OPEN, so its commentary is not acceptance.