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)
(implicit map):[[chr]]
+ (add):[int]
2 (integer):int
, (range from 1):[int]
10 (integer):int
: (append):[chr] <--arg( B:int A:int )
* (join):[chr]
; (save):[chr] -->let( C:[chr] )
"\n" (string):[chr]
+ (concat):[int]
=\ (scanl):[[int]]
| (filter):[int]
, (range from 1):[int]
;$ (= fstInt):int
== (equal?):int <--arg( D:int )
2 (integer):int
% (modulus):int <--arg( E:int )
^ (pow):int
2 (integer):int
@ (= D):int
@ (= D):int
>> (tail):[int] <--arg( G:int F:int )
`% (step):[int]
~ (auto = 2):auto
; (save):[int] -->let( H:[int] )
`, (range from 0):[int]
;$ (= B):int
| (filter):[int] <--arg( J:int I:[int] )
+ (concat):[int]
. (map):[[int]]
@ (= I):[int]
+ (add):[int] <--arg( K:int )
* (multiply):int
;_ (= B):int
$ (= K):int
;$ (= H):[int]
~ (not):null
% (modulus):int <--arg( L:int )
(implicit arg = L):int
(implicit arg = J):int
(implicit arg = C):[chr]