| Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Navigation
| Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Repunit"
(cat. changed) |
(add gen.repunit) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 3: | Line 3: | ||
Repunit numbers are of the form: | Repunit numbers are of the form: | ||
:(10<sup>n</sup> - 1) / 9 | :(10<sup>n</sup> - 1) / 9 | ||
| − | Repunits are a sub-set of [ | + | Repunits are a sub-set of [[Wikipedia:Repdigit|repdigit numbers]]. |
| − | Repdigit ('''rep'''eated '''digit''') numbers are sub-set of [ | + | A '''Repunit prime''' is a repunit which is also [[prime]]. |
| + | |||
| + | Repdigit ('''rep'''eated '''digit''') numbers are sub-set of [[WikipediaPalindromic_number|palindromic numbers]]. | ||
| + | |||
| + | A '''Generalized repunit''' for any base {{Vb}} ≥ 2 is defined as | ||
| + | :<math>(b^n-1)\over (b-1)</math>. | ||
So, [[Mersenne prime]]s are a small sub-set of numbers that fits within the larger classes. The following table shows how these are related (with each group getting smaller on each succesive line.) | So, [[Mersenne prime]]s are a small sub-set of numbers that fits within the larger classes. The following table shows how these are related (with each group getting smaller on each succesive line.) | ||
| Line 30: | Line 35: | ||
==External links== | ==External links== | ||
*[[Wikipedia:Repunit|Repunit]] | *[[Wikipedia:Repunit|Repunit]] | ||
| − | [[Category: | + | [[Category:Number]] |
Latest revision as of 08:04, 12 March 2024
A repunit is a number in any base that is made of only of 1's for each digit. All Mersenne numbers are repunit (repeated unit, "1" being the number referred to as "unity") numbers. 111 is a repunit, in base 2 it is equal to 7 (base 10), in base 3 it is equal to 13 (base 10).
Repunit numbers are of the form:
- (10n - 1) / 9
Repunits are a sub-set of repdigit numbers.
A Repunit prime is a repunit which is also prime.
Repdigit (repeated digit) numbers are sub-set of palindromic numbers.
A Generalized repunit for any base b ≥ 2 is defined as
- [math]\displaystyle{ (b^n-1)\over (b-1) }[/math].
So, Mersenne primes are a small sub-set of numbers that fits within the larger classes. The following table shows how these are related (with each group getting smaller on each succesive line.)
| Palindromic |
| [math]\displaystyle{ \Downarrow }[/math] |
| Repdigit (Palidromes using a single digit) |
| [math]\displaystyle{ \Downarrow }[/math] |
| Repunit (Repdigit, digit = 1) |
| [math]\displaystyle{ \Downarrow }[/math] |
| Mersenne number (Base 2 repunit) |
| [math]\displaystyle{ \Downarrow }[/math] |
| Mersenne prime |
