perplexus.info :: Numbers : A frugal sequence

A frugal sequence (Posted on 2012-09-14)

Find the longest(?) string of consecutive frugal numbers.

Def: A frugal number is a natural number that has more digits than the number of digits in its prime factorization (including exponents). For example, 128=2^7 and 29282=2*11^4

See The Solution Submitted by Ady TZIDON

Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

re(4): Solution

Comment 13 of 13 |

(In reply to re(3): Solution by Charlie)

C l a r i f i c a t I o n

A number N is called frugal if the number of digits in its prime factorization (including exponents greater than 1) is smaller than the number of digits of N.

A number N is called equidital if the number of digits in its prime factorization (including exponents greater than 1) is equal to the number of digits of N.

For example, 2048=2^11 is frugal.

The union of frugal and equidigital numbers gives economical numbers.

Some authors call the frugal numbers economical.

Every number greater than 1923 can be written as a sum of frugal numbers.

Edited on March 18, 2017, 11:12 am

Posted by Ady TZIDON on 2017-03-18 10:45:24

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info