4 ms·
Maybe I don't understand the full implications of the problem, but it seems obvious that a multiplicative table will result in more 'numerical diversity' than a
by CamperBob2 8y ago
Maybe I don't understand the full implications of the problem, but it seems obvious that a multiplicative table will result in more 'numerical diversity' than a summation table. Both multiplication and addition yield points on lines described by the usual mx+b equation. Addition constrains x to 1, so all of the results will be clustered near the origin, with more coincidences as an unavoidable result. Conversely, if x is allowed to exceed 1, the resulting 'lines' will spread out on the graph and leave more room for unique points.
What am I missing?
- clairity 8y agodunno, but it's neat to think about. multiplication can cover more ground in integer space than addition, so it can reach more unique places than addition for a given set of numbers. it's kinda like comparing how many squares knights and pawns can reach on a chessboard for a given number of moves.
- Dylan16807 8y agoIf you give well-spaced source numbers, they can reach the same number of spaces. For products it's easy: distinct prime numbers. For addition you can pick numbers so that each one is at least [previous number] x [number of moves] + 1. To keep it extra simple go with [number of moves + 1]^n. So this is very easy if the number of moves is known upfront, and impossible if it's not. And in the source puzzle the number of moves is always 2.
- KronenR 8y agoDid you read the article? The numbers doesn't have to be consecutive, for example what you said is only true for arithmetic progresions, but for geometric progressions it happens the opposite that multiplications has less diversity. Read the full article.
- Someone 8y ago”but it seems obvious that a multiplicative table will result in more 'numerical diversity' than a summation table” That isn’t true. If you pick the set of numbers {1, 2, 4, 8}, you get 10 different sums (2, 3, 4, 5, 6, 8, 9, 10, 12, and 16) but only 7 different products (1, 2, 4, 8, 16, 32, and 64)
- CamperBob2 8y agoSure, you can always find special-case exceptions, but I still don't see why the result is surprising in the general case. There are a lot more arithmetic progressions than geometric ones.
- empath75 8y agoThey’re both countably infinite.
- AnimalMuppet 8y ago> There are a lot more arithmetic progressions than geometric ones. I'm pretty sure that's not true. An arithmetic progression is x[n] = x[n-1] + k and a geometric progression is x[n] = x[n-1] * k
- CamperBob2 8y agoThat's a good point, I'll have to stand corrected on that. Just a matter of swapping one operation for another.
- alanbernstein 8y agoIf you consider all finite sequences of positive integers with all values below some limit M, it might be the case that there are more arithmetic sequences than geometric sequences. I don't think that's relevant to the article, but might be where your head was when you made that post.
- sn41 8y agoIn some deep sense, what you are saying is true : for example, if an infinite sequence of numbers is sufficiently dense, then it has arbitrarily long arithmetic progressions.[1] On the other hand, Rankin in 1990 constructed a set with positive density which does not have long geometric progressions. [1] https://en.wikipedia.org/wiki/Szemer%C3%A9di%27s_theorem https://en.wikipedia.org/wiki/Szemer%C3%A9di%27s_theorem
- 8y ago