--- id: 5900f5131000cf542c510024 challengeType: 5 title: 'Problem 421: Prime factors of n15+1' videoUrl: '' localeTitle: '' --- ## Description undefined ## Instructions undefined ## Tests
```yml tests: - text: '' testString: 'assert.strictEqual(euler421(), 2304215802083466200, "euler421() should return 2304215802083466200.");' ```
## Challenge Seed
```js function euler421() { // Good luck! return true; } euler421(); ```
## Solution
```js // solution required ```