Quantitative lower bound for Pythagorean pairs in boxes of prime powers
Rongzhong Xiao
所有作者
Rongzhong Xiao
文献摘要
For each positive integer N, let pi be the i-th prime for i∈{1,…,N}, and set ΦN={i=1∏Npiai:ai∈{0,1,…,N−1}}. Write f(N) for the largest cardinality of a subset of ΦN containing no two distinct legs of an integral right triangle. We prove NN−1(logloglogN)≪f(N).