All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Quite a Smithonian! (Posted on 2010-08-21) Difficulty: 3 of 5
A Smith number is a composite number for which, the sum of its digits is equal to the sum of the digits in its prime factorization.
By definition, the factors are treated as digits.
For example, 22 =2*11 is a Smith numberbecause 2 + 2 = 2 + 1 + 1.
Another example: 666 = 2*3*3*37 and 6+6+6 = 2+3+3+(3+7 ).

The following table provides the least number of the 1st occurrence of K consecutive Smith numbersfor K=1, 2, 3, …

Please extend it as far as you are able to.

K ......First member of the least K-tuplet
1 ......4
2 ......728
3 ......73615**
4 .......FIND OUT
5 .......FIND OUT
6 +++ How far can you reach?


**Rem: The third number is 73615, since (73615, 73616, 73617) is the first example of 3 consecutive Smith numbers.
G o o d L u c k !

No Solution Yet Submitted by Ady TZIDON    
Rating: 3.0000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re(2): 7-up | Comment 6 of 8 |
(In reply to re: 7-up by Ady TZIDON)

What is the mistake in using the multiplication symbol × ?

I realize that many programming languages and applications use the asterisk as the multiplication symbol and might reject the multiplication symbol × (Unicode x'00D7'), yet it was a choice in presentation. Is it failing to appear correctly in your browser?

  Posted by Dej Mar on 2010-08-23 20:24:40

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (11)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information