[seqfan] G-code

Eric Angelini Eric.Angelini at kntv.be
Sun Aug 2 20:51:07 CEST 2015


Hello SeqFans,
Let's code an integer more or less
like Gödel -- with prime powers.
We'll G-code 2015 like this:
2^2*3^0*5^1*7^5 which reads 4*1*5*16807
which is 336140.
Working backwards we'll decompose
336140 into primes and get:
336140=2*2*5*7*7*7*7*7 which is
2^2*3^0*5^1*7^5 and unambiguously
2015.
We'll have a problem with integers
that end with one or more zeroes.
We can solve that like this:
2010 --> 2^2*3^0*5^10 and _not_
2010 --> 2^2*3^0*5^1*7^0 of course.

Are there integers that are their own G-code?
Best,
É.
(sorry if this is old hat...)


More information about the SeqFan mailing list