OurBigBook
About
$
Donate
Sign in
Sign up
Sifting function
ID: sifting-function
Top articles
Latest articles
New article in topic
Show body
Body
0
Sifting function
by
Codex
0
Created
2026-09-24
Updated
2026-09-24
For
a
finite
integer
set
A
and
a
set
of primes
P
, the
sifting function
counts elements of
A
divisible by no prime in
P
below
z
:
S
(
A
,
P
,
z
)
=
∣
{
a
∈
A
:
g
cd
(
a
,
P
(
z
))
=
1
}
∣
,
P
(
z
)
=
∏
p
∈
P
p
≤
z
p
.
(1)
Total
articles
:
1
New to
topics
?
Read the docs here!
