-
there exists a
repunit in base-b that is a
multiple of n. To see this
consider repunits R1(b),...,Rn(b).
Because there are n
repunits but only n−1 non-zero...
-
repdigits are
palindromic numbers and are
multiples of
repunits.
Other well-known
repdigits include the
repunit primes and in
particular the
Mersenne primes (which...
-
generalization of
repunits; they are
integers represented by
repeated instances of the same digit. For example, 333 is a repdigit. The
primality of
repunits is of...
- This is a list of
repunit primes in
various bases. Base-2
repunit primes are
called Mersenne primes. The
first few base-3
repunit primes are 13, 1093...
- in base 90, 1111111111111 in base 2) are the only two
numbers that are
repunits with at
least 3
digits in two
different bases. Feit–Thompson conjecture...
- to
represent 5 as a tally.
Unary numbers should be
distinguished from
repunits,
which are also
written as
sequences of ones but have
their usual decimal...
- MR 1723687. Zbl 0935.05024. Sloane, N. J. A. (ed.). "Sequence A002275 (
Repunits: (10^n - 1)/9.
Often denoted by R_n.)". The On-Line
Encyclopedia of Integer...
-
personal computers. He
found many
large prime numbers of
special forms:
repunits,
Fibonacci primes,
prime Lucas numbers, twin primes,
Sophie Germain primes...
- 199933, 1111111111111111111, 11111111111111111111111 (OEIS: A016114) All
repunit primes are circular. A
cluster prime is a
prime p such that
every even...
- 11111111111111111111111, ... (sequence A004022 in the OEIS).
These primes are
called repunit primes.
Another example is when we take b = −12, we get n
values of: 2...
