The parity problem for irreducible polynomials

HA Helfgott

Research output: Non-textual formWeb publication/site

Abstract

Let f\in \mathbb{Z}[x,y] be an irreducible homogeneous 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.
Translated title of the contributionThe parity problem for irreducible polynomials
Original languageEnglish
EditionIn Preparation
Publication statusPublished - 2012

Fingerprint Dive into the research topics of 'The parity problem for irreducible polynomials'. Together they form a unique fingerprint.

  • Cite this

    Helfgott, HA. (Author). (2012). The parity problem for irreducible polynomials. Web publication/site http://arxiv.org/abs/math/0501177