The parity problem for reducible cubic forms

2004/08/10 by H. A. Helfgott, Helfgott, H. A. · 1 citation
Mathematics · #11N32 #11N35 #11N36 #FOS: Mathematics #Number Theory (math.NT) #math.NT #msc:11N32 #msc:11N35 #msc:11N36

paper · pdf · doi:10.48550/arxiv.math/0408142

22 pages, gap in section 2.5 fixed; minor changes elsewhere

arxiv created 2005/09/26 · arxiv updated 2009/12/01

Abstract

Let f in Z[x,y] be a reducible homoegeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.

Cited by

• A Criterion for Equidistribution along the Ω Function over Polynomial Sequences with Applications

Related

• The parity problem for irreducible cubic forms
• Square-free values of reducible polynomials
• Cubic polynomials represented by norm forms
• Squarefree parts of polynomial values
• Real and complex Waring rank of reducible cubic forms