vix.ing · top · new · best · stats · spec

Note on a theorem of Birch and Erdős

2025/03/01 by Ding, Yuchen, Liu, Honghu, Wang, Zi
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2503.11676

Abstract

Let p,q>1 be two relatively prime integers and ℕ the set of nonnegative integers. Let fp,q(n) be the number of different expressions of n written as a sum of distinct terms taken from \pαqβ:α,β∈ ℕ\. Erd\H os conjectured and then Birch proved that fp,q(n)≥ 1 provided that n is sufficiently large. In this note, for all sufficiently large number n we prove fp,q(n)=2((log n)2)/(2log plog q)(1+O(loglog n/log n)). We also show that limn→∞f2,q(n+1)/f2,q(n)=1. Additionally, we will point out the relations between f2,q(n) and m-ary partitions.

Related