If Gödel sent you this message:
Would you be able to understand what he wrote to you in the English Alphabet ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Gödel's numbers are the result of a particular encoding algorithm performed on sequences of alphabet characters in order to get a number. This technique was created by Gödel while proving his Incompleteness Theorem .
So, the Foundamental Theorem of Arithmetics states that whatever natural number can be factorized in the product of prime numbers. So, just factorize M in order to get:
M = 2 8 ⋅ 3 5 ⋅ 5 1 2 ⋅ 7 1 2 ⋅ 1 1 1 5 ⋅ 1 3 2 3 ⋅ 1 7 1 5 ⋅ 1 9 1 8 ⋅ 2 3 1 2 ⋅ 2 9 4
And let's use exponents to get the character being used:
And there you go!