Number Theory Seminar: Greg Martin
Topic
Friable values of polynomials
Speakers
Details
Abstract
We summarize the current meager state of knowledge concerning how often values of polynomials have only small prime factors (that is, the values are "friable" or "smooth"). We also present some evidence, in the form of a theorem conditional upon a suitably explicit hypothesis on prime values of polynomials, to support a conjectured asymptotic formula for the number of friable values of any polynomial.
We summarize the current meager state of knowledge concerning how often values of polynomials have only small prime factors (that is, the values are "friable" or "smooth"). We also present some evidence, in the form of a theorem conditional upon a suitably explicit hypothesis on prime values of polynomials, to support a conjectured asymptotic formula for the number of friable values of any polynomial.
Additional Information
Location: ASB 10900 (IRMACS - SFU Campus)
For more information please visit UBC Mathematics Department
Grey Martin