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

Home > Just Math
srebmuN desreveR (Posted on 2010-11-18) Difficulty: 3 of 5
Let us read a number k from right to left and call the result RVR(k); e.g. RVR(1)=1 , RVR(45)=54 , RVR(1200000000)=21.

1.Find the smallest positive integer k for which RVR(k) > (k^2 mod 100000).
2. Find the sum of the 10000 RVRs i.e. for all integers from 1 to 10000 inclusive.

Based upon problems from

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

Comments: ( You must be logged in to post comments.)
  Subject Author Date
SolutionAnalytic Solution to part 2Jer2010-11-19 16:59:04
re: computer solutionCharlie2010-11-18 22:19:48
Solutioncomputer solutionCharlie2010-11-18 22:09:55
Q-1 ?ed bottemiller2010-11-18 21:08:11
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information