Scribd
Upload
50 views

MCR3U Tuesday May 25th, 2010 Introduction To Inverse of A Function

The document discusses inverse functions through the example of encryption and decryption processes. It shows that encrypting a string and then decrypting it returns the original string. It represents the encryption and decryption mathematically as functions f(x) = x + 3 for encryption and f^-1(x) = x - 3 for decryption. The document also presents a number trick that algebraically transforms an initial number back to itself and instructs the reader to create their own similar trick and describe it using algebraic functions.

Uploaded by

api-25935812
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
50 views

MCR3U Tuesday May 25th, 2010 Introduction To Inverse of A Function

The document discusses inverse functions through the example of encryption and decryption processes. It shows that encrypting a string and then decrypting it returns the original string. It represents the encryption and decryption mathematically as functions f(x) = x + 3 for encryption and f^-1(x) = x - 3 for decryption. The document also presents a number trick that algebraically transforms an initial number back to itself and instructs the reader to create their own similar trick and describe it using algebraic functions.

Uploaded by

api-25935812
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

MCR3U ­ Tuesday May 25th, 2010

Introduction to Inverse of a Function

ABCDEFGHIJKLMNOPQRSTUVWXYZ
KEY => DEFGHIJKLMNOPQRSTUVWXYZABC

Encrypt ("Jessica") =  "MHVVLFD"
Decrypt("MHVVLFD") = "Jessica"
Decrypt[Encrypt("Jessica")] = "Jessica"

We would consider the Encrypt and Decrypt processes as 
inverses of each other.

Note:  for the remainder of this example, we are going to 
consider strings that only consist of the letters A through W so 
that we don't have to worry about wrapping around the letters 
XYZ to the letters ABC.

If we use numbers to represent the letters in the initial string, we 
could represent the encryption and decryption processes in the 
following way:

Encrypt (Input) = Input + 3
Decrypt(Input) = Input ­ 3

or using function notation ...

f (x) = x + 3  {Encrypt}
g (x) = x ­ 3 {Decrypt}

Instead of introducing another letter g, we can use notation that 
connects the two functions since one is the inverse of the other:

f ­1(x) = x ­ 3 {Decrypt}

Notice that instead of Decrypt(Encrypt("Jessica")) = "Jessica", 
we can now write:

f­1( f ("Jessica")) = "Jessica"

1
Consider the following number trick:

1. Pick any number
2. Add 2 to this number
3. Double the previous result.
4. Add 2 to the previous result.
5. Take half of the previous result.
6. Subtract three from the previous result.

You should arrive at your initial number in step 1.  
Why did this work?

1. Pick any number  =>  x
2. Add 2 to this number  => x + 2
3. Double the previous result.  =>  2(x + 2) = 2x + 4
4. Add 2 to the previous result. => 2x + 6
5. Take half of the previous result. => [2x + 6]/2 = x + 3
6. Subtract three from the previous result. => x

This would not be a very good encryption process as it would 
encrypt a character back onto itself.

Try creating your own number trick similar 
to above.  Once you have it created, try to 
describe the process algebraically.  Test 
your algebraic model to make sure that it 
gives you the same result as before.  
Finally, try to create a decryption function 
algebraically and check to make sure that 
it works properly.

2
Try creating your own number trick similar 
to above.  Once you have it created, try to 
describe the process algebraically.  Test 
your algebraic model to make sure that it 
gives you the same result as before.

3
4

You might also like