chore(i8n,learn): processed translations
This commit is contained in:
committed by
Mrugesh Mohapatra
parent
15047f2d90
commit
e5c44a3ae5
@ -1,22 +1,24 @@
|
||||
---
|
||||
id: 5900f52c1000cf542c51003d
|
||||
title: 问题446:撤回B.
|
||||
title: 'Problem 446: Retractions B'
|
||||
challengeType: 5
|
||||
videoUrl: ''
|
||||
forumTopicId: 302118
|
||||
dashedName: problem-446-retractions-b
|
||||
---
|
||||
|
||||
# --description--
|
||||
|
||||
对于每个整数n> 1,函数族fn,a,b由fn,a,b(x)≡ax+ b mod n定义为a,b,x整数和0
|
||||
For every integer n>1, the family of functions fn,a,b is defined
|
||||
|
||||
对于1≤n≤N,F(N)=ΣR(n4 + 4)。 F(1024)= 77532377300600。
|
||||
by fn,a,b(x)≡ax+b mod n for a,b,x integer and 0
|
||||
|
||||
求F(107)(mod 1 000 000 007)
|
||||
F(N)=∑R(n4+4) for 1≤n≤N. F(1024)=77532377300600.
|
||||
|
||||
Find F(107) (mod 1 000 000 007)
|
||||
|
||||
# --hints--
|
||||
|
||||
`euler446()`应该返回907803852。
|
||||
`euler446()` should return 907803852.
|
||||
|
||||
```js
|
||||
assert.strictEqual(euler446(), 907803852);
|
||||
|
Reference in New Issue
Block a user