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

Home > Just Math
A digital root-perfect power problem (Posted on 2008-07-01) Difficulty: 4 of 5
Let S[x] be the digital root function (also known as the repeated digital sum function), where one adds the digits of positive integer x, then adds the digits of the sum until obtaining a single-digit number. (For example, S[975] = 3 because 9 + 7 + 5 = 21 and 2 + 1 = 3).

Given S[aa] = 2, what is the smallest positive integer that a can be such that a is a perfect power?


Note: a is a perfect power if there exist natural numbers m > 1, and k > 1 such that mk = a.

See The Solution Submitted by Dej Mar    
Rating: 4.0000 (2 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
digit countsDaniel2008-12-29 06:55:56
AnswerK Sengupta2008-12-28 16:22:36
re(2): Extra Credit (spoiler)Steve Herman2008-07-14 10:33:59
re: Extra Credit (spoiler)Dej Mar2008-07-10 17:47:35
Some ThoughtsExtra Credit (spoiler)Steve Herman2008-07-10 11:35:28
Nailed it, I hope (spoiler)Steve Herman2008-07-01 20:03:23
Hints/TipsMissed it by that much (spoiler)Steve Herman2008-07-01 19:48:23
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 (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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