repeatedly divide ' n ' by the given prime numbers until all the numbers are used or ' n ' > 1
for ( $ i = 0 ; $ i < $ SIZE && $ n > 1 ; $ i ++ ) while ( $ n % $ prime [ $ i ] == 0 ) $ n = $ n / $ prime [ $ i ] ;