|
|
| Line 36: |
Line 36: |
| | | | |
| | EDIT: Based on the two data points, the function that relates the number of significant digits and the time Gmaas will be summoned is <math>t=.0081111s+.5444</math>. | | EDIT: Based on the two data points, the function that relates the number of significant digits and the time Gmaas will be summoned is <math>t=.0081111s+.5444</math>. |
| − |
| |
| − | == Colball ==
| |
| − |
| |
| − | This article is not finished. Colball is the only person allowed to edit. The plan for me is to make this page longer than Gmaas's. (Sorry, Gmaas).
| |
| − |
| |
| − |
| |
| | | | |
| | == Gmaas == | | == Gmaas == |
| Line 53: |
Line 47: |
| | NOPE. IT'S THERE NOW LAST TIME I CHECKED. -MATHGUY49 | | NOPE. IT'S THERE NOW LAST TIME I CHECKED. -MATHGUY49 |
| | | | |
| − | = What is the definition of Pure Mathematics? =
| + | Collball: Talk: Gmaas is not the place to post your article. |
| − | | |
| − | | |
| − | ''Oh, easy'', you say'' it is just the study of numbers.
| |
| − | | |
| − | That may be true for some areas of math. However, what about geometry, trigonometry, and calculus? And what is the definition of numbers? Now you go to the dictionary and say ''The relationship between measurements and quantities using numbers and symbols''. This is, however, not fully true because this definition also uses applied mathematics. We want ''pure mathematics''.
| |
| − | | |
| − | Also, most of these definitions miss one area of math. ''Chaos Theory''. What is Chaos Theory? Chaos Theory is a recently discovered area of math where nothing can be predicted but nothing is random. We are only at the beginning of learning it. For example, can a butterfly that flaps its wings in Brazil trigger a tornado in Texas?
| |
| − | | |
| − | Some definitions hit almost all the areas of math, but some are too broad and logic, for example, often fits into the definition.
| |
| − | | |
| − | We can, however, define some areas of math but not the whole thing. For example, the definition of geometry is ''Geometry is concerned with the properties and relations of points, lines, surfaces, solids, and higher dimensional analogs''. Or the definition of probability is ''the extent to which an event is likely to occur''.
| |
| − | | |
| − | = Arithmetic =
| |
| − | === Definition ===
| |
| − | ''The branch of mathematics dealing with the properties and manipulation of constants''.
| |
| − | === Operations ===
| |
| − | Arithmetic starts with one thing which without it no arithmetic can survive: Counting Positive Integers.
| |
| − | 1,2,3,4,5...
| |
| − | ==== Addition and addition repeated ====
| |
| − | Addition is combining these integers. The symbol for this is +. <math>a+b=b+a</math>
| |
| − | | |
| − | Multiplication is repeating addition. The symbol for this is <math>\cdot</math>. <math>ab=ba</math>
| |
| − | | |
| − | Exponentiation is repeated Multiplication. The symbol for a to the power of b is <math>a^b</math>. <math>a^b \neq b^a</math>.
| |
| − | | |
| − | ==== Inverse ====
| |
| − | Subtraction is the inverse of addition. To make this a well-defined function everywhere, negative numbers and zero were defined.
| |
| − | | |
| − | Division is the inverse of multiplication. To make this a well-defined function everywhere, non-integral fractions were defined.
| |
| − | | |
| − | <math>n^{\text{th}}</math> roots and logarithms are the inverses of exponentiation. To make these well-defined functions everywhere, irrational numbers were defined.
| |
| − | | |
| − | ==== Negative numbers ====
| |
| − | | |
| − | <math>a</math> and <math>b</math> are positive.
| |
| − | | |
| − | 1. <math>(-a)(-b)=ab</math>
| |
| − | | |
| − | 2. <math>(a)(-b)=-ab</math>
| |
| − | | |
| − | Proof for 1: This is, in fact, the reason why the negative numbers were introduced: so that each positive number would have an additive inverse. ... The fact that the product of two negatives is positive is therefore related to the fact that the inverse of the inverse of a positive number is that positive number back again.
| |
| − | | |
| − | Proof for 2: Since ab is repeated addition then <math>(a)(-b)</math> is repeated subtraction. Therefore it is negative.
| |
| − | | |
| − | ==== Fractions ====
| |
| − | A fraction a number that can be expressed as two numbers divided. For example, five divided by four is <math>\frac{5}{4}</math>.
| |
| − | ===== Simplifing fractions =====
| |
| − | Find common factors in each half of the fration and then divide top and bottam of the fraction by that factor.
| |
| − | | |
| − | <math>\frac{10}{5}=\frac{1}{2}</math>
| |
| − | | |
| − | <math>\frac{15}{3}=\frac{5}{1}</math>
| |
| − | | |
| − | <math>\frac{28}{2}=\frac{14}{1}</math>
| |
| − | ===== Adding fractions =====
| |
| − | Here is how you add fractions. Is they have the same bottom half then <math>\frac{a}{b}+\frac{c}{b}=\frac{a+b}{c}</math>. However, if the two or three or n fractions do not have the same bottom half you make them. <math>\frac{a}{b}+\frac{c}{d}=\frac{bd}{ad+bc}</math>. Subtracting fractions is the same exept everything has a minus symbol. Remember to fully simplify.
| |
| − | ===== Multilpying fractions =====
| |
| − | <math>\frac{a}{b}\frac{c}{d}=\frac{ac}{bd}</math>.
| |
| − | | |
| − | <math>\frac{\frac{a}{b}}{\frac{c}{d}}=\frac{ac}{bd}</math>.
| |
| − | | |
| − | Remember to fully simplify.
| |
| − | | |
| − | ==== Irrational numbers ====
| |
| − | Most square roots are irrational. An irrational number is a number that can not be expresed a a fraction.
| |
| − | ===== Proof that any nonperfect square positive integer is irrational =====
| |
| − | Let us assume that <math>\sqrt{n}</math> is rational where <math>n</math> is a nonperfect square positive integer. Then it can be written as <math>\frac{p}{q}=\sqrt{n} \Rightarrow \frac{p^2}{q^2}=n \Rightarrow (q^2)n=p^2</math>. But no perfect square times a nonperfect square positive integer is a perfect square. Therefore <math>\sqrt{n}</math> is irrational.
| |
| − | | |
| − | ===== pi and e =====
| |
| − | Some irrational numbers are limits. That means they are the sum of smaller and smaller fraction going infinitely long. Pi or <math>\pi</math> (go to the geometry part of this article) is the limit <math>\frac{1}{1}-\frac{1}{3}+\frac{1}{5}-\frac{1}{7}...=\frac{\pi}{4}</math>. e is the limit <math>\frac{1}{0!}+\frac{1}{1!}+\frac{1}{2!}...</math> More at the counting part of the article.
| |
| − | | |
| − | === Exponent rules ===
| |
| − | Listed below are some important properties of exponents:
| |
| − | # <math> b^x\cdot b^y = b^{x+y}</math>
| |
| − | # <math> b^{-x}=\frac 1{b^x} </math>
| |
| − | # <math> \frac{b^x}{b^y}=b^{x-y} </math>
| |
| − | # <math> (b^x)^y = b^{xy} </math>
| |
| − | # <math> (ab)^x = a^x b^x </math>
| |
| − | # <math> b^0 = 1 </math> (if <math>b \neq 0</math>. <math>0^0</math> is undefined.)
| |
| − | | |
| − | Here are explanations of the properties listed above:
| |
| − | # On both sides, we are multiplying '''b''' together '''x+y''' times. Thus, they are equivalent.
| |
| − | # This is described in the previous section.
| |
| − | # This results from using the previous two properties.
| |
| − | # We are multiplying <math>b^x</math> by itself '''y''' times, which is the same as multiplying '''b''' by itself '''xy''' times.
| |
| − | # After multiplying '''ab''' by itself '''x''' times, we can collect '''a''' and '''b''' terms, thus establishing the property.
| |
| − | #Hoping that property #1 will be true when <math>y=0</math>, we see that <math>b^x\cdot b^0</math> should (hopefully) be equal to <math>b^x</math>. Thus, we ''define'' <math>b^0</math> to be equal to <math>1</math> in order to make this be true.
| |
| − | | |
| − | = Algebra =
| |
| − | == Definition ==
| |
| − | ''The part of mathematics in which letters and other general symbols are used to represent numbers and quantities in formulae and equations.''
| |
| − | == One-variable linear equations ==
| |
| − | === Definition ===
| |
| − | 'A One-variable linear equation is an equation that comes in the form <math>ax+b=c</math>. <math>a</math>, <math>b</math>, and <math>c</math> are constants and <math>x</math> is the varible'.
| |
| − | | |
| − | === The answer is always... ===
| |
| − | <math>ax+b=c</math>
| |
| − | | |
| − | <math>ax=c-b</math>
| |
| − | | |
| − | <math>x=\frac{c-b}{a}</math>
| |
| − | | |
| − | When there are fractions in the equation, you multiply both sides by the LMC of the fractions and then you solve. More at the number theory part of this article.
| |
| − | | |
| − | == Quadratics ==
| |
| − | === Defination ===
| |
| − | ''A quadratic equation is an equation of the second degree, meaning it contains at least one term that is squared. The standard form is <math>ax^2 + bx + c = 0</math> with <math>a</math>, <math>b</math>, and <math>c</math> being constants, or numerical coefficients, and <math>x</math> is an unknown variable.''
| |
| − | | |
| − | === The answer is always... ===
| |
| − | <math>ax^2+bx+c=0</math>
| |
| − | | |
| − | <math>x^2+\frac{b}{a}x+\frac{c}{a}=0</math>
| |
| − | | |
| − | <math>x^2+\frac{b}{a}=0-\frac{c}{a}</math>
| |
| − | | |
| − | <math>x^2+\frac{b}{a}+(\frac{b}{2a})^2=0-\frac{c}{a}+(\frac{b}{2a})^2</math>
| |
| − | | |
| − | | |
| − | Since the left side of the equation right above is a perfect square, you can factor the left side by using the coefficient of the first term (x) and the base of the last term(b/2a). Add these two and raise everything to the second.
| |
| − | | |
| − | <math>(x+\frac{b}{2a})^2=0-\frac{c}{a}+\frac{b^2}{2a^2}=\frac{b^2-4ac}{4a^2}</math>
| |
| − | | |
| − | <math>x+\frac{b}{2a}=\frac{\sqrt{\pm b^2-4ac}}{\pm 2a}</math>
| |
| − | | |
| − | <math>x=\frac{\sqrt{\pm b^2-4ac}}{\pm 2a}+\frac{b}{2a}</math>
| |
| − | | |
| − | When simplified the ''Quadratic Formula'' is <math>{x=\frac{-b \pm \sqrt{b^2-4ac}}{2a}}</math>
| |
| − | | |
| − | == i ==
| |
| − | <math>i=\sqrt{-1}</math>.
| |
| − | | |
| − | <math>xi=\sqrt{-x^2}</math>.
| |
| − | | |
| − | Numbers like this are called ''imaginary numbers''. ''Impossible'', you say. But no. Solve <math>x^2+1=0</math>. You get <math>i</math>. <math>oi</math> is <math>o</math>. So zero is both real and imaginary. (real means ''not imaginary'')
| |
| − | | |
| − | === Powers of i ===
| |
| − | | |
| − | <math>i^0=1</math>
| |
| − | <math>i^1=i</math>
| |
| − | <math>i^2=-1</math>
| |
| − | <math>i^3=-i</math>
| |
| − | <math>i^4=1</math>
| |
| − | <math>i^5=i</math>
| |
| − | <math>i^6=-1</math>
| |
| − | <math>i^7=-i</math>
| |
| − | | |
| − | The pattern repeats.
| |
| − | | |
| − | === Complex numbers ===
| |
| − | A complex number is <math>ai+b</math>, where a and b are real. All numbers are complex becuase a and/or/never b can be zero.
| |
| − | | |
| − | <math>ai+b+ci+d=</math> Complex
| |
| − | | |
| − | <math>(ai+b)(ci+d)=</math> Complex
| |
| − | | |
| − | <math>\frac{ai+b}{ci+d}=</math> Complex
| |
| − | | |
| − | <math>(ai+b)-(ci+d)=</math> Complex
| |
| − | | |
| − | == Systems of equations ==
| |
| − | A '''system of equations''' is a set of [[equation]]s which share the same [[variable]]s. An example of a system of equations is
| |
| − | | |
| − | {| class="wikitable" style="margin: 1em auto 1em auto"
| |
| − | | <math>2a - 3b</math> || <math>= 4</math>
| |
| − | |-
| |
| − | | <math>3a - 2b</math> || <math>= 3</math>
| |
| − | |}
| |
| − | | |
| − | === Solving Linear Systems ===
| |
| − | A system of [[linear]] equations is where all of the variables are to the power 1. There are three elementary ways to solve a system of linear equations.
| |
| − | | |
| − | ==== Gaussian Elimination ====
| |
| − | [[Gauss]]ian elimination involves eliminating variables from the system by adding constant multiples of two or more of the equations together. Let's look at an example:
| |
| − | | |
| − | ===== Problem =====
| |
| − | Find the ordered pair <math>(x,y)</math> for which
| |
| − | | |
| − | {| class="wikitable" style="margin: 1em auto 1em auto"
| |
| − | | <math>x - 12y</math> || <math>= 2</math>
| |
| − | |-
| |
| − | | <math>3x + 6y</math> || <math>= 6</math>
| |
| − | |}
| |
| − | | |
| − | ===== Solution =====
| |
| − | We can eliminate <math>y</math> by adding twice the second equation to the first:
| |
| − | | |
| − | {| class="wikitable" style="margin: 1em auto 1em auto"
| |
| − | | || <math>x - 12y= 2</math>
| |
| − | |-
| |
| − | | <math>+2(</math> || <math>3x + 6y = 6)</math>
| |
| − | |-
| |
| − | | || <math>\overline{7x + 0=14}</math>
| |
| − | |}
| |
| − | | |
| − | Thus <math>x=2</math>. We can then plug in for <math>x</math> in either of the equations: <center><math> (2)-12y = 2 \Rightarrow y = 0</math>.</center>
| |
| − | | |
| − | Thus, the solution to the system is <math>(2,0)</math>.
| |
| − | | |
| − | ==== Substitution ====
| |
| − | The second method, substitution, requires solving for a variable and then plugging that variable into another equation therefore reducing the number of variables. We'll show how to solve the same problem from the elimination section using substitution.
| |
| − | | |
| − | ===== Problem =====
| |
| − | Find the ordered pair <math>(x,y)</math> for which
| |
| − | | |
| − | {| class="wikitable" style="margin: 1em auto 1em auto"
| |
| − | | <math>x - 12y</math> || <math>= 2</math>
| |
| − | |-
| |
| − | | <math>3x + 6y</math> || <math>= 6</math>
| |
| − | |}
| |
| − | | |
| − | ===== Solution =====
| |
| − | The first equation can be solved for <math>x</math>: <center><math> x = 12y + 2. </math></center>
| |
| − | | |
| − | Plugging this into the second equation yields <center><math>3(12y + 2) + 6y = 6 \Leftrightarrow 42 y = 0. </math></center>
| |
| − | | |
| − | Thus <math>y=0</math>. Plugging this into either of the equations and solving for <math>x</math> yields <math>x=2</math>.
| |
| − | | |
| − | == Algebra ==
| |
| − | | |
| − | There are many more types of algebra: inequalities, polynomials, graphing equations, arithmetic, and geometric sequence.
| |
| − | | |
| − | Algebra is a broad and diverse area of math in which this is just a short introduction.
| |
| − | | |
| − | = Number Theory =
| |
| − | == Definition ==
| |
| − | ''The branch of mathematics that deals with the properties and relationships of numbers, especially the positive integers''.
| |
| − | | |
| − | == Primes ==
| |
| − | A '''prime number''' (or simply '''prime''') is a positive integer <math>p>1</math> whose only positive divisors are 1 and itself.
| |
| − | Note that <math>1</math> is usually defined as being neither prime nor composite because it is its only factor among the natural number numbers.
| |
| − | | |
| − | There are an infinite number of prime numbers. A standard proof attributed to Euclid notes that if there are a finite set of prime numbers <math>p_1, p_2, \ldots, p_n</math>, then the number <math>N = p_1p_2\cdots p_n + 1</math> is not divisible by any of them, but <math>N</math> must [[#Importance of Primes|have]] a prime factor, which leads to a direct contradiction.
| |
| − | | |
| − | === Techniques to Check for Prime Numbers ===
| |
| − | | |
| − | ==== Divisibility ====
| |
| − | A prime number is only divisible by one or itself, so a number <math>n</math> is prime if and only if <math>n</math> is not divisible by any integer greater than <math>1</math> and less than <math>n</math>. One only needs to check integers up to <math>\sqrt{n}</math> because dividing larger numbers would result in a quotient smaller than <math>\sqrt{n}</math>.
| |
| − | | |
| − | ==== Modular Arithmetic ====
| |
| − | Modular arithmetic can help determine if a number is not prime.
| |
| − | | |
| − | * If a number not equal to <math>2,3</math> is congruent to <math>0,2,3,4,6 \pmod{6}</math>, then the number is not prime.
| |
| − | * If a number not equal to <math>2,5</math> ends with an even digit or <math>5</math>, then the number is not prime.
| |
| − | | |
| − | | |
| − | === Importance of Primes ===
| |
| − | According to the Fundamental Theorem of Arithmetic, there is exactly one unique way to factor a positive integer into a product of primes. This unique prime factorization plays an important role in solving many kinds of number theory problems.
| |
| − | | |
| − | | |
| − | | |
| − | ==== Mersenne Primes ====
| |
| − | | |
| − | A Mersenne prime is a prime of the form <math>2^n-1</math>. For such a number to be prime, ''n'' must itself be prime. Compared to other numbers of comparable sizes, Mersenne numbers are easy to check for primality because of the https://en.wikipedia.org/wiki/Lucas%E2%80%93Lehmer_primality_test Lucas-Lehmer test, severely reducing the amount of computation needed.
| |
| − | | |
| − | ==== Twin Primes ====
| |
| − | Two primes that differ by exactly 2 are known as twin primes. The following are the first few pairs of twin primes:<br>
| |
| − | 3, 5<br>
| |
| − | 5, 7<br>
| |
| − | 11, 13<br>
| |
| − | 17, 19<br>
| |
| − | 29, 31<br>
| |
| − | 41, 43<br>
| |
| − | | |
| − | It is not known whether or not there are infinitely many pairs of twin primes. This is known as the Twin Prime Conjecture, which is a specific instance of the Hardy-Littlewood conjecture.
| |
| − | | |
| − | ==== Gaussian Primes ====
| |
| − | | |
| − | A Gaussian prime is a prime that extends the idea of the traditional prime to the Gaussian integer. One can define this term for any ring, especially number rings.
| |
| − | | |
| − | === Advanced Definition ===
| |
| − | When the need arises to include negative divisors, a '''prime''' is defined as an integer p whose only divisors are 1, -1, p, and -p. More generally, if ''R'' is an integral domain, then a nonzero element ''p'' of ''R'' is a '''prime''' if whenever we write <math>p=ab</math> with <math>a,b\in R</math>, then exactly one of ''a'' and ''b'' is a unit.
| |
| − | | |
| − | == LCM and GCD ==
| |
| − | === GCD ===
| |
| − | ==== Definition ====
| |
| − | The GCD or Greatest Common Divisor of multiple numbers is the largest number that is a factor of all those multiple numbers. The answer can be and usually is 1.
| |
| − | ==== Prime Factorization ====
| |
| − | The way to solve most GCD's is with using ''Prime Factorization''. Remember that the way to find the prime factorization of a number is to find which primes products hit that certain number. The prime factorization of 24 is <math>2 \cdot 2 \cdot 2 \cdot 3</math>. The prime factorization of 18 is <math>2 \cdot 3 \cdot 3</math>. In GCD you take the prime factorization of each number and then find which primes match up.
| |
| − | | |
| − | === LCM ===
| |
| − | ==== Definition ====
| |
| − | The LCM or Least Common Multiple of two or three or n numbers is the smallest integer in which both numbers are factors of it.
| |
| − | For example, the LCM of 10 and 5 is 10.
| |
| − | ==== Problems ====
| |
| − | ===== Problem 1 =====
| |
| − | ====== Problem ======
| |
| − | What is the LCM of 8 and 5?
| |
| − | ====== Solution ======
| |
| − | The way to solve LCM's with no common factors is to multiply them. The answer is just 40.
| |
| − | ===== Problem 2 =====
| |
| − | ====== Problem ======
| |
| − | What is the LCM of 15 and 10.
| |
| − | ====== Solution ======
| |
| − | The Way to solve this is see that the answer would be the first multiple of 5 that is divisble by 15 and 10. That is just 30.
| |
| − | ===== Problem 3 =====
| |
| − | ====== Problem ======
| |
| − | Find the LCM of 2, 3 and 5.
| |
| − | ====== Solution ======
| |
| − | It is the same with three numbers. Multiply them to get 30. Same as last time.
| |
| − | | |
| − | == Bases ==
| |
| − | In mathematics, a base or radix is the number of different digits or a combination of digits and letters that a system of counting uses to represent numbers. For example, the most common base used today is the decimal system. Because "dec" means 10, it uses the 10 digits from 0 to 9. Most people think that we most often use base 10 because we have 10 fingers.
| |
| − | ==== Some Numbers in other bases ====
| |
| − | A base can be any whole number bigger than 1. The base of a number may be written next to the number: for instance, <math>{23_{8}}</math> means 23 in base 8 (which is equal to 19 in base 10).
| |
| − | Here are some examples of how numbers are written in varying bases, compared to decimal:
| |
| − | | |
| − | In Arabic numbers (decimal, or base 10), there are 10 digits: 0,1,2,3,4,5,6,7,8,9. You need one digit each to count up to 9, but two digits for ten, and three digits for a hundred, which is ten times ten. In Binary, base 2, you need two digits for two, as you only have two digits, 0 and 1. Base 5 has five digits, and the number five becomes 10. For base 16, you will need sixteen digits, and there are only ten numerals. So we use the letters A,B,C,D,E,F. These represent the decimal numbers 10, 11, 12, 13, 14 and 15. Look at the table below and find the pattern for these bases.
| |
| − | | |
| − | == Number Theory ==
| |
| − | This is the end of the number theory part of this article. Number Theory, however, has much more to than what I have just shown you.
| |
| − | | |
| − | = Pascal's Triangle and Combinatorics =
| |
| − | == Pascal's Identity ==
| |
| − | === Identity ===
| |
| − | Pascal's Identity states that
| |
| − | | |
| − | <math>{n \choose k}={n-1\choose k-1}+{n-1\choose k}</math>
| |
| − | | |
| − | for any positive integers <math>k</math> and <math>n</math>. Here, <math>\binom{n}{k}</math> is the binomial coefficient <math>\binom{n}{k} = nCk = C_k^n</math>.
| |
| − | | |
| − | Remember that <math>\binom{n}{r}=\frac{n!}{k!(n-k)!}</math>. <math>\binom{n}{r}</math> means the number of ways to pick r thing from n things where order does not matter. <math>n!=1 \cdot 2 \cdot 3 \cdot...\cdot n</math>.
| |
| − | | |
| − | === Proving it ===
| |
| − | If <math>k > n</math> then <math>\binom{n}{k} = 0 = \binom{n - 1}{k - 1} + \binom{n - 1}{k}</math> and so the result is pretty clear.
| |
| − | So assume <math>k \leq n</math>. Then
| |
| − | | |
| − | <cmath>\begin{eqnarray*}\binom{n-1}{k-1}+\binom{n-1}{k}&=&\frac{(n-1)!}{(k-1)!(n-k)!}+\frac{(n-1)!}{k!(n-k-1)!}\\
| |
| − | &=&(n-1)!\left(\frac{k}{k!(n-k)!}+\frac{n-k}{k!(n-k)!}\right)\\
| |
| − | &=&(n-1)!\cdot \frac{n}{k!(n-k)!}\\
| |
| − | &=&\frac{n!}{k!(n-k)!}\\
| |
| − | &=&\binom{n}{k}. \qquad\qquad\square\end{eqnarray*}</cmath>
| |
| − | There we go. We proved it!
| |
| − | | |
| − | === Why is it needed? ===
| |
| − | It's mostly just a cool thing to know. However, if you want to know how to use it in real life go to https://artofproblemsolving.com/videos/counting/chapter12/141. Or really any of the counting and probability videos.
| |
| − | | |
| − | == Introduction to Pascal's Triangle ==
| |
| − | === How to build it ===
| |
| − | Pascal's Triangle is a triangular array of numbers in which you start with two infinite diagonals of ones and each of the rest of the numbers is the sum of the two numbers above it. It looks something like this:
| |
| − | 1
| |
| − | 1 1
| |
| − | 1 2 1
| |
| − | 1 3 3 1
| |
| − | 1 4 6 4 1
| |
| − | And on and on...
| |
| − | | |
| − | === Combinations ===
| |
| − | ==== Combinations ====
| |
| − | Pascal's Triangle is really combinations. It looks something like this if it is depicted as combinations:
| |
| − | | |
| − | <math>\binom{0}{0}</math>
| |
| − | <math>\binom{1}{0}</math> <math>\binom{1}{1}</math>
| |
| − | <math>\binom{2}{0}</math> <math>\binom{2}{1}</math> <math>\binom{2}{2}</math>
| |
| − | | |
| − | And on and on...
| |
| − | | |
| − | ==== Proof ====
| |
| − | | |
| − | If you look at the way we build the triangle, each number is the sum of the two numbers above it. Assuming that these combinations are true then each combination in the sum of the two combinations above it. In an equation, it would look something like this: <math>{n \choose k}={n-1\choose k-1}+{n-1\choose k}</math>. Its Pascals Identity! Therefore each row looks something like this:
| |
| − | | |
| − | <math>\binom{n}{0} \binom{n}{1} \binom{n}{2} ... \binom{n}{n}</math>
| |
| − | | |
| − | == Patterns and Properties ==
| |
| − | In addition to combinations, ''Pascal's Triangle'' has many more patterns and properties. See below. Be ready to be amazed.
| |
| − | === Binomial Theorem ===
| |
| − | Let's multiply out some binomials. Try it yourself and it will not be fun:
| |
| − | <math>(x+y)^0=1</math>
| |
| − | | |
| − | <math>(x+y)^1=1x+1y</math>
| |
| − | | |
| − | <math>(x+y)^2=1x^2+2xy+1y^2</math>
| |
| − | | |
| − | <math>(x+y)^2=1x^3+3x^2y+3y^2x+1^3</math>
| |
| − | | |
| − | If you take away the x's and y's you get:
| |
| − | | |
| − | 1
| |
| − | 1 1
| |
| − | 1 2 1
| |
| − | 1 3 3 1
| |
| − | It's ''Pascal's Triangle''!
| |
| − | | |
| − | ===== Proof =====
| |
| − | Here are a number of different ways to prove the Binomial Theorem, for example by a straightforward application of mathematical induction. The Binomial Theorem also has a nice combinatorial proof:
| |
| − | | |
| − | We can write <math>(a+b)^n=\underbrace{ (a+b)\cdot(a+b)\cdot(a+b)\cdot\cdots\cdot(a+b) }_{n}</math>. Repeatedly using the distributive property, we see that for a term <math>a^m b^{n-m}</math>, we must choose <math>m</math> of the <math>n</math> terms to contribute an <math>a</math> to the term, and then each of the other <math>n-m</math> terms of the product must contribute a <math>b</math>. Thus, the coefficient of <math>a^m b^{n-m}</math> is the number of ways to choose <math>m</math> objects from a set of size <math>n</math>, or <math>\binom{n}{m}</math>. Extending this to all possible values of <math>m</math> from <math>0</math> to <math>n</math>, we see that <math>(a+b)^n = \sum_{m=0}^{n}{\binom{n}{m}}\cdot a^m\cdot b^{n-m}</math>, as claimed.
| |
| − | | |
| − | Similarly, the coefficients of <math>(x+y)^n</math> will be the entries of the <math>n^\text{th}</math> row of Pascal's Triangle. This is explained further in the Counting and Probability textbook [AoPS]
| |
| − | ===== In real life =====
| |
| − | It is really only used for multipling out binomials. More usage at
| |
| − | https://artofproblemsolving.com/videos/counting/chapter14/126.
| |
| − | ==== Powers of 2 ====
| |
| − | ===== Theorem =====
| |
| − | ====== Theorem ======
| |
| − | It states that <math>\binom{n}{0}+\binom{n}{1}+...+\binom{n}{n}=2^n</math>
| |
| − | | |
| − | ====== Why do we need it? ======
| |
| − | It is useful in many word problems (That means, yes, you can use it in real life) and it is just a cool thing to know. More at https://artofproblemsolving.com/videos/mathcounts/mc2010/419.
| |
| − | ===== Proofs =====
| |
| − | ====== Subset proof ======
| |
| − | Say you have a word with n letters. How many subsets does it have in terms of n? Here is how you answer it: You ask the first letter Are you in or are you out? Same to the second letter. Same to the third. Same to the n. Each of the letters has two choices: In and Out. The would be <math>(2)(2)(2)(2)</math>...n times. <math>2^n</math>.
| |
| − | | |
| − | ====== Alternate proof ======
| |
| − | If you look at the way we built the triangle you see that each number is row n-1 is added on twice in row n. This means that each row doubles. That means you get powers of two.
| |
| − | | |
| − | ==== Triangle Numbers ====
| |
| − | ===== Theorem =====
| |
| − | If you look at the numbers in the third diagonal you see that they are triangle numbers.
| |
| − | ===== Proof =====
| |
| − | Now we can make an equation: <math>\binom{n}{2}=1+2+3+...+(n-1) \Rightarrow \binom{n}{2}=\frac{n(n+1)}{2} \Rightarrow \frac{n!}{2!(n-2)!}=\frac{n(n+1)}{2} \Rightarrow \frac{n(n+1)}{2}=\frac{n(n+1)}{2}</math>
| |
| − | | |
| − | ==== Hockey stick ====
| |
| − | For <math>n,r\in\mathbb{N}, n>r,\sum^n_{i=r}{i\choose r}={n+1\choose r+1}</math>.
| |
| − | | |
| − | | |
| − | <asy>
| |
| − | int chew(int n,int r){
| |
| − | int res=1;
| |
| − | for(int i=0;i<r;++i){
| |
| − | res=quotient(res*(n-i),i+1);
| |
| − | }
| |
| − | return res;
| |
| − | }
| |
| − | for(int n=0;n<9;++n){
| |
| − | for(int i=0;i<=n;++i){
| |
| − | if((i==2 && n<8)||(i==3 && n==8)){
| |
| − | if(n==8){label(string(chew(n,i)),(11+n/2-i,-n),p=red+2.5);}
| |
| − | else{label(string(chew(n,i)),(11+n/2-i,-n),p=blue+2);}
| |
| − | }
| |
| − | else{
| |
| − | label(string(chew(n,i)),(11+n/2-i,-n));
| |
| − | }
| |
| − | }
| |
| − | }
| |
| − | </asy>
| |
| − | | |
| − | This identity is known as the ''hockey-stick'' identity because, on Pascal's triangle, when the addends represented in the summation and the sum itself is highlighted, a hockey-stick shape is revealed.
| |
| − | | |
| − | | |
| − | ===== Proof =====
| |
| − | | |
| − | '''Inductive Proof'''
| |
| − | | |
| − | This identity can be proven by induction on <math>n</math>.
| |
| − | | |
| − | <u>Base Case</u>
| |
| − | Let <math>n=r</math>.
| |
| − | | |
| − | <math>\sum^n_{i=r}{i\choose r}=\sum^r_{i=r}{i\choose r}={r\choose r}=1={r+1\choose r+1}</math>.
| |
| − | | |
| − | <u>Inductive Step</u>
| |
| − | Suppose, for some <math>k\in\mathbb{N}, k>r</math>, <math>\sum^k_{i=r}{i\choose r}={k+1\choose r+1}</math>.
| |
| − | Then <math>\sum^{k+1}_{i=r}{i\choose r}=\left(\sum^k_{i=r}{i\choose r}\right)+{k+1\choose r}={k+1\choose r+1}+{k+1\choose r}={k+2\choose r+1}</math>.
| |
| − | | |
| − | '''Algebraic Proof'''
| |
| − | | |
| − | It can also be proven algebraically with [[Pascal's Identity]], <math>{n \choose k}={n-1\choose k-1}+{n-1\choose k}</math>.
| |
| − | Note that
| |
| − | | |
| − | <math>{r \choose r}+{r+1 \choose r}+{r+2 \choose r}+\cdots+{r+a \choose r}</math>
| |
| − | <math>={r+1 \choose r+1}+{r+1 \choose r}+{r+2 \choose r}+\cdots+{r+a \choose r}</math>
| |
| − | <math>={r+2 \choose r+1}+{r+2 \choose r}+\cdots+{r+a \choose r}=\cdots={r+a \choose r+1}+{r+a \choose r}={r+a+1 \choose r+1}</math>, which is equivalent to the desired result.
| |
| − | | |
| − | '''Combinatorial Proof 1'''
| |
| − | | |
| − | Imagine that we are distributing <math>n</math> indistinguishable candies to <math>k</math> distinguishable children. By a direct application of Balls and Urns, there are <math>{n+k-1\choose k-1}</math> ways to do this. Alternatively, we can first give <math>0\le i\le n</math> candies to the oldest child so that we are essentially giving <math>n-i</math> candies to <math>k-1</math> kids and again, with Balls and Urns, <math>{n+k-1\choose k-1}=\sum_{i=0}^n{n+k-2-i\choose k-2}</math>, which simplifies to the desired result.
| |
| − | | |
| − | '''Combinatorial Proof 2'''
| |
| − | | |
| − | We can form a committee of size <math>k+1</math> from a group of <math>n+1</math> people in <math>{{n+1}\choose{k+1}}</math> ways. Now we hand out the numbers <math>1,2,3,\dots,n-k+1</math> to <math>n-k+1</math> of the <math>n+1</math> people. We can divide this into <math>n-k+1</math> disjoint cases. In general, in case <math>x</math>, <math>1\le x\le n-k+1</math>, person <math>x</math> is on the committee and persons <math>1,2,3,\dots, x-1</math> are not on the committee. This can be done in <math>\binom{n-x+1}{k}</math> ways. Now we can sum the values of these <math>n-k+1</math> disjoint cases, getting <cmath>{{n+1}\choose {k+1}} ={{n}\choose{k}}+{{n-1}\choose{k}}+{{n-2}\choose{k}}+\hdots+{{k+1}\choose{k}}+{{k}\choose{k}}.</cmath>
| |
| − | | |
| − | = Geometry =
| |
| − | == Definition ==
| |
| − | ''The branch of mathematics concerned with the properties and relations of points, lines, surfaces, solids, and higher dimensional analogs''.
| |
| − | == One-D ==
| |
| − | We are not going to go into zero-d because that means nothing (literally). It is just an infinitely small dot called a point. (Duh).
| |
| − | One-D or One dimension either a line (infinitely long, straight and perfectly narrow in both directions) a, a ray (infinitely long line in one direction) or a line segment (any length, straight and perfectly narrow in both directions). This is still pretty boring. Ya, I thought so.
| |
| − | == Two-D ==
| |
| − | == Three-D ==
| |
| − | == Geometry ==
| |
along the edge of the circle.
along the edge of the hexagon.
5 centimeters above the hexagon.
5 centimeters below the hexagon.
inside the circle.
and include 
radians, degrees, or gradians; the exact location if the value of 
.
