Hardy | A function to count prime factors of a given number n ; n must be odd at this point . So we can skip one element ( Note i = i + 2 ) ; This condition is to handle the case when n is a prime number greater than 2 ; Driver Code
< ? php function exactPrimeFactorCount ( $ n ) { $ count = 0 ; if ( $ n % 2 == 0 ) { $ count ++ ; while ( $ n % 2 == 0 ) $ n = $ n / 2 ; } for ( $ i = 3 ; $ i <= sqrt ( $ n ) ; $ i = $ i + 2 ) { if ( $ n % $ i == 0 ) { $ count ++ ; while ( $ n % $ i == 0 ) $ n = $ n / $ i ; } } if ( $ n > 2 ) $ count ++ ; return $ count ; } $ n = 51242183 ; echo " The ▁ number ▁ of ▁ distinct ▁ prime " . " ▁ factors ▁ is / are ▁ " , exactPrimeFactorCount ( $ n ) , " STRNEWLINE " ; echo " The ▁ value ▁ of ▁ log ( log ( n ) ) ▁ " . " is ▁ " , log ( log ( $ n ) ) , " STRNEWLINE " ; ? >