---
title: Amicable pairs
id: 5949b579404977fbaefcd737
challengeType: 5
videoUrl: ''
localeTitle: 友好的对
---
## Description
如果$ N \ neq M $和N $ $的适当除数之和（$ \ mathrm {sum}（\ mathrm {propDivs}（N）），两个整数$ N $和$ M $被认为是友好对 $）$ = M $以及$ \ mathrm {sum}（\ mathrm {propDivs}（M））= N $。示例：1184和1210是友好对，具有适当的除数：1,2,4,8,16,32,37,74,148,296,592和1,2,5,10,11,25,55，分别为110,121,242,605。任务：计算并显示低于20,000的Amicable对（有八个）。相关任务适当的除数 丰富，缺陷和完善的数字分类 等分序列分类及其友好分类。
## Instructions
## Tests
```yml
tests:
- text: amicablePairsUpTo是一个函数。
testString: 'assert(typeof amicablePairsUpTo === "function", "amicablePairsUpTo is a function.");'
- text: '[[220,284]] amicablePairsUpTo(300)应返回[[220,284]] 。'
testString: 'assert.deepEqual(amicablePairsUpTo(300), answer300, "amicablePairsUpTo(300) should return [[220,284]].");'
- text: '[[220,284],[1184,1210],[2620,2924]] amicablePairsUpTo(3000)应返回[[220,284],[1184,1210],[2620,2924]] 。'
testString: 'assert.deepEqual(amicablePairsUpTo(3000), answer3000, "amicablePairsUpTo(3000) should return [[220,284],[1184,1210],[2620,2924]].");'
- text: '[[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]] 。'
testString: 'assert.deepEqual(amicablePairsUpTo(20000), answer20000, "amicablePairsUpTo(20000) should return [[220,284],[1184,1210],[2620,2924],[5020,5564],[6232,6368],[10744,10856],[12285,14595],[17296,18416]].");'
```
## Challenge Seed
```js
function amicablePairsUpTo (maxNum) {
// Good luck!
return true;
}
```
### After Test
```js
console.info('after the test');
```
## Solution
```js
// solution required
```