Friable values of polynomials
Transcript of Friable values of polynomials
![Page 1: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/1.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Friable values of polynomialsHow often do the values of a polynomial
have only small prime factors?
Greg MartinUniversity of British Columbia
April 14, 2006University of South Carolina Number Theory Seminar
notes to be placed on web page:www.math.ubc.ca/∼gerg/talks.html
![Page 2: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/2.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Outline
1 Introduction
2 Bounds for friable values of polynomials
3 Conjecture for prime values of polynomials
4 Conjecture for friable values of polynomials
![Page 3: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/3.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
1 IntroductionFriable integersFriable numbers among values of polynomials
2 Bounds for friable values of polynomials
3 Conjecture for prime values of polynomials
4 Conjecture for friable values of polynomials
![Page 4: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/4.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Friable integers
DefinitionΨ(x , y) is the number of integers up to x whose primefactors are all at most y :
Ψ(x , y) = #{n ≤ x : p | n =⇒ p ≤ y}
Asymptotics: For a large range of x and y ,
Ψ(x , y) ∼ xρ
(log xlog y
),
where ρ(u) is the “Dickman–de Bruijnrho-function”.
Interpretation: A “randomly chosen” integer of size X hasprobability ρ(u) of being X 1/u-friable.
In this talk: Think of u = log x/ log y as being boundedabove, that is, y ≥ xε for some ε > 0.
![Page 5: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/5.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Friable integers
DefinitionΨ(x , y) is the number of integers up to x whose primefactors are all at most y :
Ψ(x , y) = #{n ≤ x : p | n =⇒ p ≤ y}
Asymptotics: For a large range of x and y ,
Ψ(x , y) ∼ xρ
(log xlog y
),
where ρ(u) is the “Dickman–de Bruijnrho-function”.
Interpretation: A “randomly chosen” integer of size X hasprobability ρ(u) of being X 1/u-friable.
In this talk: Think of u = log x/ log y as being boundedabove, that is, y ≥ xε for some ε > 0.
![Page 6: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/6.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Friable integers
DefinitionΨ(x , y) is the number of integers up to x whose primefactors are all at most y :
Ψ(x , y) = #{n ≤ x : p | n =⇒ p ≤ y}
Asymptotics: For a large range of x and y ,
Ψ(x , y) ∼ xρ
(log xlog y
),
where ρ(u) is the “Dickman–de Bruijnrho-function”.
Interpretation: A “randomly chosen” integer of size X hasprobability ρ(u) of being X 1/u-friable.
In this talk: Think of u = log x/ log y as being boundedabove, that is, y ≥ xε for some ε > 0.
![Page 7: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/7.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The Dickman–de Bruijn ρ-function
Definitionρ(u) is the unique continuous solution of thedifferential-difference equation uρ′(u) = −ρ(u − 1) for u ≥ 1that satisfies the initial condition ρ(u) = 1 for 0 ≤ u ≤ 1.
ExampleFor 1 ≤ u ≤ 2,
ρ′(u) = −ρ(u − 1)
u= −1
u=⇒ ρ(u) = C − log u.
Since ρ(u) = 1, we have ρ(u) = 1− log u for 1 ≤ u ≤ 2.
Consequence: Note that ρ(u) = 12 when u =
√e. Therefore
the “median size” of the largest prime factorof n is n1/
√e.
![Page 8: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/8.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The Dickman–de Bruijn ρ-function
Definitionρ(u) is the unique continuous solution of thedifferential-difference equation uρ′(u) = −ρ(u − 1) for u ≥ 1that satisfies the initial condition ρ(u) = 1 for 0 ≤ u ≤ 1.
ExampleFor 1 ≤ u ≤ 2,
ρ′(u) = −ρ(u − 1)
u= −1
u=⇒ ρ(u) = C − log u.
Since ρ(u) = 1, we have ρ(u) = 1− log u for 1 ≤ u ≤ 2.
Consequence: Note that ρ(u) = 12 when u =
√e. Therefore
the “median size” of the largest prime factorof n is n1/
√e.
![Page 9: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/9.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The Dickman–de Bruijn ρ-function
Definitionρ(u) is the unique continuous solution of thedifferential-difference equation uρ′(u) = −ρ(u − 1) for u ≥ 1that satisfies the initial condition ρ(u) = 1 for 0 ≤ u ≤ 1.
ExampleFor 1 ≤ u ≤ 2,
ρ′(u) = −ρ(u − 1)
u= −1
u=⇒ ρ(u) = C − log u.
Since ρ(u) = 1, we have ρ(u) = 1− log u for 1 ≤ u ≤ 2.
Consequence: Note that ρ(u) = 12 when u =
√e. Therefore
the “median size” of the largest prime factorof n is n1/
√e.
![Page 10: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/10.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Friable numbers among values ofpolynomials
DefinitionΨ(F ; x , y) is the number of integers n up to x such that allthe prime factors of F (n) are all at most y :
Ψ(F ; x , y) = #{1 ≤ n ≤ x : p | F (n) =⇒ p ≤ y}
When F (x) is a linear polynomial (friable numbers inarithmetic progressions), we have the sameasymptotic Ψ(F ; x , y) ∼ ρ
( log xlog y
).
Knowing the size of Ψ(F ; x , y) has applications toanalyzing the running time of modern factoringalgorithms (quadratic sieve, number field sieve).
A basic sort of question in number theory: are twoarithmetic properties (in this case, friability and beingthe value of a polynomial) independent?
![Page 11: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/11.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Friable numbers among values ofpolynomials
DefinitionΨ(F ; x , y) is the number of integers n up to x such that allthe prime factors of F (n) are all at most y :
Ψ(F ; x , y) = #{1 ≤ n ≤ x : p | F (n) =⇒ p ≤ y}
When F (x) is a linear polynomial (friable numbers inarithmetic progressions), we have the sameasymptotic Ψ(F ; x , y) ∼ ρ
( log xlog y
).
Knowing the size of Ψ(F ; x , y) has applications toanalyzing the running time of modern factoringalgorithms (quadratic sieve, number field sieve).
A basic sort of question in number theory: are twoarithmetic properties (in this case, friability and beingthe value of a polynomial) independent?
![Page 12: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/12.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Friable numbers among values ofpolynomials
DefinitionΨ(F ; x , y) is the number of integers n up to x such that allthe prime factors of F (n) are all at most y :
Ψ(F ; x , y) = #{1 ≤ n ≤ x : p | F (n) =⇒ p ≤ y}
When F (x) is a linear polynomial (friable numbers inarithmetic progressions), we have the sameasymptotic Ψ(F ; x , y) ∼ ρ
( log xlog y
).
Knowing the size of Ψ(F ; x , y) has applications toanalyzing the running time of modern factoringalgorithms (quadratic sieve, number field sieve).
A basic sort of question in number theory: are twoarithmetic properties (in this case, friability and beingthe value of a polynomial) independent?
![Page 13: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/13.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
1 Introduction
2 Bounds for friable values of polynomialsHow friable can values of special polynomials be?How friable can values of general polynomials be?Can we have lots of friable values?
3 Conjecture for prime values of polynomials
4 Conjecture for friable values of polynomials
![Page 14: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/14.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
How friable can values of specialpolynomials be?
For binomials, there’s a nice trick which yields:
Theorem (Schinzel, 1967)For any nonzero integers A and B, any positive integer d,and any ε > 0, there are infinitely many numbers n forwhich And + B is nε-friable.
Balog and Wooley (1998), building on an idea ofEggleton and Selfridge, extended this result toproducts of binomials
L∏j=1
(Ajndj + Bj).
![Page 15: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/15.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
How friable can values of specialpolynomials be?
For binomials, there’s a nice trick which yields:
Theorem (Schinzel, 1967)For any nonzero integers A and B, any positive integer d,and any ε > 0, there are infinitely many numbers n forwhich And + B is nε-friable.
Balog and Wooley (1998), building on an idea ofEggleton and Selfridge, extended this result toproducts of binomials
L∏j=1
(Ajndj + Bj).
![Page 16: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/16.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Proof for an explicit binomial
ExampleFor any ε > 0, there are infinitely many numbers n for whichF (n) = 3n5 + 7 is nε-friable.
Define nk = 38k−172k . Then
F (nk ) = 35(8k−1)+175(2k) + 7 = −7((−347)10k−1 − 1
)factors into values of cyclotomic polynomials:
F (nk ) = −7∏
m|(10k−1)
Φm(−347).
Φm(x) =∏
1≤r≤m(r ,m)=1
(x − e2πir/m)
Φm has integer coefficients and degree φ(m)
![Page 17: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/17.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Proof for an explicit binomial
ExampleFor any ε > 0, there are infinitely many numbers n for whichF (n) = 3n5 + 7 is nε-friable.
Define nk = 38k−172k . Then
F (nk ) = 35(8k−1)+175(2k) + 7 = −7((−347)10k−1 − 1
)factors into values of cyclotomic polynomials:
F (nk ) = −7∏
m|(10k−1)
Φm(−347).
Φm(x) =∏
1≤r≤m(r ,m)=1
(x − e2πir/m)
Φm has integer coefficients and degree φ(m)
![Page 18: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/18.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Proof for an explicit binomial
ExampleFor any ε > 0, there are infinitely many numbers n for whichF (n) = 3n5 + 7 is nε-friable.
Define nk = 38k−172k . Then
F (nk ) = 35(8k−1)+175(2k) + 7 = −7((−347)10k−1 − 1
)factors into values of cyclotomic polynomials:
F (nk ) = −7∏
m|(10k−1)
Φm(−347).
Φm(x) =∏
1≤r≤m(r ,m)=1
(x − e2πir/m)
Φm has integer coefficients and degree φ(m)
![Page 19: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/19.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Proof for an explicit binomial
ExampleFor any ε > 0, there are infinitely many numbers n for whichF (n) = 3n5 + 7 is nε-friable.
Define nk = 38k−172k . Then
F (nk ) = 35(8k−1)+175(2k) + 7 = −7((−347)10k−1 − 1
)factors into values of cyclotomic polynomials:
F (nk ) = −7∏
m|(10k−1)
Φm(−347).
Φm(x) =∏
1≤r≤m(r ,m)=1
(x − e2πir/m)
Φm has integer coefficients and degree φ(m)
![Page 20: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/20.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Proof for an explicit binomial
ExampleFor any ε > 0, there are infinitely many numbers n for whichF (n) = 3n5 + 7 is nε-friable.
Define nk = 38k−172k . Then
F (nk ) = 35(8k−1)+175(2k) + 7 = −7((−347)10k−1 − 1
)factors into values of cyclotomic polynomials:
F (nk ) = −7∏
m|(10k−1)
Φm(−347).
Φm(x) =∏
1≤r≤m(r ,m)=1
(x − e2πir/m)
Φm has integer coefficients and degree φ(m)
![Page 21: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/21.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
From the last slide
F (n) = 3n5 + 7
nk = 38k−172k
F (nk ) = −7∏
m|(10k−1)
Φm(−347)
primes dividing F (nk ) are ≤ maxm|(10k−1)
∣∣Φm(−347)∣∣
Φm(x) is roughly xφ(m) ≤ xφ(10k−1)
nk is roughly (347)4k , but the largest prime factor ofF (nk ) is bounded by roughly (347)φ(10k−1)
infinitely many k with φ(10k − 1)/4k < ε
How many such friable values? �F ,ε log x , for n ≤ x
ε can be made quantitative ncF / log log log n-friable values
![Page 22: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/22.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
From the last slide
F (n) = 3n5 + 7
nk = 38k−172k
F (nk ) = −7∏
m|(10k−1)
Φm(−347)
primes dividing F (nk ) are ≤ maxm|(10k−1)
∣∣Φm(−347)∣∣
Φm(x) is roughly xφ(m) ≤ xφ(10k−1)
nk is roughly (347)4k , but the largest prime factor ofF (nk ) is bounded by roughly (347)φ(10k−1)
infinitely many k with φ(10k − 1)/4k < ε
How many such friable values? �F ,ε log x , for n ≤ x
ε can be made quantitative ncF / log log log n-friable values
![Page 23: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/23.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
From the last slide
F (n) = 3n5 + 7
nk = 38k−172k
F (nk ) = −7∏
m|(10k−1)
Φm(−347)
primes dividing F (nk ) are ≤ maxm|(10k−1)
∣∣Φm(−347)∣∣
Φm(x) is roughly xφ(m) ≤ xφ(10k−1)
nk is roughly (347)4k , but the largest prime factor ofF (nk ) is bounded by roughly (347)φ(10k−1)
infinitely many k with φ(10k − 1)/4k < ε
How many such friable values? �F ,ε log x , for n ≤ x
ε can be made quantitative ncF / log log log n-friable values
![Page 24: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/24.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
From the last slide
F (n) = 3n5 + 7
nk = 38k−172k
F (nk ) = −7∏
m|(10k−1)
Φm(−347)
primes dividing F (nk ) are ≤ maxm|(10k−1)
∣∣Φm(−347)∣∣
Φm(x) is roughly xφ(m) ≤ xφ(10k−1)
nk is roughly (347)4k , but the largest prime factor ofF (nk ) is bounded by roughly (347)φ(10k−1)
infinitely many k with φ(10k − 1)/4k < ε
How many such friable values? �F ,ε log x , for n ≤ x
ε can be made quantitative ncF / log log log n-friable values
![Page 25: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/25.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Polynomial factorizations
ExampleThe polynomial F (x + F (x)) is always divisible by F (x). Inparticular, if deg F = d , then F (x + F (x)) is roughly xd2
yetis automatically roughly xd2−d -friable.
Mnemonicx + F (x) ≡ x (mod F (x))
Special case:
If F (x) is quadratic with lead coefficient a, then
F (x + F (x)) = F (x) · aF(x + 1
a
).
In particular, if F (x) = x2 + bx + c, then
F (x + F (x)) = F (x)F (x + 1).
![Page 26: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/26.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Polynomial factorizations
ExampleThe polynomial F (x + F (x)) is always divisible by F (x). Inparticular, if deg F = d , then F (x + F (x)) is roughly xd2
yetis automatically roughly xd2−d -friable.
Mnemonicx + F (x) ≡ x (mod F (x))
Special case:
If F (x) is quadratic with lead coefficient a, then
F (x + F (x)) = F (x) · aF(x + 1
a
).
In particular, if F (x) = x2 + bx + c, then
F (x + F (x)) = F (x)F (x + 1).
![Page 27: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/27.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
A refinement of Schinzel
Idea: use the reciprocal polynomial xdF (1/x).
Restrict to F (x) = xd + a2xd−2 + . . . for simplicity.
PropositionLet h(x) be a polynomial such that xh(x)− 1 is divisible byxdF (1/x). Then F (h(x)) is divisible by xdF (1/x). Inparticular, we can take deg h = d −1, in which case F (h(x))
is roughly xd2−d yet is automatically roughly xd2−2d -friable.
Mnemonich(x) ≡ 1/x (mod F (1/x))
Note: The proposition isn’t true for d = 2, since the leftover“factor” of degree 22 − 2 · 2 = 0 is a constant.
![Page 28: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/28.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
A refinement of Schinzel
Idea: use the reciprocal polynomial xdF (1/x).
Restrict to F (x) = xd + a2xd−2 + . . . for simplicity.
PropositionLet h(x) be a polynomial such that xh(x)− 1 is divisible byxdF (1/x). Then F (h(x)) is divisible by xdF (1/x). Inparticular, we can take deg h = d −1, in which case F (h(x))
is roughly xd2−d yet is automatically roughly xd2−2d -friable.
Mnemonich(x) ≡ 1/x (mod F (1/x))
Note: The proposition isn’t true for d = 2, since the leftover“factor” of degree 22 − 2 · 2 = 0 is a constant.
![Page 29: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/29.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Recursively use Schinzel’s construction
Dm: an unspecified polynomial of degree m
Example
deg F (x) = 4. Use Schinzel’s construction repeatedly:
D12 = F (D3) = D4D8D84 = F (D21) = D28D8D48D3984 = F (D987) = D1316D376D48D2208
“score” = 8/3“score” = 16/7“score” = 736/329
For deg F = 2, begin with F (D4) = D2D2D4.Specifically,
F(x + F (x) + F
(x + F (x)
))= F (x) · aF
(x + 1
a
)· D4.
For deg F = 3, begin with F (D4) = D3D3D6.
![Page 30: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/30.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Recursively use Schinzel’s construction
Dm: an unspecified polynomial of degree m
Example
deg F (x) = 4. Use Schinzel’s construction repeatedly:
D12 = F (D3) = D4D8D84 = F (D21) = D28D8D48D3984 = F (D987) = D1316D376D48D2208
“score” = 8/3“score” = 16/7“score” = 736/329
For deg F = 2, begin with F (D4) = D2D2D4.Specifically,
F(x + F (x) + F
(x + F (x)
))= F (x) · aF
(x + 1
a
)· D4.
For deg F = 3, begin with F (D4) = D3D3D6.
![Page 31: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/31.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Recursively use Schinzel’s construction
Dm: an unspecified polynomial of degree m
Example
deg F (x) = 4. Use Schinzel’s construction repeatedly:
D12 = F (D3) = D4D8D84 = F (D21) = D28D8D48D3984 = F (D987) = D1316D376D48D2208
“score” = 8/3“score” = 16/7“score” = 736/329
For deg F = 2, begin with F (D4) = D2D2D4.Specifically,
F(x + F (x) + F
(x + F (x)
))= F (x) · aF
(x + 1
a
)· D4.
For deg F = 3, begin with F (D4) = D3D3D6.
![Page 32: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/32.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Recursively use Schinzel’s construction
Dm: an unspecified polynomial of degree m
Example
deg F (x) = 4. Use Schinzel’s construction repeatedly:
D12 = F (D3) = D4D8D84 = F (D21) = D28D8D48D3984 = F (D987) = D1316D376D48D2208
“score” = 8/3“score” = 16/7“score” = 736/329
For deg F = 2, begin with F (D4) = D2D2D4.Specifically,
F(x + F (x) + F
(x + F (x)
))= F (x) · aF
(x + 1
a
)· D4.
For deg F = 3, begin with F (D4) = D3D3D6.
![Page 33: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/33.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Recursively use Schinzel’s construction
Dm: an unspecified polynomial of degree m
Example
deg F (x) = 4. Use Schinzel’s construction repeatedly:
D12 = F (D3) = D4D8D84 = F (D21) = D28D8D48D3984 = F (D987) = D1316D376D48D2208
“score” = 8/3“score” = 16/7“score” = 736/329
For deg F = 2, begin with F (D4) = D2D2D4.Specifically,
F(x + F (x) + F
(x + F (x)
))= F (x) · aF
(x + 1
a
)· D4.
For deg F = 3, begin with F (D4) = D3D3D6.
![Page 34: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/34.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
How friable can values of generalpolynomials be?
d ≥ 4: define s(d) = d∞∏j=1
(1− 1
uj(d)
), where
u1(d) = d − 1 and uj+1(d) = uj(d)2 − 2
s(2) = s(4)/4 and s(3) = s(6)/4
Theorem(Schinzel, 1967) Given a polynomial F (x) of degree d ≥ 2,there are infinitely many numbers n for which F (n) isns(d)-friable.
F (n) can be n?-friable F (n) can be n?-friabledegree 1 ε degree 5 3.46410degree 2 0.55902 degree 6 4.58258degree 3 1.14564 degree 7 5.65685degree 4 2.23607 degree d ≈ d − 1− 2/d
![Page 35: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/35.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
How friable can values of generalpolynomials be?
d ≥ 4: define s(d) = d∞∏j=1
(1− 1
uj(d)
), where
u1(d) = d − 1 and uj+1(d) = uj(d)2 − 2
s(2) = s(4)/4 and s(3) = s(6)/4
Theorem(Schinzel, 1967) Given a polynomial F (x) of degree d ≥ 2,there are infinitely many numbers n for which F (n) isns(d)-friable.
F (n) can be n?-friable F (n) can be n?-friabledegree 1 ε degree 5 3.46410degree 2 0.55902 degree 6 4.58258degree 3 1.14564 degree 7 5.65685degree 4 2.23607 degree d ≈ d − 1− 2/d
![Page 36: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/36.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
How friable can values of generalpolynomials be?
d ≥ 4: define s(d) = d∞∏j=1
(1− 1
uj(d)
), where
u1(d) = d − 1 and uj+1(d) = uj(d)2 − 2
s(2) = s(4)/4 and s(3) = s(6)/4
Theorem(Schinzel, 1967) Given a polynomial F (x) of degree d ≥ 2,there are infinitely many numbers n for which F (n) isns(d)-friable.
F (n) can be n?-friable F (n) can be n?-friabledegree 1 ε degree 5 3.46410degree 2 0.55902 degree 6 4.58258degree 3 1.14564 degree 7 5.65685degree 4 2.23607 degree d ≈ d − 1− 2/d
![Page 37: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/37.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
How friable can values of generalpolynomials be?
d ≥ 4: define s(d) = d∞∏j=1
(1− 1
uj(d)
), where
u1(d) = d − 1 and uj+1(d) = uj(d)2 − 2
s(2) = s(4)/4 and s(3) = s(6)/4
Theorem(Schinzel, 1967) Given a polynomial F (x) of degree d ≥ 2,there are infinitely many numbers n for which F (n) isns(d)-friable.
F (n) can be n?-friable F (n) can be n?-friabledegree 1 ε degree 5 3.46410degree 2 0.55902 degree 6 4.58258degree 3 1.14564 degree 7 5.65685degree 4 2.23607 degree d ≈ d − 1− 2/d
![Page 38: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/38.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Polynomial substitution yields small lowerbounds
Special caseGiven a quadratic polynomial F (x), there are infinitely manynumbers n for which F (n) is n0.55902-friable.
ExampleTo obtain n for which F (n) is n0.56-friable:
D168 = F (D84) = D42D42D28D8D48D7896 = F (D3948)
D7896
= D1974D1974D1316D376D48D2208
“score” = 4/7 > 0.56“score” = 92/329
“score”
< 0.56
The counting function of such n is about x1/3948.
“Improvement” Balog, M., Wooley can get x2/3948 and ananalogous improvement for deg F = 3.
![Page 39: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/39.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Polynomial substitution yields small lowerbounds
Special caseGiven a quadratic polynomial F (x), there are infinitely manynumbers n for which F (n) is n0.55902-friable.
ExampleTo obtain n for which F (n) is n0.56-friable:
D168 = F (D84) = D42D42D28D8D48D7896 = F (D3948)
D7896
= D1974D1974D1316D376D48D2208
“score” = 4/7 > 0.56“score” = 92/329
“score”
< 0.56
The counting function of such n is about x1/3948.
“Improvement” Balog, M., Wooley can get x2/3948 and ananalogous improvement for deg F = 3.
![Page 40: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/40.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Polynomial substitution yields small lowerbounds
Special caseGiven a quadratic polynomial F (x), there are infinitely manynumbers n for which F (n) is n0.55902-friable.
ExampleTo obtain n for which F (n) is n0.56-friable:
D168 = F (D84) = D42D42D28D8D48D7896 = F (D3948)
D7896
= D1974D1974D1316D376D48D2208
“score” = 4/7 > 0.56“score” = 92/329
“score”
< 0.56
The counting function of such n is about x1/3948.
“Improvement” Balog, M., Wooley can get x2/3948 and ananalogous improvement for deg F = 3.
![Page 41: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/41.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Polynomial substitution yields small lowerbounds
Special caseGiven a quadratic polynomial F (x), there are infinitely manynumbers n for which F (n) is n0.55902-friable.
ExampleTo obtain n for which F (n) is n0.56-friable:
D168 = F (D84) = D42D42D28D8D48D7896 = F (D3948)
D7896
= D1974D1974D1316D376D48D2208
“score” = 4/7 > 0.56“score” = 92/329
“score”
< 0.56
The counting function of such n is about x1/3948.
“Improvement” Balog, M., Wooley can get x2/3948 and ananalogous improvement for deg F = 3.
![Page 42: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/42.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Can we have lots of friable values?
Our expectationFor any ε > 0, a positive proportion of values F (n) arenε-friable.
We know this for:
linear polynomials (arithmetic progressions)
Hildebrand, then Balog and Ruzsa: F (n) = n(an + b),values nε-friable for any ε > 0
Hildebrand: F (n) = (n + 1) · · · (n + L), valuesnβ-friable for any β > e−1/(L−1)
Note: ρ(e−1/L) = 1− 1L , so β > e−1/L is trivial
Dartyge: F (n) = n2 + 1, values nβ-friable for anyβ > 149/179
![Page 43: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/43.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Can we have lots of friable values?
Our expectationFor any ε > 0, a positive proportion of values F (n) arenε-friable.
We know this for:
linear polynomials (arithmetic progressions)
Hildebrand, then Balog and Ruzsa: F (n) = n(an + b),values nε-friable for any ε > 0
Hildebrand: F (n) = (n + 1) · · · (n + L), valuesnβ-friable for any β > e−1/(L−1)
Note: ρ(e−1/L) = 1− 1L , so β > e−1/L is trivial
Dartyge: F (n) = n2 + 1, values nβ-friable for anyβ > 149/179
![Page 44: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/44.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Can we have lots of friable values?
Our expectationFor any ε > 0, a positive proportion of values F (n) arenε-friable.
We know this for:
linear polynomials (arithmetic progressions)
Hildebrand, then Balog and Ruzsa: F (n) = n(an + b),values nε-friable for any ε > 0
Hildebrand: F (n) = (n + 1) · · · (n + L), valuesnβ-friable for any β > e−1/(L−1)
Note: ρ(e−1/L) = 1− 1L , so β > e−1/L is trivial
Dartyge: F (n) = n2 + 1, values nβ-friable for anyβ > 149/179
![Page 45: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/45.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Theorem (Dartyge, M., Tenenbaum, 2001)Let F (x) be any polynomial, let d be the highest degree ofany irreducible factor of F , and let F have exactly K distinctirreducible factors of degree d. Then for any ε > 0, apositive proportion of values F (n) are nd−1/K+ε-friable.
Remark: for friability of level nd−1 or higher, only irreduciblefactors of degree ≥ d matter
Trivial: nd -friable
Can remove the ε at the cost of the counting function: thenumber of n ≤ x for which F (n) is nd−1/K -friable is
� x(log x)K (log 4−1+ε)
.
![Page 46: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/46.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Theorem (Dartyge, M., Tenenbaum, 2001)Let F (x) be any polynomial, let d be the highest degree ofany irreducible factor of F , and let F have exactly K distinctirreducible factors of degree d. Then for any ε > 0, apositive proportion of values F (n) are nd−1/K+ε-friable.
Remark: for friability of level nd−1 or higher, only irreduciblefactors of degree ≥ d matter
Trivial: nd -friable
Can remove the ε at the cost of the counting function: thenumber of n ≤ x for which F (n) is nd−1/K -friable is
� x(log x)K (log 4−1+ε)
.
![Page 47: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/47.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
1 Introduction
2 Bounds for friable values of polynomials
3 Conjecture for prime values of polynomialsSchinzel’s “Hypothesis H” (Bateman–Horn conjecture)A uniform version of Hypothesis H
4 Conjecture for friable values of polynomials
![Page 48: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/48.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Schinzel’s “Hypothesis H” (Bateman–Hornconjecture)
Definitionπ(F ; x) = #{n ≤ x :
f (n) is prime for each irreducible factor f of F}
Conjecture: π(F ; x) is asymptotic to H(F ) li(F ; x), where:
li(F ; x) =
∫0<t<x
min{|F1(t)|,...,|FL(t)|}≥2
dtlog |F1(t)| . . . log |FL(t)|
.
H(F ) =∏
p
(1− 1
p
)−L(1− σ(F ; p)
p
).
L: the number of distinct irreducible factors of F
σ(F ; n): the number of solutions of F (a) ≡ 0 (mod n)
![Page 49: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/49.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Schinzel’s “Hypothesis H” (Bateman–Hornconjecture)
Definitionπ(F ; x) = #{n ≤ x :
f (n) is prime for each irreducible factor f of F}
Conjecture: π(F ; x) is asymptotic to H(F ) li(F ; x), where:
li(F ; x) =
∫0<t<x
min{|F1(t)|,...,|FL(t)|}≥2
dtlog |F1(t)| . . . log |FL(t)|
.
H(F ) =∏
p
(1− 1
p
)−L(1− σ(F ; p)
p
).
L: the number of distinct irreducible factors of F
σ(F ; n): the number of solutions of F (a) ≡ 0 (mod n)
![Page 50: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/50.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Schinzel’s “Hypothesis H” (Bateman–Hornconjecture)
Definitionπ(F ; x) = #{n ≤ x :
f (n) is prime for each irreducible factor f of F}
Conjecture: π(F ; x) is asymptotic to H(F ) li(F ; x), where:
li(F ; x) =
∫0<t<x
min{|F1(t)|,...,|FL(t)|}≥2
dtlog |F1(t)| . . . log |FL(t)|
.
H(F ) =∏
p
(1− 1
p
)−L(1− σ(F ; p)
p
).
L: the number of distinct irreducible factors of F
σ(F ; n): the number of solutions of F (a) ≡ 0 (mod n)
![Page 51: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/51.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Schinzel’s “Hypothesis H” (Bateman–Hornconjecture)
Definitionπ(F ; x) = #{n ≤ x :
f (n) is prime for each irreducible factor f of F}
Conjecture: π(F ; x) is asymptotic to H(F ) li(F ; x), where:
li(F ; x) =
∫0<t<x
min{|F1(t)|,...,|FL(t)|}≥2
dtlog |F1(t)| . . . log |FL(t)|
.
H(F ) =∏
p
(1− 1
p
)−L(1− σ(F ; p)
p
).
L: the number of distinct irreducible factors of F
σ(F ; n): the number of solutions of F (a) ≡ 0 (mod n)
![Page 52: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/52.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
A uniform version of Hypothesis H
Hypothesis UH
π(F ; t)− H(F ) li(F ; t) �d,B 1 +H(F )t
(log t)L+1
uniformly for all polynomials F of degree d with L distinctirreducible factors, each of which has coefficients boundedby tB in absolute value.
li(F ; t) is asymptotic tot
(log t)L for fixed F
For d = K = 1, equivalent to expected number ofprimes, in an interval of length y = xε near x , in anarithmetic progression to a modulus q ≤ y1−ε
Don’t really need this strong a uniformity, but rather onaverage over some funny family to be described later
![Page 53: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/53.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
A uniform version of Hypothesis H
Hypothesis UH
π(F ; t)− H(F ) li(F ; t) �d,B 1 +H(F )t
(log t)L+1
uniformly for all polynomials F of degree d with L distinctirreducible factors, each of which has coefficients boundedby tB in absolute value.
li(F ; t) is asymptotic tot
(log t)L for fixed F
For d = K = 1, equivalent to expected number ofprimes, in an interval of length y = xε near x , in anarithmetic progression to a modulus q ≤ y1−ε
Don’t really need this strong a uniformity, but rather onaverage over some funny family to be described later
![Page 54: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/54.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
1 Introduction
2 Bounds for friable values of polynomials
3 Conjecture for prime values of polynomials
4 Conjecture for friable values of polynomialsStatement of the conjectureReduction to convenient polynomialsTranslation into prime values of polynomialsShepherding the local factorsSums of multiplicative functions
![Page 55: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/55.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
What would we expect on probablisticgrounds?
Let F (x) = f1(x) · · · fL(x), where deg fj(x) = dj . Let u > 0.
fj(n) is roughly ndj , and integers of that size aren1/u-friable with probability ρ(dju).
Are the friabilities of the various factors fj(n)independent? This would lead to a prediction involving
xL∏
j=1
ρ(dju).
What about local densities depending on the arithmeticof F (as in Hypothesis H)?
![Page 56: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/56.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
What would we expect on probablisticgrounds?
Let F (x) = f1(x) · · · fL(x), where deg fj(x) = dj . Let u > 0.
fj(n) is roughly ndj , and integers of that size aren1/u-friable with probability ρ(dju).
Are the friabilities of the various factors fj(n)independent? This would lead to a prediction involving
xL∏
j=1
ρ(dju).
What about local densities depending on the arithmeticof F (as in Hypothesis H)?
![Page 57: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/57.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
What would we expect on probablisticgrounds?
Let F (x) = f1(x) · · · fL(x), where deg fj(x) = dj . Let u > 0.
fj(n) is roughly ndj , and integers of that size aren1/u-friable with probability ρ(dju).
Are the friabilities of the various factors fj(n)independent? This would lead to a prediction involving
xL∏
j=1
ρ(dju).
What about local densities depending on the arithmeticof F (as in Hypothesis H)?
![Page 58: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/58.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Conjecture for friable values of polynomials
ConjectureLet F (x) be any polynomial, let f1, . . . , fL be its distinctirreducible factors, and let d1, . . . , dL be their degrees. Then
Ψ(F ; x , x1/u) = xL∏
j=1
ρ(dju) + O(
xlog x
)
for all 0 < u.
If F irreducible: Ψ(F ; x , x1/u) = xρ(du) + O(x/ log x) for0 < u.
Remark: Rather more controversial thanHypothesis H.
![Page 59: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/59.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Conjecture for friable values of polynomials
Theorem (M., 2002)Assume Hypothesis UH. Let F (x) be any polynomial, letf1, . . . , fL be its distinct irreducible factors, and let d1, . . . , dLbe their degrees. Let d = max{d1, . . . , dL}, and let F haveexactly K distinct irreducible factors of degree d. Then
Ψ(F ; x , x1/u) = xL∏
j=1
ρ(dju) + O(
xlog x
)
for all 0 < u < 1/(d − 1/K ).
If F irreducible: Ψ(F ; x , x1/u) = xρ(du) + O(x/ log x) for0 < u < 1/(d − 1).
Trivial: 0 < u < 1/d .
Reason to talk about more general K : There is one part ofthe argument that causes an additionaldifficulty when K > 1.
![Page 60: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/60.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Conjecture for friable values of polynomials
Theorem (M., 2002)Assume Hypothesis UH. Let F (x) be any polynomial, letf1, . . . , fL be its distinct irreducible factors, and let d1, . . . , dLbe their degrees. Let d = max{d1, . . . , dL}, and let F haveexactly K distinct irreducible factors of degree d. Then
Ψ(F ; x , x1/u) = xL∏
j=1
ρ(dju) + O(
xlog x
)
for all 0 < u < 1/(d − 1/K ).
If F irreducible: Ψ(F ; x , x1/u) = xρ(du) + O(x/ log x) for0 < u < 1/(d − 1).
Trivial: 0 < u < 1/d .
Reason to talk about more general K : There is one part ofthe argument that causes an additionaldifficulty when K > 1.
![Page 61: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/61.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Reduction to convenient polynomials
Without loss of generality, we may assume:
1 F (x) is the product of distinct irreducible polynomialsf1(x), . . . , fK (x), all of the same degree d .
2 F (x) takes at least one nonzero value modulo everyprime.
3 No two distinct irreducible factors fi(x), fj(x) of F (x)have a common zero modulo any prime.
(1) is acceptable since the friability level exceeds xd−1.
(2) is not a necessary condition to have friable values(as it is to have prime values). Nevertheless, we canstill reduce to this case.
Both (2) and (3) are achieved by looking at values ofF (x) on suitable arithmetic progressions F (Qx + R)separately.
![Page 62: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/62.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Reduction to convenient polynomials
Without loss of generality, we may assume:
1 F (x) is the product of distinct irreducible polynomialsf1(x), . . . , fK (x), all of the same degree d .
2 F (x) takes at least one nonzero value modulo everyprime.
3 No two distinct irreducible factors fi(x), fj(x) of F (x)have a common zero modulo any prime.
(1) is acceptable since the friability level exceeds xd−1.
(2) is not a necessary condition to have friable values(as it is to have prime values). Nevertheless, we canstill reduce to this case.
Both (2) and (3) are achieved by looking at values ofF (x) on suitable arithmetic progressions F (Qx + R)separately.
![Page 63: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/63.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Reduction to convenient polynomials
Without loss of generality, we may assume:
1 F (x) is the product of distinct irreducible polynomialsf1(x), . . . , fK (x), all of the same degree d .
2 F (x) takes at least one nonzero value modulo everyprime.
3 No two distinct irreducible factors fi(x), fj(x) of F (x)have a common zero modulo any prime.
(1) is acceptable since the friability level exceeds xd−1.
(2) is not a necessary condition to have friable values(as it is to have prime values). Nevertheless, we canstill reduce to this case.
Both (2) and (3) are achieved by looking at values ofF (x) on suitable arithmetic progressions F (Qx + R)separately.
![Page 64: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/64.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Reduction to convenient polynomials
Without loss of generality, we may assume:
1 F (x) is the product of distinct irreducible polynomialsf1(x), . . . , fK (x), all of the same degree d .
2 F (x) takes at least one nonzero value modulo everyprime.
3 No two distinct irreducible factors fi(x), fj(x) of F (x)have a common zero modulo any prime.
Under (1), we want to prove that
Ψ(F ; x , x1/u) = xρ(du)K + O(
xlog x
)for all 0 < u < 1/(d − 1/K ).
![Page 65: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/65.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Inclusion-exclusion on irreducible factors
PropositionLet F be a primitive polynomial, and let F1, . . . , FK denotethe distinct irreducible factors of F . Then for x ≥ y ≥ 1,
Ψ(F ; x , y) = bxc+∑
1≤k≤K
(−1)k∑
1≤i1<···<ik≤K
M(Fi1 . . . Fik ; x , y).
DefinitionM(f ; x , y) = #{1 ≤ n ≤ x : for each irreducible factor g of f ,there exists a prime p > y such that p | g(n)}.
![Page 66: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/66.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Inclusion-exclusion on irreducible factors
PropositionLet F be a primitive polynomial, and let F1, . . . , FK denotethe distinct irreducible factors of F . Then for x ≥ y ≥ 1,
Ψ(F ; x , y) = bxc+∑
1≤k≤K
(−1)k∑
1≤i1<···<ik≤K
M(Fi1 . . . Fik ; x , y).
DefinitionM(f ; x , y) = #{1 ≤ n ≤ x : for each irreducible factor g of f ,there exists a prime p > y such that p | g(n)}.
![Page 67: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/67.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Inclusion-exclusion on irreducible factors
PropositionLet F be a primitive polynomial, and let F1, . . . , FK denotethe distinct irreducible factors of F . Then for x ≥ y ≥ 1,
Ψ(F ; x , y) = bxc+∑
1≤k≤K
(−1)k∑
1≤i1<···<ik≤K
M(Fi1 . . . Fik ; x , y).
If we knew that M(Fi1 . . . Fik ; x , x1/u) ∼ x(log du)k , then
Ψ(F ; x , x1/u) ∼ x +∑
1≤k≤K
(−1)k∑
1≤i1<···<ik≤K
x(log du)k
= x(
1 +∑
1≤k≤K
(Kk
)(− log du)k
)= x(1− log du)K = xρ(du)K .
![Page 68: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/68.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Inclusion-exclusion on irreducible factors
PropositionLet F be a primitive polynomial, and let F1, . . . , FK denotethe distinct irreducible factors of F . Then for x ≥ y ≥ 1,
Ψ(F ; x , y) = bxc+∑
1≤k≤K
(−1)k∑
1≤i1<···<ik≤K
M(Fi1 . . . Fik ; x , y).
If we knew that M(Fi1 . . . Fik ; x , x1/u) ∼ x(log du)k , then
Ψ(F ; x , x1/u) ∼ x +∑
1≤k≤K
(−1)k∑
1≤i1<···<ik≤K
x(log du)k
= x(
1 +∑
1≤k≤K
(Kk
)(− log du)k
)= x(1− log du)K = xρ(du)K .
![Page 69: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/69.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Inclusion-exclusion on irreducible factors
PropositionLet F be a primitive polynomial, and let F1, . . . , FK denotethe distinct irreducible factors of F . Then for x ≥ y ≥ 1,
Ψ(F ; x , y) = bxc+∑
1≤k≤K
(−1)k∑
1≤i1<···<ik≤K
M(Fi1 . . . Fik ; x , y).
DefinitionM(f ; x , y) = #{1 ≤ n ≤ x : for each irreducible factor g of f ,there exists a prime p > y such that p | g(n)}.
We want to prove M(Fi1 . . . Fik ; x , x1/u) ∼ x(log du)k . To dothis, we sort by the values nj = Fij (n)/pj , among those ncounted by M(Fi1 . . . Fik ; x , x1/u).
![Page 70: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/70.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
PropositionFor f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) =∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
∑b∈R(f ;n1,...,nk )(
π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
).
![Page 71: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/71.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
PropositionFor f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) =∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
∑b∈R(f ;n1,...,nk )(
π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
).
DON’T PANIC
![Page 72: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/72.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
PropositionFor f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) =∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
∑b∈R(f ;n1,...,nk )(
π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
).
not important
ξj = fj(x) ≈ xd
![Page 73: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/73.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
PropositionFor f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) =∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
∑b∈R(f ;n1,...,nk )(
π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
).
not important
ηn1,...,nk ≈ (y max{n1, . . . , nk})1/d (n1 · · ·nk )−1
It’s here only because the large primes dividing fj(n) had toexceed y . (Later we’ll take y = x1/u.)
![Page 74: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/74.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
PropositionFor f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) =∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
∑b∈R(f ;n1,...,nk )(
π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
).
fairly importantR(f ; n1, . . . , nk ) =
{b (mod n1 · · ·nk ) :
n1 | f1(b), n2 | f2(b), . . . , nk | fk (b)}
![Page 75: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/75.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
PropositionFor f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) =∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
∑b∈R(f ;n1,...,nk )(
π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
).
rather important
fn1···nk ,b(t) =f (n1 · · ·nk t + b)
n1 · · ·nk∈ Z[x ]
In fact, a good understanding of the family fn1···nk ,b isnecessary even to treat error terms. However, we’ll onlyinclude the details when treating the main term.
![Page 76: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/76.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
PropositionFor f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) =∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
∑b∈R(f ;n1,...,nk )(
π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
).
rather important
fn1···nk ,b(t) =f (n1 · · ·nk t + b)
n1 · · ·nk∈ Z[x ]
In fact, a good understanding of the family fn1···nk ,b isnecessary even to treat error terms. However, we’ll onlyinclude the details when treating the main term.
![Page 77: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/77.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
PropositionFor f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) =∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
∑b∈R(f ;n1,...,nk )(
π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
).
First: concentrate on
π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
![Page 78: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/78.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Understanding M(f ; x , y) inside out
Look at π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
Upper bound sieve (Brun, Selberg):
π
(fn1···nk ,b;
x − bn1 · · ·nk
)+ O
(H(fn1···nk ,b)x/n1 · · ·nk
(log x)k+1
)
Main term for π(f ; x) (we use Hypothesis UH here!):
H(fn1···nk ,b) li(
fn1···nk ,b;x − b
n1 · · ·nk
)+ O
(H(fn1···nk ,b)x
n1 · · ·nk (log x)k+1
)
li is a pretty smooth function:
H(fn1···nk ,b)x/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk )+ O
(H(fn1···nk ,b)x
n1 · · ·nk (log x)k+1
)
![Page 79: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/79.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Understanding M(f ; x , y) inside out
Look at π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
Upper bound sieve (Brun, Selberg):
π
(fn1···nk ,b;
x − bn1 · · ·nk
)+ O
(H(fn1···nk ,b)x/n1 · · ·nk
(log x)k+1
)
Main term for π(f ; x) (we use Hypothesis UH here!):
H(fn1···nk ,b) li(
fn1···nk ,b;x − b
n1 · · ·nk
)+ O
(H(fn1···nk ,b)x
n1 · · ·nk (log x)k+1
)
li is a pretty smooth function:
H(fn1···nk ,b)x/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk )+ O
(H(fn1···nk ,b)x
n1 · · ·nk (log x)k+1
)
![Page 80: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/80.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Understanding M(f ; x , y) inside out
Look at π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
Upper bound sieve (Brun, Selberg):
π
(fn1···nk ,b;
x − bn1 · · ·nk
)+ O
(H(fn1···nk ,b)x/n1 · · ·nk
(log x)k+1
)
Main term for π(f ; x) (we use Hypothesis UH here!):
H(fn1···nk ,b) li(
fn1···nk ,b;x − b
n1 · · ·nk
)+ O
(H(fn1···nk ,b)x
n1 · · ·nk (log x)k+1
)
li is a pretty smooth function:
H(fn1···nk ,b)x/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk )+ O
(H(fn1···nk ,b)x
n1 · · ·nk (log x)k+1
)
![Page 81: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/81.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Understanding M(f ; x , y) inside out
Look at π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
Upper bound sieve (Brun, Selberg):
π
(fn1···nk ,b;
x − bn1 · · ·nk
)+ O
(H(fn1···nk ,b)x/n1 · · ·nk
(log x)k+1
)
Main term for π(f ; x) (we use Hypothesis UH here!):
H(fn1···nk ,b) li(
fn1···nk ,b;x − b
n1 · · ·nk
)+ O
(H(fn1···nk ,b)x
n1 · · ·nk (log x)k+1
)
li is a pretty smooth function:
H(fn1···nk ,b)x/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk )+ O
(H(fn1···nk ,b)x
n1 · · ·nk (log x)k+1
)
![Page 82: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/82.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Understanding M(f ; x , y) inside out
For f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) =∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
∑b∈R(f ;n1,...,nk )(
π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
)=
∑n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
( ∑b∈R(f ;n1,...,nk )
H(fn1···nk ,b)
)
× x/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk )
(1 + O
( 1log x
)).
Now we have:
y
H(fn1···nk ,b)x/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk )+ O
(H(fn1···nk ,b)x
n1 · · ·nk (log x)k+1
)
![Page 83: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/83.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Understanding M(f ; x , y) inside out
For f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) =∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
∑b∈R(f ;n1,...,nk )(
π(
fn1···nk ,b;x − b
n1 · · ·nk
)− π(fn1···nk ,b; ηn1,...,nk )
)=
∑n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
( ∑b∈R(f ;n1,...,nk )
H(fn1···nk ,b)
)
× x/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk )
(1 + O
( 1log x
)).
Next: concentrate on∑
b∈R(f ;n1,...,nk )
H(fn1···nk ,b)
![Page 84: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/84.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Nice sums over local solutions
Recall
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
Recall
p
σ(f ; p) = {a (mod p) : f (a) ≡ 0 (mod p)}
Proposition∑b∈R(f ;n1,...,nk )
H(fn1···nk ,b) = H(f )g1(n1) · · ·gk (nk ), where
gj(nj) =∏
pν‖nj
(1− σ(f ; p)
p
)−1(σ(fj ; pν)−
σ(fj ; pν+1)
p
).
![Page 85: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/85.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Nice sums over local solutions
Recall
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
Recall
p
σ(f ; p) = {a (mod p) : f (a) ≡ 0 (mod p)}
Proposition∑b∈R(f ;n1,...,nk )
H(fn1···nk ,b) = H(f )g1(n1) · · ·gk (nk ), where
gj(nj) =∏
pν‖nj
(1− σ(f ; p)
p
)−1(σ(fj ; pν)−
σ(fj ; pν+1)
p
).
![Page 86: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/86.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Nice sums over local solutions
Recall
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
Recall
p
R(f ; n1, . . . , nk ) ={
b (mod n1 · · ·nk ) :
meh
n1 | f1(b), n2 | f2(b), . . . , nk | fk (b)}
Proposition∑b∈R(f ;n1,...,nk )
H(fn1···nk ,b) = H(f )g1(n1) · · ·gk (nk ), where
gj(nj) =∏
pν‖nj
(1− σ(f ; p)
p
)−1(σ(fj ; pν)−
σ(fj ; pν+1)
p
).
![Page 87: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/87.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Nice sums over local solutions
Recall
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
Recall
p
R(f ; n1, . . . , nk ) ={
b (mod n1 · · ·nk ) :
meh
n1 | f1(b), n2 | f2(b), . . . , nk | fk (b)}
Proposition∑b∈R(f ;n1,...,nk )
H(fn1···nk ,b) = H(f )g1(n1) · · ·gk (nk ), where
gj(nj) =∏
pν‖nj
(1− σ(f ; p)
p
)−1(σ(fj ; pν)−
σ(fj ; pν+1)
p
).
![Page 88: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/88.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Nice sums over local solutions
Recall
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
Proving this proposition . . .. . . is fun, actually, involving the Chinese remainder theorem,counting lifts of local solutions (Hensel’s lemma), and so on.
Proposition∑b∈R(f ;n1,...,nk )
H(fn1···nk ,b) = H(f )g1(n1) · · ·gk (nk ), where
gj(nj) =∏
pν‖nj
(1− σ(f ; p)
p
)−1(σ(fj ; pν)−
σ(fj ; pν+1)
p
).
![Page 89: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/89.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
For f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) =∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
( ∑b∈R(f ;n1,...,nk )
H(fn1···nk ,b)
)
× x/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk )
(1 + O
( 1log x
))= xH(f )
(1 + O
( 1log x
))×
∑n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk ).
Therefore: consider∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )
n1 · · ·nk
(take care of logarithms later, viapartial summation)
![Page 90: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/90.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
For f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) =∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
( ∑b∈R(f ;n1,...,nk )
H(fn1···nk ,b)
)
× x/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk )
(1 + O
( 1log x
))= xH(f )
(1 + O
( 1log x
))×
∑n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk ).
Therefore: consider∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )
n1 · · ·nk
(take care of logarithms later, viapartial summation)
![Page 91: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/91.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
For f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) =∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
( ∑b∈R(f ;n1,...,nk )
H(fn1···nk ,b)
)
× x/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk )
(1 + O
( 1log x
))= xH(f )
(1 + O
( 1log x
))×
∑n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk ).
Therefore: consider∑
n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )
n1 · · ·nk
First: consider more general sums ofmultiplicative functions
![Page 92: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/92.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Multiplicative functions: one-variable sumsDefinitionLet’s say a multiplicative function g(n) is α on average if ittakes nonnegative values and∑
p≤w
g(p) log pp
∼ α log w .
Note: we really need upper bounds on g(pν) as well . . .
LemmaIf the multiplicative function g(n) is α on average, then∑
n≤t
g(n)
n∼ c(g)(log t)α,
where c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
.
![Page 93: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/93.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Multiplicative functions: one-variable sumsDefinitionLet’s say a multiplicative function g(n) is α on average if ittakes nonnegative values and∑
p≤w
g(p) log pp
∼ α log w .
Note: we really need upper bounds on g(pν) as well . . .
LemmaIf the multiplicative function g(n) is α on average, then∑
n≤t
g(n)
n∼ c(g)(log t)α,
where c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
.
![Page 94: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/94.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Multiplicative functions: one-variable sumsDefinitionLet’s say a multiplicative function g(n) is α on average if ittakes nonnegative values and∑
p≤w
g(p) log pp
∼ α log w .
Note: we really need upper bounds on g(pν) as well . . .
LemmaIf the multiplicative function g(n) is α on average, then∑
n≤t
g(n)
n∼ c(g)(log t)α,
where c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
.
![Page 95: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/95.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Multiplicative functions: one-variable sumsDefinitionLet’s say a multiplicative function g(n) is α on average if ittakes nonnegative values and∑
p≤w
g(p) log pp
∼ α log w .
Note: we really need upper bounds on g(pν) as well . . .
LemmaIf the multiplicative function g(n) is α on average, then∑
n≤t
g(n)
n∼ c(g)(log t)α,
where c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
.
![Page 96: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/96.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Multiplicative functions: more variablesFrom previous slide
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
By the lemma on the previous slide, we easily get:
PropositionIf the multiplicative functions g1(n), . . . , gk (n) are each 1 onaverage, then∑
n1≤t
· · ·∑nk≤t
(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )
n1 · · ·nk∼ c(g1) · · · c(gk )(log t)k .
However, we need the analogous sum with the coprimalitycondition (ni , nj) = 1. (This is where K > 1 makes lifeharder!)
Never mind that g1 + · · ·+ gk isn’t multiplicative!
![Page 97: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/97.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Multiplicative functions: more variablesFrom previous slide
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
By the lemma on the previous slide, we easily get:
PropositionIf the multiplicative functions g1(n), . . . , gk (n) are each 1 onaverage, then∑
n1≤t
· · ·∑nk≤t
(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )
n1 · · ·nk∼ c(g1) · · · c(gk )(log t)k .
However, we need the analogous sum with the coprimalitycondition (ni , nj) = 1. (This is where K > 1 makes lifeharder!)
Never mind that g1 + · · ·+ gk isn’t multiplicative!
![Page 98: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/98.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Multiplicative functions: more variablesFrom previous slide
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
We get:
PropositionIf the multiplicative functions g1(n), . . . , gk (n) are each 1 onaverage, then∑
n1≤t
· · ·∑nk≤t
(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )
n1 · · ·nk∼ c(g1 + · · ·+ gk )(log t)k .
However, we need the analogous sum with the coprimalitycondition (ni , nj) = 1. (This is where K > 1 makes lifeharder!)
Never mind that g1 + · · ·+ gk isn’t multiplicative!
![Page 99: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/99.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Multiplicative functions: more variablesFrom previous slide
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
We get:
PropositionIf the multiplicative functions g1(n), . . . , gk (n) are each 1 onaverage, then∑
n1≤t
· · ·∑nk≤t
(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )
n1 · · ·nk∼ c(g1 + · · ·+ gk )(log t)k .
However, we need the analogous sum with the coprimalitycondition (ni , nj) = 1. (This is where K > 1 makes lifeharder!)
Never mind that g1 + · · ·+ gk isn’t multiplicative!
![Page 100: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/100.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Partial summation: return of the logs
The proposition on the previous slide:. . . gives, after a k -fold partial summation argument:
PropositionIf the multiplicative functions g1(n), . . . , gk (n) are each 1 onaverage, then
∑n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )
n1 · · ·nk
∼ c(g1 + · · ·+ gk )k∏
j=1
logξj
y.
For our functions, gj(p) =(1− σ(f ;p)
p
)−1(σ(fj ; p)− σ(fj ;p2)
p
)= σ(fj ; p)
(1 + O
( 1p
)), and σ(fj ; p) is indeed 1 on average by
the prime ideal theorem.
![Page 101: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/101.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Partial summation: return of the logs
The proposition on the previous slide . . .. . . gives, after a k -fold partial summation argument:
PropositionIf the multiplicative functions g1(n), . . . , gk (n) are each 1 onaverage, then
∑n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )
n1 · · ·nk log(ξ1/n1) · · · log(ξk/nk )
∼ c(g1 + · · ·+ gk )k∏
j=1
loglog ξj
log y.
For our functions, gj(p) =(1− σ(f ;p)
p
)−1(σ(fj ; p)− σ(fj ;p2)
p
)= σ(fj ; p)
(1 + O
( 1p
)), and σ(fj ; p) is indeed 1 on average by
the prime ideal theorem.
![Page 102: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/102.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Partial summation: return of the logs
The proposition on the previous slide . . .. . . gives, after a k -fold partial summation argument:
PropositionIf the multiplicative functions g1(n), . . . , gk (n) are each 1 onaverage, then
∑n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )
n1 · · ·nk log(ξ1/n1) · · · log(ξk/nk )
∼ c(g1 + · · ·+ gk )k∏
j=1
loglog ξj
log y.
For our functions, gj(p) =(1− σ(f ;p)
p
)−1(σ(fj ; p)− σ(fj ;p2)
p
)= σ(fj ; p)
(1 + O
( 1p
)), and σ(fj ; p) is indeed 1 on average by
the prime ideal theorem.
![Page 103: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/103.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
For f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) = xH(f )(
1 + O( 1
log x
))×
∑n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk )
= H(f )c(g1 + · · ·+ gk )
× x( k∏
j=1
loglog ξj
log y
)(1 + O
( 1log x
)).
Recall: ξj = fj(x) ≈ xd , and we care about y = x1/u. Thenlog(log ξj/ log y) ∼ log du.
We have the order of magnitude x(log du)k we wanted . . .but what about the local factors H(f )c(g1 + · · ·+ gk )?
![Page 104: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/104.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
For f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) = xH(f )(
1 + O( 1
log x
))×
∑n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk )
= H(f )c(g1 + · · ·+ gk )
× x(
(log du)k)(
1 + O( 1
log x
)).
Recall: ξj = fj(x) ≈ xd , and we care about y = x1/u. Thenlog(log ξj/ log y) ∼ log du.
We have the order of magnitude x(log du)k we wanted . . .but what about the local factors H(f )c(g1 + · · ·+ gk )?
![Page 105: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/105.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
For f = f1 . . . fk and x and y sufficiently large,
M(f ; x , y) = xH(f )(
1 + O( 1
log x
))×
∑n1≤ξ1/y
· · ·∑
nk≤ξk /y(ni ,nj )=1 (1≤i<j≤k)
g1(n1) · · ·gk (nk )/n1 · · ·nk
log(ξ1/n1) · · · log(ξk/nk )
= H(f )c(g1 + · · ·+ gk )
× x(
(log du)k)(
1 + O( 1
log x
)).
Recall: ξj = fj(x) ≈ xd , and we care about y = x1/u. Thenlog(log ξj/ log y) ∼ log du.
We have the order of magnitude x(log du)k we wanted . . .but what about the local factors H(f )c(g1 + · · ·+ gk )?
![Page 106: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/106.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The magic moment for H(f )c(g1 + · · ·+ gk)
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
We have gj(pν) =
(1− σ(f ; p)
p
)−1(σ(fj ; pν)−
σ(fj ; pν+1)
p
),
and so(g1 + · · ·+ gk )(pν)
)
pν
=1pν
k∑j=1
(1− σ(f ; p)
p
)−1(σ(fj ; pν)
pν−
σ(fj ; pν+1)
pν+1
)
=
(1− σ(f ; p)
p
)−1(σ(f ; pν)
pν− σ(f ; pν+1)
pν+1
)since the fj have no common roots modulo p.
![Page 107: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/107.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The magic moment for H(f )c(g1 + · · ·+ gk)
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
We have gj(pν) =
(1− σ(f ; p)
p
)−1(σ(fj ; pν)−
σ(fj ; pν+1)
p
),
and so(g1 + · · ·+ gk )(pν)
)
pν
=1pν
k∑j=1
(1− σ(f ; p)
p
)−1(σ(fj ; pν)
pν−
σ(fj ; pν+1)
pν+1
)
=
(1− σ(f ; p)
p
)−1(σ(f ; pν)
pν− σ(f ; pν+1)
pν+1
)since the fj have no common roots modulo p.
![Page 108: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/108.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The magic moment for H(f )c(g1 + · · ·+ gk)
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
We have gj(pν) =
(1− σ(f ; p)
p
)−1(σ(fj ; pν)−
σ(fj ; pν+1)
p
),
and so(g1 + · · ·+ gk )(pν)
)
pν
=1pν
k∑j=1
(1− σ(f ; p)
p
)−1(σ(fj ; pν)
pν−
σ(fj ; pν+1)
pν+1
)
=
(1− σ(f ; p)
p
)−1(σ(f ; pν)
pν− σ(f ; pν+1)
pν+1
)since the fj have no common roots modulo p.
![Page 109: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/109.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The magic moment for H(f )c(g1 + · · ·+ gk)
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
Therefore
1 +∞∑
ν=1
(g1 + · · ·+ gk )(pν)
pν
= 1 +∞∑
ν=1
(1− σ(f ; p)
p
)−1(σ(f ; pν)
pν− σ(f ; pν+1)
pν+1
)
![Page 110: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/110.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The magic moment for H(f )c(g1 + · · ·+ gk)
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
Therefore
1 +∞∑
ν=1
(g1 + · · ·+ gk )(pν)
pν
= 1 +
(1− σ(f ; p)
p
)−1 ∞∑ν=1
(σ(f ; pν)
pν− σ(f ; pν+1)
pν+1
)This is a telescoping sum . . .
tada!
![Page 111: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/111.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The magic moment for H(f )c(g1 + · · ·+ gk)
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
Therefore
1 +∞∑
ν=1
(g1 + · · ·+ gk )(pν)
pν
= 1 +
(1− σ(f ; p)
p
)−1 ∞∑ν=1
(σ(f ; pν)
pν− σ(f ; pν+1)
pν+1
)This is a telescoping sum . . .
tada!
![Page 112: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/112.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The magic moment for H(f )c(g1 + · · ·+ gk)
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
Therefore
1 +∞∑
ν=1
(g1 + · · ·+ gk )(pν)
pν
= 1 +
(1− σ(f ; p)
p
)−1(σ(f ; p)
p
)
=
This is a telescoping sum . . . tada!
![Page 113: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/113.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The magic moment for H(f )c(g1 + · · ·+ gk)
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
Therefore
1 +∞∑
ν=1
(g1 + · · ·+ gk )(pν)
pν
= 1 +
(1− σ(f ; p)
p
)−1(σ(f ; p)
p
)=
And this whole expression simplifies . . .
nicely.
![Page 114: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/114.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The magic moment for H(f )c(g1 + · · ·+ gk)
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
Therefore
1 +∞∑
ν=1
(g1 + · · ·+ gk )(pν)
pν
= 1 +
(1− σ(f ; p)
p
)−1(σ(f ; p)
p
)=
(1− σ(f ; p)
p
)−1
.
And this whole expression simplifies . . . nicely.
![Page 115: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/115.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The magic moment for H(f )c(g1 + · · ·+ gk)
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
We conclude that
H(f )c(g1 + · · ·+ gk )
= H(f )∏
p
(1− 1
p
)k(1 +
∞∑ν=1
(g1 + · · ·+ gk )(pν)
pν
)
= H(f )∏
p
(1− 1
p
)k(1− σ(f ; p)
p
)−1
= 1
![Page 116: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/116.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
The magic moment for H(f )c(g1 + · · ·+ gk)
H(f ) =∏
p
(1− 1
p
)−k(1− σ(f ; p)
p
)
c(g) =∏
p
(1− 1
p
)α(1 +
g(p)
p+
g(p2)
p2 + · · ·)
We conclude that
H(f )c(g1 + · · ·+ gk )
= H(f )∏
p
(1− 1
p
)k(1 +
∞∑ν=1
(g1 + · · ·+ gk )(pν)
pν
)
= H(f )∏
p
(1− 1
p
)k(1− σ(f ; p)
p
)−1
= 1
. . . amazing!
![Page 117: Friable values of polynomials](https://reader031.fdocuments.net/reader031/viewer/2022020706/61fcf5ff59724c43286e3458/html5/thumbnails/117.jpg)
Friable values ofpolynomials
Greg Martin
IntroductionFriable integers
Friable values of polynomials
Bounds for friablevalues of polynomialsHow friable can values of specialpolynomials be?
How friable can values of generalpolynomials be?
Can we have lots of friable values?
Conjecture for primevalues of polynomialsSchinzel’s “Hypothesis H”(Bateman–Horn conjecture)
A uniform version of Hypothesis H
Conjecture for friablevalues of polynomialsStatement of the conjecture
Reduction to convenientpolynomials
Translation into prime values ofpolynomials
Shepherding the local factors
Sums of multiplicative functions
Summary
Summary
There are lots of open problems concerning friablevalues of polynomials—and many possibleimprovements from a single clever new idea.
The asymptotics for friable values of polynomialsdepends on the degrees of their irreduciblefactors—but shouldn’t depend on the polynomialotherwise.
Notes to be placed on web page
www.math.ubc.ca/∼gerg/talks.html