Catalan pseudoprime

In mathematics, a Catalan pseudoprime is an odd composite number n satisfying the congruence

(-1)^{\frac {n-1}{2}}\cdot C_{\frac {n-1}{2}}\equiv 2{\pmod {n}},

where C_m denotes the m-th Catalan number. The congruence also holds for every odd prime number n that justifies the name pseudoprimes for composite numbers n satisfying it.

Properties

The only known Catalan pseudoprimes are: 5907, 1194649, and 12327121 (sequence A163209 in the OEIS) with the latter two being squares of Wieferich primes. In general, if p is a Wieferich prime, then p² is a Catalan pseudoprime.

gollark: I also made a C-based esolang as a joke because someone insisted compiled languages were faster.

gollark: I can write a hello world in it.

gollark: If you like C, try Rust, it has nice memory management.

gollark: Beat this.

gollark: Functional programming forever! Try F#, it has decent OOP interop!

References

Aebi, Christian; Cairns, Grant (2008). "Catalan numbers, primes and twin primes" (PDF). Elemente der Mathematik. 63 (4): 153–164. doi:10.4171/EM/103.
Catalan pseudoprimes. Research in Scientific Computing in Undergraduate Education.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.