Carmichael numbers in the sequence (k2n+1)n 1

Abstract

We prove that for each odd number k, the sequence (k2n+1)n 1 contains only a finite number of Carmichael numbers. We also prove that k=27 is the smallest value for which such a sequence contains some Carmichael number.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…