Post History
Myby, 12 5 bytes primf=primfd primf : prime factors = : equals primfd : unique prime factors Evaluated as a monadic fork in J (f y) g (h y). The test cases (retest...
Answer
#2: Post edited
by
south
·
2022-08-20T06:15:21Z (about 2 years ago)
# [Myby](https://github.com/ConorOBrien-Foxx/Myby), 12 bytes- ```
(0<<.)##%(#*#)O"2&R- ```
- ```
< : less than<. : minimum# : identity% : modulus* : multiplicationO : fork" : map2&R: bond 2 to dyadic range, 2..- ```
The evaluation order using a fancy schmancy tree, where `Ψ` represents a fork from J and `@` represents atop from APL, looks like```(0<<.)##%(#*#)O"2&R┌─ 0┌─ Ψ ─┼─ <│ └─ <.││ ┌─ #│ │ ┌─ #─ @ ─┤ │ ├─ %│ ├─ " ─── O ─┤ ┌─ #└─ Ψ ─┤ └─ Ψ ─┼─ *│ └─ #││ ┌─ 2└─ & ─┴─ R```The test cases can be viewed [here](https://files.catbox.moe/zoje97.txt) and were generated using [this ruby script](https://files.catbox.moe/jyuigf.rb).
- # [Myby](https://github.com/ConorOBrien-Foxx/Myby), ~~12~~ 5 bytes
- ```
- primf=primfd
- ```
- ```
- primf : prime factors
- = : equals
- primfd : unique prime factors
- ```
- Evaluated as a monadic fork in J `(f y) g (h y)`.
- The test cases (retested) can be viewed [here](https://files.catbox.moe/4t2r72.txt) and were generated using [this ruby script](https://files.catbox.moe/jyuigf.rb).
#1: Initial revision
by
south
·
2022-08-17T06:12:16Z (about 2 years ago)
# [Myby](https://github.com/ConorOBrien-Foxx/Myby), 12 bytes
```
(0<<.)##%(#*#)O"2&R
```
```
< : less than
<. : minimum
# : identity
% : modulus
* : multiplication
O : fork
" : map
2&R: bond 2 to dyadic range, 2..
```
The evaluation order using a fancy schmancy tree, where `Ψ` represents a fork from J and `@` represents atop from APL, looks like
```
(0<<.)##%(#*#)O"2&R
┌─ 0
┌─ Ψ ─┼─ <
│ └─ <.
│
│ ┌─ #
│ │ ┌─ #
─ @ ─┤ │ ├─ %
│ ├─ " ─── O ─┤ ┌─ #
└─ Ψ ─┤ └─ Ψ ─┼─ *
│ └─ #
│
│ ┌─ 2
└─ & ─┴─ R
```
The test cases can be viewed [here](https://files.catbox.moe/zoje97.txt) and were generated using [this ruby script](https://files.catbox.moe/jyuigf.rb).