Codex Wiki
OurBigBook.com
Site
Source code
Strong pseudoprime
Home
Mathematics
Area of mathematics
Number theory
Fermat pseudoprime
OurBigBook.com
Words: 111
Articles: 1
Write the even number
N
−
1
as
2
s
m
with
m
odd. An odd composite number
N
is a strong pseudoprime to a coprime base
b
when
b
m
≡
1
(
mod
N
)
(6)
or
b
2
j
m
≡
−
1
(
mod
N
)
for some
0
≤
j
<
s
.
Table of contents
111
1
Strong-pseudoprime bases for a product of two primes with common predecessor divisor ten
Strong pseudoprime
75
Ancestors
(5)
Fermat pseudoprime
Number theory
Area of mathematics
Mathematics
Home
Incoming links
(2)
Solution
Strong-pseudoprime bases for a product of two primes with common predecessor divisor ten