Bird Man is a user on mathstodon.xyz. You can follow them or interact with them if you have an account anywhere in the fediverse.
If you don't, you can sign up here.
#haskell
Inspired by a #numberphile vid.
Made a program which takes a number, gets its prime factors, and turns every prime number into a digit of a new number.
For example, 15 -> 3 * 5 -> 35. Or 16 -> 2*2*2*2 -> 2222.
Apparently you're supposed to end up with a prime number after a finite number of iterations. I suspect Haskell might be giving up too early. Suggestions?
@christianp wow. N is huge!
@birdman "finite" can still be enormous. For example, nobody knows when or if 20 reaches a prime