iknowu99
Well-known Member
- Joined
- Dec 26, 2004
- Messages
- 1,158
The goal is to create index that would in any permutation create unique sums.
If these five numbers are used then any permutation of the sum will be decipherable
1
11
111
1,111
11,111
Example1: if sum was 123 it means the first three numbers were used.
example2: if sum was 11,222 then it means third (111) and fifth (11,111) numbers were used to create the sum.
example3: if sum was 11,223 then first, third and fifth numbers were used.
This system will work and it does not matter how many indexed numbers (here five). The issue is that the numbers increase too fast. What is better index of the smaller distance between indexing?
If these five numbers are used then any permutation of the sum will be decipherable
1
11
111
1,111
11,111
Example1: if sum was 123 it means the first three numbers were used.
example2: if sum was 11,222 then it means third (111) and fifth (11,111) numbers were used to create the sum.
example3: if sum was 11,223 then first, third and fifth numbers were used.
This system will work and it does not matter how many indexed numbers (here five). The issue is that the numbers increase too fast. What is better index of the smaller distance between indexing?