PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: High Entry average rating: No information on entry rating
repdigit (Definition)

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 even 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" is owned by CompositeFan. [ owner history (1) ]
(view preamble)

View style:


Attachments:
repunit (Definition) by PrimeFan
Log in to rate this entry.
(view current ratings)

Cross-references: palindromic numbers, multiple, obvious, prime, repunit, theory, term, digit, number, base
There is 1 reference to this entry.

This is version 2 of repdigit, born on 2006-10-23, modified 2006-10-23.
Object id is 8468, canonical name is Repdigit.
Accessed 544 times total.

Classification:
AMS MSC11A63 (Number theory :: Elementary number theory :: Radix representation; digital problems)

Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)