Project Euler #254: Sums of Digit Factorials

  • + 0 comments
    G[42] =    344479;
      42  = sf(344479)
      42  = s(3! + 4! + 4! + 4! +   7! +     9!)
      42  = s( 6 + 24 + 24 + 24 + 5040 + 362880)
      42  = s(367998)
      42  = 3 + 6 + 7 + 9 + 9 + 8
    

    There are no number n smaller than 344479 which gives sf(n)=42.