Carmichael

A002997

the number of first <code>n</code> entries from the sequence.

a logical; <code>TRUE</code> to use large number representation, <code>FALSE</code> otherwise.

Under OEIS <a href="https://oeis.org/A002997">A002997</a>, a Carmichael number is
a composite number $n$ such that
$$b^{n-1} = 1 (mod n)$$
for all integers $b$ which are relatively prime to $n$. First 6 Carmichael numbers are 	561, 1105, 1729, 2465, 2821, 6601.

Generates well-known integer sequences. 'gmp' package is adopted for computing with arbitrarily large numbers. Every function has hyperlink to its corresponding item in OEIS (The On-Line Encyclopedia of Integer Sequences) in the function help page. For interested readers, see Sloane and Plouffe (1995, ISBN:978-0125586306).

Kisung You

Zseq

Integer Sequence Generator

Carmichael function

<dl><dt>n</dt>
<dd>the number of first <code>n</code> entries from the sequence.</dd>
<dt>gmp</dt>
<dd>a logical; <code>TRUE</code> to use large number representation, <code>FALSE</code> otherwise.</dd></dl>

Arguments

Under OEIS <a href='https://oeis.org/A002997'>A002997</a>, a Carmichael number is
a composite number $n$ such that
$$b^{n-1} = 1 (mod n)$$
for all integers $b$ which are relatively prime to $n$. First 6 Carmichael numbers are 	561, 1105, 1729, 2465, 2821, 6601.

Carmichael numbers — Carmichael

<dl>

<dt>n</dt>
<dd>the number of first <code>n</code> entries from the sequence.</dd>


<dt>gmp</dt>
<dd>a logical; <code>TRUE</code> to use large number representation, <code>FALSE</code> otherwise.</dd>

</dl>

Carmichael: Carmichael numbers

Description

Usage

Value

Arguments

Examples