Representation of an integer as the sum of a prime in arithmetic progression and a squarefree integer with certain parity
Kam Hung Yau
Abstract
Kam Hung Yau
Abstract
Uniformly for small $q$ and $(a,q)=1$, we obtain an estimate for the weighted number of ways a sufficiently large integer can be represented as the sum of a prime congruent to $a$ modulo $q$ and a square-free integer. Our method is based on the notion of local model developed by Ramare and may be viewed as an abstract circle method.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Uniformly for small $q$ and $(a,q)=1$, we obtain an estimate for the weighted number of ways a sufficiently large integer can be represented as the sum of a prime congruent to $a$ modulo $q$ and a square-free integer. Our method is based on the notion of local model developed by Ramare and may be viewed as an abstract circle method.
Key concepts: Square-free integer, Mathematics, Integer (computer science), Radical of an integer, Modulo, Parity (physics), Prime factor, Combinatorics