Mathematics desk | ||
---|---|---|
< May 9 | << Apr | May | Jun >> | May 11 > |
Welcome to the Wikipedia Mathematics Reference Desk Archives |
---|
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
I am doing a presentation and I want to really dumb down a part of it. To do so, I need a function f(x,y) such that if you feed it a value for x and y, you get a value z. It is a one-to-one function. between y and z. If you keep x the same and change y, you will never get z for two different values of y. Now, the hard part. If I use f(x,z), I get y. It should be obvious that this is a symmetrical key encryption function. Using the key x for y, I get z. Using the key x for z, I get y. I would like something that remains in the realm of integers so the audience can perform the function on a number, like 123, and get a number, like 42. Then, they can perform the function on 42 and get 123. Finally, they can change the key and see that 123 gives 4018 and 42 gives 3317. The problem is that the only formulas that I can find that meet this criteria are far too complicated for an audience to do in a few seconds or are string functions (swapping the positions of the digits). 209.149.113.5 ( talk) 13:38, 10 May 2017 (UTC)
Given n (and its factorization) is there a direct way to find the numbers, x, such that phi(x)=n? Bubba73 You talkin' to me? 16:24, 10 May 2017 (UTC)
Mathematics desk | ||
---|---|---|
< May 9 | << Apr | May | Jun >> | May 11 > |
Welcome to the Wikipedia Mathematics Reference Desk Archives |
---|
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
I am doing a presentation and I want to really dumb down a part of it. To do so, I need a function f(x,y) such that if you feed it a value for x and y, you get a value z. It is a one-to-one function. between y and z. If you keep x the same and change y, you will never get z for two different values of y. Now, the hard part. If I use f(x,z), I get y. It should be obvious that this is a symmetrical key encryption function. Using the key x for y, I get z. Using the key x for z, I get y. I would like something that remains in the realm of integers so the audience can perform the function on a number, like 123, and get a number, like 42. Then, they can perform the function on 42 and get 123. Finally, they can change the key and see that 123 gives 4018 and 42 gives 3317. The problem is that the only formulas that I can find that meet this criteria are far too complicated for an audience to do in a few seconds or are string functions (swapping the positions of the digits). 209.149.113.5 ( talk) 13:38, 10 May 2017 (UTC)
Given n (and its factorization) is there a direct way to find the numbers, x, such that phi(x)=n? Bubba73 You talkin' to me? 16:24, 10 May 2017 (UTC)