* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
627 B
627 B
id, title, challengeType, forumTopicId, dashedName
id | title | challengeType | forumTopicId | dashedName |
---|---|---|---|---|
5900f52c1000cf542c51003d | Problem 446: Retractions B | 5 | 302118 | problem-446-retractions-b |
--description--
For every integer n>1, the family of functions fn,a,b is defined
by fn,a,b(x)≡ax+b mod n for a,b,x integer and 0
F(N)=∑R(n4+4) for 1≤n≤N. F(1024)=77532377300600.
Find F(107) (mod 1 000 000 007)
--hints--
euler446()
should return 907803852.
assert.strictEqual(euler446(), 907803852);
--seed--
--seed-contents--
function euler446() {
return true;
}
euler446();
--solutions--
// solution required