I need simple one-to-one function

Posted on 2004-04-11
Last Modified: 2010-04-17
Hi, I have a simple question in calculus:

Given a set of different integers A, each integer in range from 1 to 5000. It may be assumed that the set size won't be more than 50 (ie: |A|<=50).
I need a one-to-one function f that takes set A and returns an integer. (f: {..} --> R)
So for any A!=B => f(A)!=f(B) (!= stand for not equal). Of course, since A is a set, the order of integers doesn't matter, so A={1,2,3} identical to B={3,1,2}.

I'm sure there are a lot of simple functions that do the job, and functions with only primitive operators such as +,-,*,/ will be preffered.

Thanks in advance.

Question by:alex130
  • 5
  • 3
  • 2
  • +2
LVL 12

Accepted Solution

venkateshwarr earned 75 total points
ID: 10800221
Hi alex130,

You are talking about arrays.
if you define an array as

int f[100];


then this is a  one-to-one mapping.

LVL 27

Assisted Solution

Dabas earned 75 total points
ID: 10800226
Hi alex130:
The easiest way would be to multiply each integer by 2^i where i is the position of the integer inside the set.
^ = to the power of.
The elements of the set will have to be sorted first.

With your {1,2,3) example, the function would be:

2^0 * 1 + 2^1 * 2 + 2^2 * 3 = 1 * 1 + 2 * 2 + 4 * 3 = 17


Author Comment

ID: 10800320
Clarification for venkateshwarr:
There are a lot of different sets with specific size, for example if |A|=3 then there are more than 1.38^10 different sets. So I need a function which takes a set (which may be preseted as linked list of integers), checks list size and computes unique integer for the set according to numbers it contains. Then I store that computed integer, and if I get the same list again I can compare function output against already stored integers. So it saves time and space storage in time consuming applications.
Networking for the Cloud Era

Join Microsoft and Riverbed for a discussion and demonstration of enhancements to SteelConnect:
-One-click orchestration and cloud connectivity in Azure environments
-Tight integration of SD-WAN and WAN optimization capabilities
-Scalability and resiliency equal to a data center


Author Comment

ID: 10800329
Comment for Dabas:
Your function is indeed gives one-to-one mapping, but it's not applicable since the numbers it produces are way beyond huge :)
Consider a set of 30 consequent integers: starting from 4950 to 4979. Even last computation 2^30 * 4979 is a huge number, not talking about the whole sum of previous 29.
I'm sorry, I've made a mistake when I told the function output need to be integer. It may (even should)  be double.

Author Comment

ID: 10800334
Function output may (should) be double. :)

f: {..} --> R means that functino takes a set of integers and returns a real number.
LVL 27

Expert Comment

ID: 10800341
Huge number indeed.
But if you have 30 consequent integers, then the amount of possible distinct permutations is equally huge!

LVL 84

Assisted Solution

ozo earned 75 total points
ID: 10800449
There are 5000!/(50!(5000-50!)) possible sets A, that requires over 400 bits to uniquely identify.
Would you settle for a hash function that was not one-to-one, but only rarely returned identical numbers

Assisted Solution

rqs earned 75 total points
ID: 10809923
the cardinality of the power set implied here is even bigger,
-----          5000!
\         ----------------  =  2.30715956708335E+120       (the value is from a VB program I wrote)
/         K! (5000 - K)!
K = 1

But this value can still fit in a VB double precision variable which can hold up to 1.79769313486232e+308.
So it's possible to find a function that maps each possible set of integers to a unique number value that
can fit in a double variable type. That is if there exists such a mapping function.

A possible scheme would be to number each set starting from 1:
f({1}) = 1; f({2}) = 2; ....... f({5000}) = 5000;
f({1,2}) = 5001; f({1,3}) = 5002; ...... f({1,5000}) = 9999;
f({2,3}) = 10000; f({2,4}) = 10001; .....f({2,5000}) = 14998;
and so on.... there's a pattern with numbers so there might be a possibility to create a function
from this pattern (most likely a spliced one).


Author Comment

ID: 10816469
Thoughts: Mapping with hash function and giving each set a unique integer number is either inefficient, space wasting and would take years to compute. It will be better to map to real numbers, using mathematical formula, depending on the set length.
For example consider the following function, I'm not sure that it's one-to-one but it's defenitely a start :)

Suppose A={x1,x2,..,xn}
f(A)=(x1)^(0.n) + (x2)^(0.n) + ... + (xn)^(0.n)   (if |A|=5 then 0.n=0.5)
Of course 0.2=0.20 so lets asume that if number after decimal point is multiple
of ten, then it's converted to 0.nnn (so 0.30 will be 0.333). (When set size bound is 99 of course).
LVL 27

Expert Comment

ID: 10816614
My BA in Maths happened nearly 30 years ago... Can you please explain what the notation 0.n stands for?


Author Comment

ID: 10818025
to Dabas:
0.n stand for a double (Real) number.
for example if n=5 then it is simply 0.5 (1/2).
So if A={x1,x2,..,xn} then it has n elements (|A|=n) so i would raise each element in power of 0.n and sum results.
For example if A={2, 3004, 4443} then |A|=3 and
   f(A)=2^0.3 + 3004^0.3 + 4443^0.3=24.70499967
So far I haven't neither proven that this function is one-to-one nor found a contradictory exmple. But anyway, even if this function is one-to-one it is too slow because it involves raising in power operation which is a very complex one, especially when raising in non integer power.
If you can come up with another one-to-one function which uses only primitive operations (+-,/*) it would be great! :)
LVL 84

Expert Comment

ID: 10818451
if f(A) is truncated to a 64 bit float, it will not be one to one

Featured Post

Free Tool: Site Down Detector

Helpful to verify reports of your own downtime, or to double check a downed website you are trying to access.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Go is an acronym of golang, is a programming language developed Google in 2007. Go is a new language that is mostly in the C family, with significant input from Pascal/Modula/Oberon family. Hence Go arisen as low-level language with fast compilation…
If you’re thinking to yourself “That description sounds a lot like two people doing the work that one could accomplish,” you’re not alone.
An introduction to basic programming syntax in Java by creating a simple program. Viewers can follow the tutorial as they create their first class in Java. Definitions and explanations about each element are given to help prepare viewers for future …
In this seventh video of the Xpdf series, we discuss and demonstrate the PDFfonts utility, which lists all the fonts used in a PDF file. It does this via a command line interface, making it suitable for use in programs, scripts, batch files — any pl…

839 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question