arXiv · math/0408142
The parity problem for reducible cubic forms
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
H. A. Helfgott. 2005-09-26. The parity problem for reducible cubic forms. https://arxiv.org/abs/math/0408142
Cite the original work for its findings. Save a collection to share your selection of sources.