chore(i18n,learn): processed translations (#44866)

This commit is contained in:
camperbot
2022-01-22 20:38:20 +05:30
committed by GitHub
parent d039479e66
commit 43a2a0a395
324 changed files with 2907 additions and 2916 deletions

View File

@ -1,6 +1,6 @@
---
id: 5949b579404977fbaefcd737
title: Amicable pairs
title: 友愛数
challengeType: 5
forumTopicId: 302225
dashedName: amicable-pairs
@ -8,42 +8,42 @@ dashedName: amicable-pairs
# --description--
Two integers $N$ and $M$ are said to be [amicable pairs](https://en.wikipedia.org/wiki/Amicable numbers "wp: Amicable numbers") if $N \\neq M$ and the sum of the [proper divisors](https://rosettacode.org/wiki/Proper divisors "Proper divisors") of $N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ as well as $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$.
2つの整数、$N$と$M$は、 $N \\neq M$であり、[真の約数](https://rosettacode.org/wiki/Proper divisors "Proper divisors") の合計に関して、$N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ かつ $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$である場合に、[友愛数](https://en.wikipedia.org/wiki/Amicable numbers "wp: Amicable numbers")です。
**Example:**
**:**
**1184** and **1210** are an amicable pair, with proper divisors:
**1184** **1210** は、真の約数の和から友愛数だと分かります。
<ul>
<li>1, 2, 4, 8, 16, 32, 37, 74, 148, 296, 592 and</li>
<li>1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605 respectively.</li>
<li>1、2、4、8、16、32、37、74、148296592</li>
<li>1、2、5、10、11、22、55、110121242605</li>
</ul>
# --instructions--
Calculate and show here the Amicable pairs below 20,000 (there are eight).
計算して、20,000 以下の 友愛数を表示します (8 つあります)。
# --hints--
`amicablePairsUpTo` should be a function.
`amicablePairsUpTo` という関数です。
```js
assert(typeof amicablePairsUpTo === 'function');
```
`amicablePairsUpTo(300)` should return `[[220,284]]`.
`amicablePairsUpTo(300)` `[[220,284]]` を返します。
```js
assert.deepEqual(amicablePairsUpTo(300), answer300);
```
`amicablePairsUpTo(3000)` should return `[[220,284],[1184,1210],[2620,2924]]`.
`amicablePairsUpTo(3000)` `[[220,284],[1184,1210],[2620,2924]]` を返します。
```js
assert.deepEqual(amicablePairsUpTo(3000), answer3000);
```
`amicablePairsUpTo(20000)` should return `[[220,284],[1184,1210],[2620,2924],[5020,5564],[6232,6368],[10744,10856],[12285,14595],[17296,18416]]`.
`amicablePairsUpTo(20000)` `[[220,284],[1184,1210],[2620,2924],[5020,5564],[6232,6368],[10744,10856],[12285,14595],[17296,18416]]` を返します。
```js
assert.deepEqual(amicablePairsUpTo(20000), answer20000);