
The multiplicative persistence of the 65536 first integer numbers for the bases 2 -lower left- to 17 -upper right- [La persistance multiplicative des 65536 premiers nombres entiers pour les bases 2 -en bas et à gauche- à 17 -en haut et à droite-].
5----4----3
| | .
| | .
6 1----2 .
| |
| |
7----8----9----10
PM(N,B) = the multiplicative persistence of N for the base B,
f(...) = an arbitrary ascending function.
Let's define PM(N,B) with an obvious example:
B = 10
1 0
N = 77 (= 7xB + 7xB )
Then the following sequence is computed:
77 ---> (7x7) = 49 ---> (4x9) = 36 ---> (3x6) = 18 ---> (1x8) = 8
1 2 3 4
PM(77,10) = 4
48699984 ---> 4478976 ---> 338688 ---> 27648 ---> 2688 ---> 768 ---> 336 ---> 54 ---> 20 ---> 0
1 2 3 4 5 6 7 8 9