We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #254: Sums of Digit Factorials
  4. Discussions

Project Euler #254: Sums of Digit Factorials

  • robin_vezina
     + 1 comment
    sf(266)=s(2!+6!+6!)=s(2+720+720) =s(1442)=1+4+4+2=11
sf(267)=s(2!+6!+7!)=s(2+720+5040)=s(5762)=5+7+6+2=20

    Since 267 is the lowest possible n in sf(n) to obtain 20, g(20) is 267.