MathDB

Fermat pseudoprime

Source:

April 23, 2020

number theory

Problem Statement

Let

k>1

be the given natural number and

p\in \mathbb{P}

such that

n=kp+1

is composite number. Given that

n\mid 2^{n-1}-1.

Prove that

n<2^k.