Cryptography is the study of cryptosystems, which are systems for encrypting data. Encrypting means taking data and changing it such that any unwanted person should not be able to read the data, but not changing it so much that the data is irretrievable. Specifically, the data should be able to be decrypted, which means changing the data back to its original, readable form. The data can be anything–passwords for your e-mail account or important personal information banks keep on their customers. The cryptosystems, that is the methods for encrypting, often strongly depends on the tools and theory of number theory.
In particular, when data is a message, the original message is often referred to as “plain text” while the encrypted text is referred to as the “cipher text”. There are many cryptosystems when working with messages. Among these are “classical cryptosystems”, which are systems no longer really used in modern times, but are still of interest, are instructive, and still have their uses.
One such classical system is the shift cipher. Before getting into that, there is some required knowledge of number theory, particular basic modular arithmetic. The following articles provide this:
After, the following article will give an introduction to the shift cipher:
See below for answers.
- Encrypt “exit” using the shift cipher , where the alphabet is number 0 through 25
- Decrypt “xvii” using the attack method of trying the reverse shift cipher for each integer in the range 0 through 25 until the original message comes out
Answers: (1) jcny, (2) tree.
When sketching rational functions where and are polynomials) in MCV4U, there are many steps in the process when all is said and done. One of these steps is determining whether there are any asymptotes. There are a few different kinds:
- Vertical asymptotes (VA): The vertical line such that but
- Horizontal asymptotes (HA): The horizontal line such that either or
- Oblique asymptotes (OA): When the degree of is plus the degree of , the OA is the slanted line which is the quotient after dividing into via polynomial division
Once when I was teaching these concepts in a MCV4U class, the following very interesting question was asked: “Can a function have multiple asymptotes?” It turns out that the answer is pretty interesting and enlightening, and it is considered in this post.
For VAs the answer is a fairly straightforward “yes.” For example, simply add factors to the denominator and keep a constant numerator:
This function has VAs , , and . But, for HAs and OAs the answer is no longer so clear. Consider the following graph:
This function, as a fact, has two HAs: . Similarly, if one were to rotate the graph above while fixing the axis, a graph of a function would be created with two OAs.
With all this said, therefore it should be true that functions can have two HAs or OAs… right? In fact, despite this, it is not true for rational functions. That is, there are indeed functions that can satisfy this, but given any rational function in the world, there is not way it can have more than one HA or OA. Essentially, the reason for this is that the process in obtaining the asymptotes results in there only being one answer, so it is impossible for there to be anything more than that. Algebraically, the answer goes a bit beyond the curriculum, but not too far. These algebraic proofs is what follows.
Rational functions have at most one HA
where . Of course, we will assume that there actually is a HA. For this to occur, it must be that . This is because otherwise , so that when we do the usual process for finding HAs of
and take , we get everything in the denominator going to , contradicting there being a HA:
So, indeed, we must have that . Consequently, the process of finding a HA instead leads us to dividing by and obtaining
If , then the limit is (computed like above). Otherwise, so that the limit is . This means that the HA is either or , depending on and . However, the answer for the HA does not depend on whether the limit is or . Consequently, the HA is either one of these, but not both. This completes the proof
Rational functions have at most one OA
Let . Since there can only be an OA if the degree of is more than that of , let the degree of be and that of be . Euclidean division of polynomials, a theorem of dividing polynomials, then says that for dividing by , there are unique polynomials (the quotient) and (the remainder) such that
where the degree of is less than the degree of , which is . (Unique here means that given and , the only quotient and remainder you can get by dividing by is and –nothing else.) By dividing the equation by we get the alternate expression
According to the procedure for finding an OA, the OA should therefore be . However, we need to know that is linear, i.e. it has degree . But, since has degree , has degree , and has degree less than , then according to the equation
it must be that has in fact degree . So, indeed is the OA. Moreover, it is the only answer because it is unique–that is, there cannot be any other OAs. This completes the proof.
Seki Takakazu was a Japanese mathematician during the Edo period, which ran from 1603 to 1868 and “was characterized by economic growth, arts and culture, and isolationism” [1, 2]. Takakazu actually was around the time of both Leibniz and Newton, but their work was independent .Among many things in Takakazu’s mathematical career, he was known for work in Elimination theory: Algorithmic approaches to getting rid of variables between polynomials of several variables [1, 3]. In regards to the Ontario secondary mathematics curriculum, there are some relevant applications of Takakazu’s work to single variable polynomials.
One particular instance is Takakazu’s work on what is known as resultants . Recall (MHF4U, C3.1.1) that a polynomial of degree , a nonnegative integer, is an expression of the form
where for is a real number. In particular the above is a polynomial written as a function. For we have a linear function and for we have a quadratic function . Interestingly, the work of resultants requires two polynomials. So let’s introduce another polynomial of degree :
again for real numbers . In MHF4U a lot of work is done with polynomials of degree , including graphing and factoring in many different ways. As an extension to this, consider the following question:
“With two polynomials and , how do we know if they share a common factor?”
Recall (MHF4U, C3) that this question is asking if there is for some real number such that is a factor of and . There are a few ways to accomplish this using the tools from MHF4U:
- Completely factor both polynomials and see if any one factor appears in both
- Completely factor only one of the polynomials and use methods to see if these factors are also factors of the other (e.g. polynomial division, substitution)
However both of these methods require work that seems more complicated than what the question is asking. The area of resultants that Takakazu worked on in fact addresses this. Using a formula, the “resultant of and ” is a real number that can be calculated very fast by computers. Continuing, it turns out that the number is zero if and only if and have a common factor. That is, the answer to the question is:
“Yes, if and only if the resultant of and is .”
But how do we compute this? The command
resultant[, , ]
when given to WolframAlpha does exactly this. Let’s do an example. Suppose
Dealing with a degree polynomial makes it not so easy to answer the question about a common factor. But in telling WolframAlpha the command
the answer given back is . Recall that this means that there is indeed a common factor. This is a nice example of using technology in mathematics. Unfortunately, this method does not also tell us what the common factor actualy is, just that one exists.
If you are curious about what WolframAlpha is doing when it makes this computation, then read a little further on. Note though that even though it is related to the vectors content of MCV4U, it requires content typically first covered in a first-year undergraduate course on an area of math called linear algebra.
By definition, the resultant of arbitrary polynomials and is the determinant of their Sylvester matrix . This matrix is a matrix (where and are the degrees of and resp.) where:
- The first row of the matrix is the coefficients of in decreasing order of subscripts, with entries on the right for any remaining entries
- The second row is the first row but shifted to the right by one entry, so the first entry is now a and there is one less entry on the right
- This rule continues for the following rows until there are no more zeros on the right
- The remaining rows are the same but done with instead
. For an example, using the and from the earlier example, the Sylvester matrix is
The resultant of these particular and is then the determinant of this matrix. This can also be computed using WolframAlpha with the command
The Sylvester matrix is named after James Joseph Sylvester, an English mathematician in the 1800s .