2018-09-30 22:01:58 +00:00
---
id: 5900f4381000cf542c50ff4a
title: 'Problem 203: Squarefree Binomial Coefficients'
2020-11-27 18:02:05 +00:00
challengeType: 5
2019-08-05 16:17:33 +00:00
forumTopicId: 301844
2021-01-13 02:31:00 +00:00
dashedName: problem-203-squarefree-binomial-coefficients
2018-09-30 22:01:58 +00:00
---
2020-11-27 18:02:05 +00:00
# --description--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
The binomial coefficients nCk can be arranged in triangular form, Pascal's triangle, like this:
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
111121133114641151010511615201561172135352171 .........
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
It can be seen that the first eight rows of Pascal's triangle contain twelve distinct numbers: 1, 2, 3, 4, 5, 6, 7, 10, 15, 20, 21 and 35.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
A positive integer n is called squarefree if no square of a prime divides n. Of the twelve distinct numbers in the first eight rows of Pascal's triangle, all except 4 and 20 are squarefree. The sum of the distinct squarefree numbers in the first eight rows is 105.
2018-09-30 22:01:58 +00:00
Find the sum of the distinct squarefree numbers in the first 51 rows of Pascal's triangle.
2020-11-27 18:02:05 +00:00
# --hints--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
`euler203()` should return 34029210557338.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
assert.strictEqual(euler203(), 34029210557338);
2018-09-30 22:01:58 +00:00
```
2020-11-27 18:02:05 +00:00
# --seed--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
## --seed-contents--
2018-09-30 22:01:58 +00:00
```js
function euler203() {
2020-09-15 16:57:40 +00:00
2018-09-30 22:01:58 +00:00
return true;
}
euler203();
```
2020-11-27 18:02:05 +00:00
# --solutions--
2018-09-30 22:01:58 +00:00
```js
// solution required
```