Class Assignments


Applets & Internet Resources


TitleDescription
Rossman/Chance Applet CollectionThis collection mainly focuses on applets exploring statistics. Topics include various sampling distribution stimulations, probability, goodness of fit and ANOVA.
NCTM Illuminations The National Council of Teachers of Mathematics created this resource of applets for all grades. Topics include counting (K-2), modeling fractions, manipulating geometric solids, tessellations, etc.
Shoder InteractivesThis collection covers a wide range of topics from geometry and graphds to calculus. It even has some applets on discrete math!
Falstad Math and Physics This collection has a variety of math and physics topics, most of which are high-level like vector calculus and Fourier transformations. These applets display a lot of cool applications on mathematics, like quantum mechanics.
Beacon Learning Center This collection has a large number of more elementary school centered topics explaining topics such as geometry, addition and division, measurement. Some of these topics extend into middle school math, such as statistics and graphing functions.
TitleDescription
Factorize Applet This applet displays graphically how to factorize numbers 1 - 50, students are able to construct rectangles whose area equal the number and determine diffrent ways to factor that number.
Euclidian Algorithm Calculator This website shows the steps of the Euclidian Algorithm to calculate the greatest common divisor of any two numbers using modular arithmetic
Caesar Cipher II This applet displays how arithmetic is used in cryptography to create cyphers.
Clock (Modular) Arithmetic A fun applet that uses a clock visual to help students understand the concept of modular arithmetic.
The Nth Prime Page This interactive website calculates the nth prime number and estimates the number of primes up until an input number using the prime-counting function.
TitleTypeDescription
Prime Factors Informational Page This webpage explains why prime factors are important and teaches how to calculate the LCD and GCD
Prime Counting Function Informational Page An informational discription of how the prime-counting function works (a function that estimates the number of primes up to a certian n)
Fermat's Last Theorem Podcast A podcast explaining the journey to proving Fermat's Last Theorem, one of the most famous theorems in number theory.
XKCD Number Line Comic A comic poking fun at number theory and the numbers we do and don't study.
The Mathematics of Cryptography Video A short video explaining some of the basic math behind modern cryptography, especially modular arithmetic.



Number Theory Intro Video



Applet 1: Sine Function Transformation




Let's explore how a and b in f(x) = a*sin(b*x) can change sine!

Questions to consider:
How does a*sin(b*x) change as a incresases? How about as a decreases?
How do various values of b affect the period of sine?
Can you find values of a and b that half the period of sin(x) and increase the amplitude by a factor of 3?
Link to Applet


Applet 2: Inverse Functions




Where do inverse functions come from?

Questions to consider:
Drag point B on f(x). What is the relationship between point B and point D? How does this relate to the inverse of f?
Click to reveal the graph of f inverse. Does f inverse pass the vertical line test? Is it a function?
By changing what f is, can you discover a way to ensure that a function's inverse is itself a function?
Link to Applet


Applet 3: 3d Solids




Height and radius with 3d Conics!

Questions to consider:
How does height and radius affect the volume of the shapes?
Which shape's volume grows the most with an increase in height? Which grows the least?
Under what conditions does a cylinder have a greater volume than a sphere with with the same radius? For a cone?
Link to Applet


Applet 4: Original GeoGebra Applet (RSA Encryption)




How the RSA algorithm works!

Questions to consider:
(step 3) How fast can you factor n into its prime factorization? How difficult would it be to find the factorization of n if each of the primes had 300 digits? This is why RSA encryption is secure.
(step 4) What does relatively prime really mean? Why do we find the greatest common divisor when determining if two numbers are relatively prime?
(step 5) What's the best method you've found for finding e? A calculator could work, but I like considering the multiples of d. Is there a better way to find e?
(steps 6 - 8) What is the advantage of having a public encryption key and private decryption key? How does the theorem on step 8 relate to encrypting and decrypting a message?
Link to Applet