Home primes: Difference between revisions
Content added Content deleted
Thundergnat (talk | contribs) m (adjust spacing, wording tweak) |
m (replaced my made-up pseudo function call notation with proper english) |
||
Line 4: | Line 4: | ||
In number theory, the '''home prime HP(n)''' of an integer '''n''' greater than 1 is the prime number obtained by repeatedly factoring the increasing concatenation of prime factors including repetitions. |
In number theory, the '''home prime HP(n)''' of an integer '''n''' greater than 1 is the prime number obtained by repeatedly factoring the increasing concatenation of prime factors including repetitions. |
||
The traditional notation has the prefix "HP" and a postfix count of the number of iterations until the |
The traditional notation has the prefix "HP" and a postfix count of the number of iterations until the home prime is found (if the count is greater than 0), for instance HP4(2) === HP22(1) === 211 is the same as saying the home prime of 4 needs 2 iterations and is the same as the home prime of 22 which needs 1 iteration, and (both) resolve to 211, a prime. |
||
Prime numbers are their own Home prime; |
Prime numbers are their own Home prime; |