chore(i8n,learn): processed translations
This commit is contained in:
committed by
Mrugesh Mohapatra
parent
15047f2d90
commit
e5c44a3ae5
@ -0,0 +1,44 @@
|
||||
---
|
||||
id: 5900f52c1000cf542c51003d
|
||||
title: 'Problem 446: Retractions B'
|
||||
challengeType: 5
|
||||
forumTopicId: 302118
|
||||
dashedName: 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.
|
||||
|
||||
```js
|
||||
assert.strictEqual(euler446(), 907803852);
|
||||
```
|
||||
|
||||
# --seed--
|
||||
|
||||
## --seed-contents--
|
||||
|
||||
```js
|
||||
function euler446() {
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
euler446();
|
||||
```
|
||||
|
||||
# --solutions--
|
||||
|
||||
```js
|
||||
// solution required
|
||||
```
|
Reference in New Issue
Block a user