For the first part of GSOC I be implemented Wells' Algorithm. This can be found in Elliot Wells' paper Computing the Canonical Height of a Point in Projective Space. This algorithm gives us another way of measuring the canonical height of a mapping. However, Wells' Algorithm (WA) doesn't require you to factor the resultant. Calculating a the resultant is easy, but factoring the resultant can be hard, as factoring is hard. No this may sound odd, as we know every integer has unique prime GSOC- Implementing Wells' Algorithm Rebecca Miller 06/01/2017

For the first part of GSOC I be implemented Wells' Algorithm. This can be found in Elliot Wells' paper Computing the Canonical Height of a Point in Projective Space. This algorithm gives us another way of measuring the canonical height of a mapping. However, Wells' Algorithm (WA) doesn't require you to factor the resultant. Calculating a the resultant is easy, but factoring the resultant can be hard, as factoring is hard. No this may sound odd, as we know every integer has unique prime

Over this summer I am participating in Google Summer of Code 2017 (GSOC).This will be my second , and sadly final, time participating in GSOC. (The funding so nice you can only get it twice! Plus, I'd have to still be a student and lucky for me I just graduated with my M.A. in mathematics from Saint Louis University!) I will again be coding for SAGE Mathematical Software System, an open source database. An open source database is made up of code available for public use and modification. GSOC 2017 Lauren Miller 05/25/2017

Over this summer I am participating in Google Summer of Code 2017 (GSOC).This will be my second , and sadly final, time participating in GSOC. (The funding so nice you can only get it twice! Plus, I'd have to still be a student and lucky for me I just graduated with my M.A. in mathematics from Saint Louis University!) I will again be coding for SAGE Mathematical Software System, an open source database. An open source database is made up of code available for public use and modification.

TFAE stands for “the following are equivalent.” This statement is fairly common in mathematical theorems. Why, you may ask? Well, there is a lot of power in being able to do something multiple ways. It gives us options to find one that can best fit our mathematical needs. A very familiar example of equivalency would be the Fundamental Theorem of Calculus, it tells us we can either evaluate the integral or anti-differentiate. A less familiar example is Euclid’s propositions 5 and TFAE: A brief history of the Axiom of Choice Lauren Miller 04/22/2017

TFAE stands for “the following are equivalent.” This statement is fairly common in mathematical theorems. Why, you may ask? Well, there is a lot of power in being able to do something multiple ways. It gives us options to find one that can best fit our mathematical needs. A very familiar example of equivalency would be the Fundamental Theorem of Calculus, it tells us we can either evaluate the integral or anti-differentiate. A less familiar example is Euclid’s propositions 5 and