repdigit

Given base $b$ , a number of the form $d({{b^{n}-1}\\over{b-1}})$ for $n>0$ and $0<d<b$ is written using using the digit $d$ only, $n$ times in that base and is therefore a repdigit. The term, short for ”repeated digit,” is credited to Beiler’s book Recreations in the theory of numbers, in chapter 11.

When $d=1$ , the resulting repdigit is called a repunit. Only repunits can also be prime (and then they are rare). No other repdigit can be prime since it is obvious that it is a multiple of a repunit.

In a trivial way, all repdigits are palindromic numbers.

单词	Repdigit
释义	repdigit Given base $b$ , a number of the form $d({{b^{n}-1}\\over{b-1}})$ for $n>0$ and $0<d<b$ is written using using the digit $d$ only, $n$ times in that base and is therefore a repdigit. The term, short for ”repeated digit,” is credited to Beiler’s book Recreations in the theory of numbers, in chapter 11. When $d=1$ , the resulting repdigit is called a repunit. Only repunits can also be prime (and then they are rare). No other repdigit can be prime since it is obvious that it is a multiple of a repunit. In a trivial way, all repdigits are palindromic numbers.
随便看	Carl Gustav Jacob Jacobi CarlPomerance Carl Pomerance CarlStormer Carl Størmer CarmichaelFunction Carmichael function CarmichaelNumbers561contd Carmichael numbers - 561 (contd) CarmichalNumber561 Carmichal number 561 Carmichal number 561 Carmichal number 561 Carmichal number 561 CarmichalNumber5611 CarmichalNumber56112 CarmichalNumber5612 CarnotCircles Carnot circles CarolKarp Carol Karp CarolNumber Carol number CartanCalculus Cartan calculus