Problem: primepolydivisible numbers

Code: primepolydivisible+numbers/tails_1759600402

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)


DepthLitDescTypeArgLet
0implicit map[[chr]]
* 1+ add[int]
** 22 integerint
** 2, range from 1[int]
*** 310 integerint
* 1: append[chr]B:int A:int
** 2* join[chr]
*** 3; save[chr]C:[chr]
**** 4"\n" string[chr]
*** 3+ concat[int]
**** 4=\ scanl[[int]]
***** 5| filter[int]
****** 6, range from 1[int]
******* 7;$ = fstIntint
****** 6== equal?intD:int
******* 72 integerint
******* 7% modulusintE:int
******** 8^ powint
********* 92 integerint
********* 9@ = Dint
******** 8@ = Dint
***** 5>> tail[int]G:int F:int
****** 6`% step[int]
******* 7~ auto = 2auto
******* 7; save[int]H:[int]
******** 8`, range from 0[int]
********* 9;$ = Bint
***** 5| filter[int]J:int I:[int]
****** 6+ concat[int]
******* 7. map[[int]]
******** 8@ = I[int]
******** 8+ add[int]K:int
********* 9* multiplyint
********** 10;_ = Bint
********** 10$ = Kint
********* 9;$ = H[int]
****** 6~ notnull
****** 6% modulusintL:int
******* 7implicit arg = Lint
******* 7implicit arg = Jint
** 2implicit arg = C[chr]

Back to the index