from Hacker News

Show HN: Primeval Numbers

by aravindet on 6/20/24, 1:46 PM with 11 comments

• by aravindet on 6/20/24, 1:51 PM

  The idea came out of an attempt to represent numbers without having to choose an arbitrary base, i.e. an alternative to the place value system.

  Just to be clear, this is an art project with no practical use that I can think of. It's hard to count using these numbers, but factoring them is trivial.

• by dullcrisp on 6/22/24, 3:34 AM

  What logic does it use for when to use a +1? One thing I noticed: if I give it 100,000 it gives me 2^5•5^5. But if I give it 100,001, instead of 2^5•5^5+1, it gives (2•5 + 1)•(2•3^2•5•(2^2•5^2 + 1) + 1), which seems sub-optimal.

• by aredox on 6/22/24, 8:54 AM

  Further down the prime numbers rabbit hole: you can do computation from prime numbers decomposition and fractions:

  https://wiki.xxiivv.com/site/fractran.html

• by auggierose on 6/22/24, 8:45 AM

  I don't get it. Is there a particular reason why prime number bases are further broken down via "+1"? And where do you stop with that? For example, "5" is not further broken down into 2^2+1.

  Edit: Oh, have not seen the drawings...

• by dbaupp on 6/22/24, 3:24 AM

  Interesting idea.

  It looks like powers of larger primes are currently rendered with the exponent ring overlapping the "main" rings, e.g. 7 and 49 look the identical, while 343 has an overlapping 2 and 3 knot.

• by netvarun on 6/21/24, 7:02 AM

  Very slick interface and implementation! This is why I love coming to HN!

• by ninthcat on 6/23/24, 7:34 PM

  7 and 49 look the same.