The parity problem for reducible cubic forms
Number Theory
2007-05-23 v4
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.
Cite
@article{arxiv.math/0408142,
title = {The parity problem for reducible cubic forms},
author = {H. A. Helfgott},
journal= {arXiv preprint arXiv:math/0408142},
year = {2007}
}
Comments
22 pages, gap in section 2.5 fixed; minor changes elsewhere