Polynomials are multiple terms, mostly over 4+ terms[5]. When you add polynomials up you add the numbers and use the operations shown, opposing only when turns into negative or positive numbers.
The Pythagorean Theorem only works with Right Triangles[4]. If you calculate the squares of the two short sides(a and b) you will find the length of the long side[hypotenuse(c)]. So a squared + b squared always will = c squared. Here is an example: a = 5, b = 12, c = ?. a squared, or 5 squared = 25, and b squared, or 12 squared = 144. 144 + 25 = 169. 169’s Square Root is 13. SIMPLE!
Ratios are just like fractions, comparing two quantities [3]. Humans use ratios in everyday life, throughout history, and 3000 years ago. Ratios can be expressed as x:y. An example is: There are 30 students in a class, 18 are boys, What is the ratio? 18:30. You can use ratios for circle comparisons just like Pi. There is a ratio called the golden ratio, which is expressed as 1.618:1. Ratios can be used on a trip as well, say you are on a 6% road, what is the ratio? 6:100. See how ratios help you?
Pi is a number with infinite digits and no end [2]. It can be used to find circle circumference, radius, area, and find the relationship. For Circumference, the formula includes: 2 x pi x radius, and for area: pi x radius squared. The first approach to pi was 3.1, then another greek mathematician used polygons and turned it into 3.14, then a greek-roman scientist used the same approach and made it into 3.1416. The years went by and more digits were discovered, and by the time it was 1946, the very first computer(ENIAC) calculated 13 TRILLION digits of Pi! There are lots of different ways to calculate pi, but the most famous is the Monte Carlo Method.
A prime number discovery was made in December by Jon Pace. This number has 23.2 Million digits and is a Mersenne Prime (2*n - 1). It is also known as M77232917 expressed as 2*77232917-1. He was going for a prize to win $100000 14 years ago by finding the first Mersenne Prime over 10000000 digits, but that was found in 2008 on a UCLA computer. A person said this was a prime number discovery (99.999%) or a bug (.001%). A prime number discovery was made in December by Jon Pace. This number has 23.2 Million digits and is a Mersenne Prime (2*n - 1). It is also known as M77232917 expressed as 2*77232917-1. He was going for a prize to win $100000 14 years ago by finding the first Mersenne Prime over 10000000 digits, but that was found in 2008 on a UCLA computer. A person said this was a prime number discovery (99.999%) or a bug (.001%).