yaworsw/euler-manager

---
:id: 421
:name: Prime factors of <var>n</var><sup>15</sup>+1
:url: https://projecteuler.net/problem=421
:content: "Numbers of the form <var>n</var><sup>15</sup>+1 are composite for every
  integer <var>n</var> \\> 1.  \nFor positive integers <var>n</var> and <var>m</var>
  let <var>s</var>(<var>n,m</var>) be defined as the sum of the _distinct_ prime factors
  of <var>n</var><sup>15</sup>+1 not exceeding <var>m</var>.\n\nE.g. 2<sup>15</sup>+1
  = 3×3×11×331.  \nSo <var>s</var>(2,10) = 3 and <var>s</var>(2,1000) = 3+11+331 =
  345.  \n  \nAlso 10<sup>15</sup>+1 = 7×11×13×211×241×2161×9091.  \nSo <var>s</var>(10,100)
  = 31 and <var>s</var>(10,1000) = 483.  \n\nFind ∑ <var>s</var>(<var>n</var>,10<sup>8</sup>)
  for 1 ≤ <var>n</var> ≤ 10<sup>11</sup>.\n\n"