check whether n is a frugal number
- a frugal number is a natural number in a given number base that has more digits than the number of digits in its prime factorization in the given number base
Solution Stats
Problem Comments
3 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers51
Suggested Problems
-
Return unique values without sorting
1007 Solvers
-
"Low : High - Low : High - Turn around " -- Create a subindices vector
587 Solvers
-
844 Solvers
-
Write a function man that takes a row vector v and returns a matrix H as follows..
647 Solvers
-
66 Solvers
More from this Author174
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
I'm confused. My solution followed the definition of frugal numbers from https://en.wikipedia.org/wiki/Frugal_number, which includes counting the number of digits in the exponents, and also checks frugality in other bases (not just base 10). But most solutions don't follow this. Can you clarify this?
It seems that the problem is not considering the exponent 1 as a valid digit, For instance, 115248 (6 digits) is called a frugal number in this problem since 115248 (6 digits) > 2^4*3*7^4 (5 digits). If we considered 3^1 as 2 digits instead of the 1-digit 3, 115248 should not be frugal. And the problem should have probably declared this restriction and that the considered base is 10.
PS: The OEIS also imposes this same restriction https://oeis.org/A046759, since 3645 is considered frugal: 3^6*5 instead of 3^6*5^1.
I recommend including the number 414720 to the test suite: 3^4*2^10*5.