gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
camperbot
2022-02-04 00:46:32 +05:30
committed by GitHub
parent 0d36c35207
commit f38d19132d
32 changed files with 374 additions and 354 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
curriculum/challenges/italian/10-coding-interview-prep/rosetta-code/amicable-pairs.md
View File

@ -1,6 +1,6 @@
---
id: 5949b579404977fbaefcd737
title: Amicable pairs
title: Coppie amicabili
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$.
Due numeri interi $N$ e $M$ sono detti [Numeri amicabili](https://it.wikipedia.org/wiki/Numeri_amicabili) se $N \\neq M$ e la somma dei [divisori propri](https://rosettacode.org/wiki/Proper divisors "Proper divisors") di $N$ ($\\mathrm{sum}(\\mathrm{propDivs}(N))$) $= M$ e $\\mathrm{sum}(\\mathrm{propDivs}(M)) = N$.
**Example:**
**Esempio:**
**1184** and **1210** are an amicable pair, with proper divisors:
**1184** e **1210** sono una coppia amicabile, con i seguenti divisori propri:
<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, 148, 296, 592 e</li>
<li>1, 2, 5, 10, 11, 22, 55, 110, 121, 242, 605 rispettivamente.</li>
</ul>
# --instructions--
Calculate and show here the Amicable pairs below 20,000 (there are eight).
Calcola e mostra qui le coppie amicabili sotto 20 000 (ce ne sono otto).
# --hints--
`amicablePairsUpTo` should be a function.
`amicablePairsUpTo` dovrebbe essere una funzione.
```js
assert(typeof amicablePairsUpTo === 'function');
```
`amicablePairsUpTo(300)` should return `[[220,284]]`.
`amicablePairsUpTo(300)` dovrebbe restituire `[[220,284]]`.
```js
assert.deepEqual(amicablePairsUpTo(300), answer300);
```
`amicablePairsUpTo(3000)` should return `[[220,284],[1184,1210],[2620,2924]]`.
`amicablePairsUpTo(3000)` dovrebbe restituire `[[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)` dovrebbe restituire `[[220,284],[1184,1210],[2620,2924],[5020,5564],[6232,6368],[10744,10856],[12285,14595],[17296,18416]]`.
```js
assert.deepEqual(amicablePairsUpTo(20000), answer20000);