Quote:
|
Originally Posted by CraigD
The difference between the representation of a number and the number itself is philosophically profound, especially for people like me (and more obscure folk like Kurt Godel and Doug Hofstadter  ...This particular rabbit hole is very deep, so by your leave, I’ll step back from it now.I don’t believe there’s a strong connection between my 2 posts. The table in post #89 seems to result is some fashion I’ve yet to fathom from the Prime Number Theorem, where #114 and this one have more to do with the systems for representing numbers.
I’m failing to follow the significance of the bolded numbers in your post. Can you explain, please?
|
___I call Godel's theorem "Kurt's Hammer".

You may recall I (Turtle) played a small role in Dougy's
Metamagical Themas opposite Hercules in a number of expository dialogues.

; we helped him build a ladder for getting back out of that rabbit hole that Mr. Dodgson helped us into. I love taking the little potion & going down deep, where it opens into this amazing cave of mathematics.
____On the bolded entries:
1: 3
2: 4 5 7 9 13 25
4: 6
11 16 17 21 31 41 49 61 81 121 241
6: 8
10 15 19 22 29 37 43 57 64 73 85 127 169 253 505
8: 33 97 161 481...
___Your list is predicated on Katabatak function transforms of powers, & shows in the left column how many different K patterns occur before they begin to repeat (your "modularity"). In line to the right of each of these, is the list of bases which generate that particular modularity. From the Katabatak patterns of powers base 10, we have modularity 6, but if you take that same list of base ten powers (the full base ten "numbers" we input into the K function) & put their last digits into an array, you end up with a 10 by 4 table which is congruent to your modularity 4 base eleven entry.
___My point then is that from any base numeration system & a given number n (numeral string) you derive from the last digit of n the value of n mod b & from the K(n) you derive the value of n mod (b-1). This means the join of these sets of values has a length of b*(b-1). For example, the K pattern of squares is length 9 & the end-digit pattern is length 10, so the pattern of their unique association does not begin a repeat until after the 90'th element.
___Hope this doesn't throw anyone unwilling into the rabbit hole.
