Home primes: Difference between revisions
Content added Content deleted
(added example and explanation of the notation) |
|||
| Line 6: | Line 6: | ||
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 Home prime is found (if the count is greater than 0). |
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 home_prime(4) needs 2 iterations and is the same as home_prime(22) which needs 1 iteration, and (both) equal 211, a prime. |
||
Prime numbers are their own Home prime; |
Prime numbers are their own Home prime; |
||