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

Home > Numbers
Power Digits (Posted on 2024-03-15) Difficulty: 4 of 5
Let N=d1d2d3...dn be an n-digit decimal number, with n>1.

Form the sum:
S(N) = d1n + d2n+ d3n + ... + dnn

Prove that there are only a finite number of integers N for which S(N)=N.

For an extra credit, find these values of N.

See The Solution Submitted by K Sengupta    
Rating: 5.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
No SubjectDaniel Adams2024-03-20 15:46:03
re(2): Some numbers but without a proofLarry2024-03-16 12:06:49
different algorithm to find the numbersCharlie2024-03-16 08:13:30
re: Some numbers but without a proofCharlie2024-03-15 18:16:24
SolutionProof of finiteness and commentaryJer2024-03-15 14:23:43
Some ThoughtsSome numbers but without a proofLarry2024-03-15 12:59:10
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 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information