Posts

Showing posts with the label Number Theory

Equilateral and Equiangular Polygons

A polygon is a 2 dimensional geometric figure bound with straight sides. A polygon is called Equilateral if all of its sides are congruent. Common examples of equilateral polygons are a rhombus and regular polygons such as equilateral triangles and squares.  Now, a polygon is equiangular if all of its internal angles are congruent.  Some important facts to consider The only equiangular triangle is the equilateral triangle If P is an equilateral polygon that has more than three sides, it does not have to be equiangular. A rhombus with no right angle is an example of an equilateral but non-equiangular polygon.  Rectangles, including squares, are the only equiangular quadrilaterals Equiangular polygon theorem. Each angle of an equiangular n-gon is  $$\Bigg(\frac{n-2}{n}\Bigg)180^{\circ} = 180^{\circ} -   \frac{360^{\circ}}{n} $$ Viviani's theorem   Vincenzo Viviani (1622 – 1703) was a famous Italian mathematician. With his exceptional intelligence in math...
Post a Comment
Read more

Pigeonhole Principle

The Pigeon Hole principle follows a simple observation that if you have 10 pigeons and 9 pigeonholes and you distribute these pigeons randomly, its quite obvious that there will be one pigeonhole with more than 1 pigeon. In other words, there are n boxes (the Pigeonholes), into which more than n objects (the Pigeons), have been placed, then at least one of the boxes must have received more than one of the objects. This principle is frequently applied in problems where we need to determine a minimal number of objects to ensure that some integral number property is satisfied. Consider the following puzzle:  A box contains red, black and white balls. The objective is to pick balls satisfying some constraints. How many balls must be taken to ensure that there is a pair of same color? The key to solve this puzzle is pigeonhole principle.  The principle says:  If $n$ pigeons are nesting in $m$ pigeonholes, where $n > m$, then at least one pigeonhole has more than one pig...
Post a Comment
Read more

Irrational Numbers

A number which cannot be written in the form $ \cfrac {p}{q}$  where $p$ and $q$ are integers and $ q $  $ \neq 0$. Example: $ \sqrt {2}$, $ \sqrt {3}$, $ \sqrt {6}$, $ \sqrt {7}$, $ \sqrt {8}$, $ \sqrt {10}$ Theorem: If $p$ divides $x^3$, then $p$ divides $x$, where $x$ is a positive integer and $p$ is a prime number.  Proof :  Let $x = p_{1} p_{2}...p_{n}$ where $p_{1}, p_{2}, p_{3}.....p_{n}$  are primes, not necessarily distinct.  $ \rightarrow x^3 = p_{1}^3 p_{2}^3.....p_{n}^3$ Given that $p$ divides $x^3$ By fundamental theorem, $p$ is one of the primes of $x^3$.  By the uniqueness of fundamental theorem, the distinct primes of $x^3$ are same as the distinct primes of $x$.  $ \rightarrow p$ divides $x$ Similarly if $p$ divides $x^2$, then $p$ divides $x$, where $p$ is a prime number and $x$ is a positive integer. Example: Prove that  $ \sqrt {2}$ is irrational.  Solution : Let us assume that  $ \sqrt ...
Post a Comment
Read more

Modular Arithmetic

1. Let $n$ be a fixed positive number. Two integers $a$ and $b$ are said to be congruent modulo $n$, symbolized by  $a\equiv b \pmod{n}$  if $n$ divides the difference $a-b$., i.e., provided that $a-b = kn$ for some integer $k$. For ex.   $23\equiv 3 \pmod{5}$,  $19\equiv 3 \pmod{4}$ ,   $12\equiv 5 \pmod{7}$ ,   $5\equiv 5 \pmod{3}$ , 2. For arbitrary integers $a$ and $b$,  $a\equiv b \pmod{n}$  iff $a$ and $b$ leave the same non negative remainder when divided by $n$ 3. Let $n>1$ be fixed and $a, b, c, d$ be arbitrary integers. Then the following properties hold: $a\equiv a \pmod{n}$          Ex.,  $7\equiv 7 \pmod{3}$          $7-7 = 0$ is a multiple of $3$. Hence $3$ divides $0$ If  $a\equiv b \pmod{n}$ , then  $b\equiv a \pmod{n}$          Ex.,  $17\equiv 3 \pmod{7}$          This congruen...
Post a Comment
Read more

