- #1

- 986

- 9

^{20}- 1, 37

^{20}}. A simple bijective function f:P-->S could be constructed. Then I want to construct another bijective function g:S-->T for some set T. Any ideas?

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter Jamin2112
- Start date

- #1

- 986

- 9

- #2

chiro

Science Advisor

- 4,797

- 133

Hey Jamin2112.

What properties do you want your bijective function to have?

What properties do you want your bijective function to have?

- #3

- 986

- 9

Hey Jamin2112.

What properties do you want your bijective function to have?

Actually, it doesn't have to be bijective, now that I think about it. Could be merely injective.

Maybe take the binary representation of the numbers and have each of those digits correspond to parameters in a differential equation?

- #4

chiro

Science Advisor

- 4,797

- 133

- #5

- 986

- 9

Scratch that. I'm gonna need something simpler than a differential equation.

Let's assume the ints 1, 2, ..., 37

- #6

chiro

Science Advisor

- 4,797

- 133

log_2(37^20) = 20*log_2(37) = 30*ln(37)/ln(2) = 104.1891 which means if you have a uniform distribution with those values, you will need at least 105 bits to store them.

- #7

- 986

- 9

log_2(37^20) = 20*log_2(37) = 30*ln(37)/ln(2) = 104.1891 which means if you have a uniform distribution with those values, you will need at least 105 bits to store them.

Make 'em 16 x 16 matrices. We've got a 256-bit machine.

- #8

chiro

Science Advisor

- 4,797

- 133

So what do you want your function to be exactly (given this 16x16 matrix)?

- #9

- 986

- 9

So what do you want your function to be exactly (given this 16x16 matrix)?

g(M) = M

Lets assume that if the only possible M in the domain are those binary matrix representations of the numbers 1 through 37

Share: