Problem 3

Due in DSC 203 by 3 PM, Friday January 26, 2001



For any positive integer k, let f1(k) denote the square of the sum of the digits of k. For $n\geq 2$, let fn(k)=f1( fn-1(k)). Find f2001(11).



Solutions, questions and/or comments should be directed to Judy Downey or Griff Elder


[Back]    Back to the Problem of the Week Page
 
 


Last modified:   Sat Jan 20 08:42:29 CST 2001