2000 character limit reached
On an equation involving fractional powers with prime numbers of a special type
Published 21 May 2017 in math.NT | (1705.07484v1)
Abstract: We consider the equation $[p_{1}{c}] + [p_{2}{c}] + [p_{3}{c}] = N$, where $N$ is a sufficiently large integer, and prove that if $1 < c < \frac{17}{16}$, then it has a solution in prime numbers $p_{1}$, $p_{2}$, $p_{3}$ such that each of the numbers $p_{1} + 2$, $p_{2} + 2$, $p_{3} + 2$ has at most $\left [ \frac{95}{17 - 16c} \right ]$ prime factors, counted with the multiplicity.
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.