Documentation
LeanBandits
.
BanditAlgorithms
.
AuxSums
Search
return to top
source
Imports
Init
Mathlib.Algebra.BigOperators.Intervals
Mathlib.Tactic.Ring.RingNF
Mathlib.Algebra.BigOperators.Ring.Finset
Imported by
sum_mod_range
sum_mod_range_mul
source
theorem
sum_mod_range
{
K
:
ℕ
}
(
hK
:
0
<
K
)
(
a
:
Fin
K
)
:
(∑
s
∈
Finset.range
K
,
if
⟨
s
%
K
,
⋯
⟩
=
a
then
1
else
0
)
=
1
source
theorem
sum_mod_range_mul
{
K
:
ℕ
}
(
hK
:
0
<
K
)
(
m
:
ℕ
)
(
a
:
Fin
K
)
:
(∑
s
∈
Finset.range
(
K
*
m
)
,
if
⟨
s
%
K
,
⋯
⟩
=
a
then
1
else
0
)
=
m