The number of prime powers p^k below cd-c-d that can be written as cx+dy is asymptotically k/(k+1) times g^{1/k}/log g as c grows.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.NT 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
The distribution of powers of primes related to the Frobenius problem
The number of prime powers p^k below cd-c-d that can be written as cx+dy is asymptotically k/(k+1) times g^{1/k}/log g as c grows.