56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
---
|
||
id: 5900f3ec1000cf542c50fefe
|
||
challengeType: 5
|
||
title: 'Problem 127: abc-hits'
|
||
videoUrl: ''
|
||
localeTitle: 问题127：abc-hits
|
||
---
|
||
|
||
## Description
|
||
<section id="description"> n，rad（n）的基数是n的不同素因子的乘积。例如，504 = 23×32×7，因此rad（504）= 2×3×7 = 42.如果出现以下情况，我们将正整数（a，b，c）的三元组定义为abc-hit：GCD（ a，b）= GCD（a，c）= GCD（b，c）= 1 a <ba + b = c rad（abc）<c例如，（5,27,32）是abc-hit，因为：GCD（5,27）= GCD（5,32）= GCD（27,32）= 1 5 <27 5 + 27 = 32 rad（4320）= 30 <32事实证明abc-hits是非常罕见的c <1000只有31次abc命中，Σc= 12523。查找Σc表示c <120000。 </section>
|
||
|
||
## Instructions
|
||
<section id="instructions">
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler127()</code>应该返回18407904。
|
||
testString: 'assert.strictEqual(euler127(), 18407904, "<code>euler127()</code> should return 18407904.");'
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler127() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler127();
|
||
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
</section>
|