数学
猜想
整数(计算机科学)
组合数学
数论
平方(代数)
Elliott–Halberstam猜想
素数(序理论)
质数
abc猜想
离散数学
比尔猜想
几何学
计算机科学
程序设计语言
标识
DOI:10.1142/s1793042122501196
摘要
Conjecture H of Hardy and Littlewood says that every large integer is either a square or the sum of a prime and a square. Despite progress showing that this is true for almost all large integers, Conjecture H remains unproven. In this paper, Conjecture H is approximated using Piatetski–Shapiro sequences by showing that all large integers can be written in the form [Formula: see text] for any fixed [Formula: see text]. The existing results for the conjecture are also extended by showing that almost all large integers can be written in the form [Formula: see text] for any fixed [Formula: see text].
科研通智能强力驱动
Strongly Powered by AbleSci AI