| 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 "Home prime"
m |
m |
||
| Line 1: | Line 1: | ||
| − | The '''home prime''' of ''n'', denoted by HP(''n'') is found by concatenating the [[ | + | The '''home prime''' of ''n'', denoted by HP(''n'') is found by concatenating the [[prime]] [[factor]]s of ''n'', repeatedly, until a prime is reached. The notion of a home prime depends on the [[base]] (except in the case where ''n'' itself is prime). |
For example, the '''home prime''' of 25 is 773 because | For example, the '''home prime''' of 25 is 773 because | ||
| Line 15: | Line 15: | ||
==External links== | ==External links== | ||
| − | *[ | + | *[[Wikipedia:Home prime|Wikipedia]] |
[[Category:Math]] | [[Category:Math]] | ||
Revision as of 16:54, 5 February 2019
The home prime of n, denoted by HP(n) is found by concatenating the prime factors of n, repeatedly, until a prime is reached. The notion of a home prime depends on the base (except in the case where n itself is prime).
For example, the home prime of 25 is 773 because
- 25 = 5×5
- 55 = 5×11
- 511 = 7×73
and finally 773 is prime.
The length of such chains is also of interest, in this case #HP(25) = 3.
While it is expected that every n in every base has a home prime, experimental evidence indicates that these chains can get quite long.
