Documentation
LeanPool
.
Zeta5Irrational
.
Growth
.
Assembly2
Search
return to top
source
Imports
Init
LeanPool.Zeta5Irrational.Constants
Mathlib.Tactic.Linarith
LeanPool.Zeta5Irrational.Growth.Constants
LeanPool.Zeta5Irrational.Growth.OuterPrime
LeanPool.Zeta5Irrational.Growth.TablePrime
Mathlib.Tactic.NormNum.Ineq
Mathlib.Tactic.NormNum.Inv
Mathlib.Tactic.NormNum.Pow
Mathlib.Tactic.Positivity.Basic
Mathlib.Tactic.Ring.Basic
Mathlib.Algebra.Order.Floor.Semifield
Imported by
Zeta5Irrational
.
floor_Kr_div
Zeta5Irrational
.
floor_Kr_outer
Zeta5Irrational
.
Bmax_le
Zeta5Irrational
.
ktop_sub_klo
Zeta5Irrational
.
Ctail_le
Zeta5Irrational
.
Ctab_le
Zeta5Irrational
.
Cout_le
Growth: the three prime ranges
K/400 < p ≤ K/20
,
K/20 < p ≤ K/3
,
K/3 < p ≤ 2h
#
source
theorem
Zeta5Irrational
.
floor_Kr_div
(
n
d
:
ℕ
)
(
_hd
:
0
<
d
)
:
⌊
Kr
n
/
↑
d
⌋₊
=
40
*
n
/
d
source
theorem
Zeta5Irrational
.
floor_Kr_outer
(
n
:
ℕ
)
:
⌊
Kr
n
/
(
20
/
37
)
⌋₊
=
74
*
n
Bounds on the additive constants
#
source
theorem
Zeta5Irrational
.
Bmax_le
{
n
p
Q
:
ℕ
}
(
hq
:
40
*
n
/
p
≤
Q
)
:
Bmax
n
p
≤
(
5
*
↑
Q
+
10
)
*
(
3
*
↑
Q
+
6
)
source
theorem
Zeta5Irrational
.
ktop_sub_klo
(
n
p
:
ℕ
)
:
↑(
ktopI
n
p
-
kloI
n
p
)
=
10
*
↑(
40
*
n
/
p
)
+
26
source
theorem
Zeta5Irrational
.
Ctail_le
{
n
p
:
ℕ
}
(
hp
:
0
<
p
)
(
hq
:
40
*
n
/
p
<
400
)
(
hn
:
↑
n
≤
10
*
↑
p
)
:
Ctail
n
p
≤
10
^
7
source
theorem
Zeta5Irrational
.
Ctab_le
{
n
p
:
ℕ
}
(
hq
:
40
*
n
/
p
≤
20
)
{
k
:
ℤ
}
(
hk1
:
kloI
n
p
≤
k
)
(
hk2
:
k
≤
ktopI
n
p
)
:
Ctab
n
p
k
≤
10
^
8
source
theorem
Zeta5Irrational
.
Cout_le
{
n
p
:
ℕ
}
(
hq
:
40
*
n
/
p
≤
2
)
:
Cout
n
p
≤
10
^
5