Popular posts from this blog

Equilateral and Equiangular Polygons

A polygon is a 2 dimensional geometric figure bound with straight sides. A polygon is called Equilateral if all of its sides are congruent. Common examples of equilateral polygons are a rhombus and regular polygons such as equilateral triangles and squares.  Now, a polygon is equiangular if all of its internal angles are congruent.  Some important facts to consider The only equiangular triangle is the equilateral triangle If P is an equilateral polygon that has more than three sides, it does not have to be equiangular. A rhombus with no right angle is an example of an equilateral but non-equiangular polygon.  Rectangles, including squares, are the only equiangular quadrilaterals Equiangular polygon theorem. Each angle of an equiangular n-gon is  $$\Bigg(\frac{n-2}{n}\Bigg)180^{\circ} = 180^{\circ} -   \frac{360^{\circ}}{n} $$ Viviani's theorem   Vincenzo Viviani (1622 – 1703) was a famous Italian mathematician. With his exceptional intelligence in math...
Read more

Incenter/Excenter Lemma

Image
Given $\triangle ABC$ with incenter $I$, extend $AI$ to meet the circumcircle of $\triangle ABC$ at $L$. Then, reflect $I$ over $L$, and name this point $I_a$. Then:  $(i)$ $BICI_a$ is a cyclic quadrilateral with point $L$ as the center of the circumscribed circle.  $(ii)$ $BI_a$ and $CI_a$ bisect the exterior angles of $\angle B$ and $\angle C$,  respectively.  Proof $(i)$ Notice that the the question is equivalent to proving the distance from $L$ to points $B, I, C, I_a$ are equal. In other words, we need to show that  $$LB = LI = LC = LI_a$$ Firstly, it is obvious that $LI = LI_a$ because by definition, $I_a$ is the reflection of $I$ over $L$, and reflections preserve the length of the segment.  Now, we are left with proving that $LB=LI$, because similar calculations will provide $LI=LC$.  We see that most of our given information involves angles, so we focus on proving $\angle LBI = \angle LIB$. Firstly,  $$\angle LBC = \angl...
Read more

Sequences and Series

 Let's take a look at some interesting sequences and series problems. 1. (USAMTS) Evaluate the value of  $$S = \sqrt{1+\cfrac{1}{1^2}+\cfrac{1}{2^2}} + \sqrt{1+\cfrac{1}{2^2}+\cfrac{1}{3^2}} + ... + \sqrt{1+\cfrac{1}{1999^2}+\cfrac{1}{2000^2}}$$ Solution Notice that $$1+\cfrac{1}{n^2}+\cfrac{1}{(n+1)^2} = \cfrac{n^4+2n^3+3n^2+2n+1}{n^2(n+1)^2} = \cfrac{n^2+n+1)^2}{n^2(n+1)^2} = \Bigg(1+\cfrac{1}{n(n+1)} \Bigg)^2$$ Thus, $$S= \Bigg(1+\cfrac{1}{1 \cdot 2} \Bigg) + \Bigg(1+\cfrac{1}{2 \cdot 3} \Bigg) + \Bigg(1+\cfrac{1}{3 \cdot 4} \Bigg) + ... + \Bigg(1+\cfrac{1}{1999 \cdot 2000} \Bigg)$$ $$= 1999 + \Bigg(1 - \cfrac{1}{2} \Bigg) + \Bigg(\cfrac{1}{2} - \cfrac{1}{3} \Bigg) + ... + \Bigg(\cfrac{1}{1999} - \cfrac{1}{2000} \Bigg) = 1999 + 1 - \cfrac{1}{2000} = \boxed{\cfrac{3,999,999}{2000}}$$ 2. (HMMT) Find the value of  $$S = \cfrac{1}{3^2+1} + \cfrac{1}{4^2+2} + \cfrac{1}{5^2+3} + ...$$ Solution For this problem, we can use partial fraction decomposition and try to find an alt...
Read more