The parity problem for reducible cubic forms

Simple item page
dc.creatorHelfgott, H. A.
dc.date2004-08-10
dc.date2005-09-26
dc.date.accessioned2026-07-07T06:19:08Z
dc.date.available2026-07-07T06:19:08Z
dc.descriptionLet 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.
dc.description22 pages, gap in section 2.5 fixed; minor changes elsewhere
dc.identifierhttps://arxiv.org/abs/math/0408142
dc.identifierhttp://arxiv.org/abs/math/0408142
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94975
dc.subjectNumber Theory
dc.subject11N32; 11N35, 11N36
dc.titleThe parity problem for reducible cubic forms
dc.typetext

Files

Collections

arXiv