Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Diophantine equations in semiprimes (1709.03605v4)

Published 11 Sep 2017 in math.NT

Abstract: A semiprime is a natural number which is the product of two (not necessarily distinct) prime numbers. Let $F(x_1, \ldots, x_n)$ be a degree $d$ homogeneous form with integer coefficients. We provide sufficient conditions, similar to those of the seminal work of B. J. Birch, for which the equation $F (x_1, \ldots, x_n) = 0$ has infinitely many integer solutions with semiprime coordinates. Previously it was known, by a result of \'A. Magyar and T. Titichetrakun, that under the same hypotheses there exist infinitely many integer solutions to the equation with coordinates that have at most $384 n{3/2} d (d+1)$ prime factors.

Summary

We haven't generated a summary for this paper yet.