Problem: Prime Numbers
Code: Prime+Numbers/darrenks+%28dingledooper%29_1640236779
Nibbles version: 0.2 | 0.21 | 0.22 | 0.23 | 0.24 | 0.25 | 1.00
Format: Compact | Simple | +Type | Table | JSON | .nbl (DeBruijn) | .nbl (names)
| Depth | Lit | Desc | Type | Arg | Let |
|---|---|---|---|---|---|
| 0 | < | take | [int] | ||
| * 1 | $ | = fstInt | int | ||
| * 1 | | | filter | [int] | ||
| ** 2 | , | range from 1 | [int] | ||
| *** 3 | ~ | auto = infinity | auto | ||
| ** 2 | % | modulus | int | A:int | |
| *** 3 | ^ | pow | int | ||
| **** 4 | `* | product | int | ||
| ***** 5 | << | init | [int] | ||
| ****** 6 | , | range from 1 | [int] | ||
| ******* 7 | | implicit arg = A | int | ||
| **** 4 | | implicit arg = A | int | ||
| *** 3 | | implicit arg = A | int |