Mysterious number 6174
plus.maths.org
plus.maths.org
If at least you had a result like "in any base, the analogue of Kaprekar's operation in that base has a fixed point for digits of length 3 or 4 only", it would be mildly interesting. But as it is it's not math, just senseless symbol manipulation.
But yes, the fact that this is bound to a decimal system suggests that there are no deep wisdoms here.
That said, I'd agree that decimal is not a particularly interesting part of math. For reals, continued fractions are probably the most interesting representation, and have nicer mathematical properties, at that.
My mastery of fixed-point mathematics is rusty, so I am unsure if that is identical to the above...
(At work, so can't say definitely yes/no without studying).
This is significantly stronger than just being a fixed point. As an analogy, when modeling population dynamics, one often finds both stable and non-stable equilibrium solutions. The stable ones are the only solutions that can occur in nature, and so their stability is an important thing to note. This stability often (I hesitate to say always) is the result of the solution having the same attractive nature as 6174 does.
It might be interesting to plot the mapping instead.
edit: one has already been made: http://news.ycombinator.com/item?id=2626879
I suspect the handling of 3-digit values. I also slipped there at first ;-)
But I'm inclined to consider that a bug in the definition, rather than in the code. :-} The four-digit-ness came from applying the operation to four-digit numbers, and saying "oh yeah and we'll zero-extend the results to four digits" introduces an ugly element of redundancy.
However, we can make it not ugly anymore by making "zero-extend everything to make it be 4 digits" the primary condition. Instead of applying it to 4-digit numbers, we'll make every number have 4 digits and then apply the Kaprekar procedure. So we'll now be working with the numbers 0000-9999, rather than 1000-9999. (There's no way to zero-extend numbers bigger than 9999 to be 4 digits, so that's all.) Here are the results for 0000-9999:
I think the frequencies of the number of steps to equilibrium are somewhat nicer, as well, when you count 0000-0999. As a simple metric, they have more factors of small primes, especially 2.
1000-9999:
0 steps: 1 = 1
1 steps: 365 = 5 * 73
2 steps: 519 = 3 * 173
3 steps: 2124 = 2^2 * 3^2 * 59
4 steps: 1124 = 2^2 * 281
5 steps: 1379 = 7 * 197
6 steps: 1508 = 2^2 * 13 * 29
7 steps: 1980 = 2^2 * 3^2 * 5 * 11
0000-9999:
0 steps: 2 = 2
1 steps: 392 = 2^3 * 7^2
2 steps: 576 = 2^6 * 3^2
3 steps: 2400 = 2^5 * 3 * 5^2
4 steps: 1272 = 2^3 * 3 * 53
5 steps: 1518 = 2 * 3 * 11 * 23
6 steps: 1656 = 2^3 * 3^2 * 23
7 steps: 2184 = 2^3 * 3 * 7 * 13And two: http://i.imgur.com/OaynE.png
I made a quick experiment with other bases.
3-digits numbers, base 8 has fixed point 374_8=252_10. 252 `mod` 7 = 0.
base-9, base-11 and base 13 seem do not have fixed points.
base-12, 3 digits has (at least one) fixed point 5b6_12 = 858_10. 858 `mod` 11 = 0.
I think, it exploits some properties of positional notation of numbers so that fixed points all divisible by (base-1).
Kaprekar's operation always results in a multiple of 9.
Given a > b > c > d. Kaprekar's operation gives:
1000a + 100b + 10c + d - (1000d + 100c + 10b + a)
=999(a - d) + 90(b - c)
=9(111(a - d) + 10(b - c))
And so on for integers with other numbers of digits. Sum(i=0..n, a[i]*10^i)
123, for example is 3 + 2 * 10 + 1 * 100.A power of 10 (10^n) can be re written as
(1 + 9 * Sum(i=0..n-1, 10^i).
For example: 1000 = 1 + 999 = 1 + 900 + 90 + 9When you subtract two numbers with the same digits, you end up being able to factor a nine out of these sums fairly easily.
I wrote a proof of the number - reverse(number) a while back. It can be found on archive.org
http://web.archive.org/web/20050314023901/http://jimfl.tense...
http://mathworld.wolfram.com/KaprekarRoutine.html
http://en.wikipedia.org/wiki/6174_(number)
The Wolfram link contains a list of Kaprekar numbers and Kaprekar sequences in common bases.
Whoa, you need 50 statements in VB for that? I need 14 in Python:
import collections
def kaprekar(k):
nr = 0
while True:
if k == 6174: return nr
small = int("".join(sorted(list("%04d" % k))))
large = int("".join(sorted(list("%04d" % k), reverse=True)))
k = large - small
nr += 1
freqs = collections.defaultdict(int)
for i in range(1000, 10000):
if not i % 1111: continue # skip 1111, 2222, etc...
freqs[kaprekar(i)] += 1
for k,v in freqs.items():
print k, v
Outputs: 0 1
1 356
2 519
3 2124
4 1124
5 1379
6 1508
7 1980We measure something by comparing its frontiers (where it begins and ends) to something else. If this something has none, this clearly cannot be done.
Of course, it's also clear that between 0 and 1 you have infinite real numbers. But is an infinite inside an infinite enough to provide a size hierarchy?
Maybe the quantum physics guys will prove that the universe is granular in every possible level and that everything is just an enormous pile of huge natural numbers. Then infinity and paradoxes will just be a fun thought experiment, and reality will still be pragmatically ungraspable, but profoundly boring.
What you do to compare sizes of sets A and B is, construct a 1:1 function mapping everything in A to something in B and vice versa.
If such a function exists, they're the same cardinality.
It's a little long-winded, but see:
http://en.wikipedia.org/wiki/Cardinal_number
This idea, which seems obvious only in retrospect, is due to Georg Cantor (the guy with the set, and the paradox).
There is a famous proof about this by Georg Cantor: http://en.wikipedia.org/wiki/Cantors_diagonal_argument
I really love this quote from Wittgenstein:
"Where the nonsense starts is with our habit of thinking of a large number as closer to infinity than a small one".
http://en.wikipedia.org/wiki/Controversy_over_Cantor%27s_the...
That's treating infinite as if it's a limit, when it's not.
If it's uncountable and unmeasurable, than it's non hierarchical.
That's not the assumption, that's the result.
That Naturals are infinite but countable and Reals infinite and uncountable.
http://primes.utm.edu/notes/proofs/infinite/euclids.html
http://mathworld.wolfram.com/EuclidsTheorems.html
For smaller numbers, Wikipedia is pretty good too.
"8833 = 88^2 + 33^2"
Hey, that's cheating!
(Yes, I went through over eight thousand numbers to find that one.)More seriously, numbers, and number theory, can be quite interesting and often leads to computational insight in algorithm computation or numerical solving. But ultimately, unless you're a numbers geek, it [ edit: Kaprekar numbers [1] ] doesn't [ don't ] really teach anything.
[1]Sheesh, this place has lost its sense of humor.
... what? That has nothing to do with number theory.
> More seriously, numbers, and number theory, can be quite interesting and often leads to computational insight in algorithm computation or numerical solving. But ultimately, unless you're a numbers geek, it doesn't really teach anything.
There are a number [1] [2] [3] [4] of practical uses of number theory that do teach something. I've only listed the simplest uses with respect to cryptography, because those are the ones with which I am familiar, but I assure you, number theory is one of the more applied branches of mathematics.
Granted, some number theory has very few applications. But you won't ever find something practical if you're always asking "Is this practical? I better not look further if it isn't."
[1] http://en.wikipedia.org/wiki/RSA
[2] http://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exch...
[3] http://en.wikipedia.org/wiki/Digital_Signature_Algorithm
[4] http://en.wikipedia.org/wiki/Elliptic_curve_cryptography
Your algorithm is to start with a random number (the key) and and feed it to your function, producing another number. Which you feed to your function, producing a third number. And so you go, generating a stream of numbers for your cipher.
After reading how Kaprekar's operation leads to a fixed point for four digit numbers and various cycles for other numbers, you might be nudged into investigating to see if there are inputs for your function that lead to cycles and fixed points. Which would pretty-much break your cipher entirely.
Is this interesting? Yes. Is there computational insight? There is for me. Does it teach anything? I dunno, how is teaching something distinguished from providing insight?
I have always found the 'meme' "Its all fun and games until someone <dubious and improbable action>" amusing. I was trying to come up with a dubious and improbable action which occurred from the mis-application of arithmetic operations on numbers.
What I have learned from this particular exchange is that people who are fans of number theory are sore about 'numerology' perhaps just like astronomers wince at people who conflate astronomy with astrology. Must be watching too much Big Bang Theory lately.
Actually, I thought you were serious, especially given that you went on to criticize number theory as being impractical. I recommend an application of the ;) next time.
Thus, a comment which adds no value will be downvoted; a comment which is funny but has significant worth besides its humor will be upvoted.