Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-420-2x2-positive-integer-matrix.english.md
Oliver Eyton-Williams bd68b70f3d Feat: hide blocks not challenges (#39504)
* fix: remove isHidden flag from frontmatter

* fix: add isUpcomingChange

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

* feat: hide blocks not challenges

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
2020-09-03 15:07:40 -07:00

70 lines
1.1 KiB
Markdown

---
id: 5900f5111000cf542c510023
challengeType: 5
title: 'Problem 420: 2x2 positive integer matrix'
forumTopicId: 302090
---
## Description
<section id='description'>
A positive integer matrix is a matrix whose elements are all positive integers.
Some positive integer matrices can be expressed as a square of a positive integer matrix in two different ways. Here is an example:
We define F(N) as the number of the 2x2 positive integer matrices which have a trace less than N and which can be expressed as a square of a positive integer matrix in two different ways.
We can verify that F(50) = 7 and F(1000) = 1019.
Find F(107).
</section>
## Instructions
<section id='instructions'>
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>euler420()</code> should return 145159332.
testString: assert.strictEqual(euler420(), 145159332);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function euler420() {
// Good luck!
return true;
}
euler420();
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
</section>