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 projectkhayyam.blogspot.com