2000 character limit reached
On the upper and lower bound orders of almost prime triples
Published 27 Nov 2023 in math.NT | (2401.01348v1)
Abstract: A Hardy-Littlewood triple is a 3-tuple of integers with the form $(n, n+2, n+6)$. In this paper, we study Hardy-Littlewood triples of the form $(p, P_{a}, P_{b})$ and improve the upper and lower bound orders of it, where $p$ is a prime and $P_{r}$ has at most $r$ prime factors. Our new results generalize and improve the previous results.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.