Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Let count the integers that are sums of two squarefull (powerful) numbers. Corollary 2 of V. Blomer and A. Granville, Estimates for representation numbers of quadratic forms, Duke Math. J. 135 (2006), no. 2, 261–302, states that for some
as recorded on the source card blomer_2006_estimates_representation_numbers_quadratic_forms. Since , the lower bound alone gives , so is not asymptotic to for any . This disproves Problem 1081 independently of [[problems/diophantine_problems/E1081/claims/1981_01_01_odoni|Odoni's earlier disproof]], and it fixes the order of up to powers of .
Depends on. No other wiki page; the claim rests on the cited paper.
Acceptance. Refereed: the paper appeared in the Duke Mathematical Journal, volume 135 (2006), published online on 1 November 2006 according to its Crossref record. Not reviewed: the site's curator credits Odoni with the disproof and cites this paper for the sharpest estimate of , which is not a credit for the disproof.