From e569d3b9cdd574875dfd1c461cc2af8bc748136b Mon Sep 17 00:00:00 2001
From: Nalin Bhardwaj <nalin.bhardwaj@icloud.com>
Date: Tue, 4 Oct 2016 14:39:35 +0530
Subject: [PATCH 1/8] added newline

added new line to correct formatting of main page.
---
 src/index.md | 1 +
 1 file changed, 1 insertion(+)

diff --git a/src/index.md b/src/index.md
index 1d1a11af7..2c8bbea57 100644
--- a/src/index.md
+++ b/src/index.md
@@ -40,6 +40,7 @@ especially popular in field of competitive programming.*
 - [Kirchhoff theorem](./graph/kirchhoff-theorem.html)
 - [Topological sorting](./graph/topological-sort.html)
 - [Searching for bridges in O(N+M)](./graph/bridge-searching.html)
+
 ---
 
 [Information for contributors](./contrib.html) and [Test-Your-Page form](./test.php)

From fde62e015da933741f701316d852661211b1885a Mon Sep 17 00:00:00 2001
From: Nalin Bhardwaj <nalin.bhardwaj@icloud.com>
Date: Wed, 26 Oct 2016 04:43:19 +0530
Subject: [PATCH 2/8] Added Euclid's algorithm

Intial version.
---
 src/algebra/euclid-algorithm.md | 113 ++++++++++++++++++++++++++++++++
 1 file changed, 113 insertions(+)
 create mode 100644 src/algebra/euclid-algorithm.md

diff --git a/src/algebra/euclid-algorithm.md b/src/algebra/euclid-algorithm.md
new file mode 100644
index 000000000..55194a9c7
--- /dev/null
+++ b/src/algebra/euclid-algorithm.md
@@ -0,0 +1,113 @@
+<!--?title The Euclidean algorithm for finding GCD (greatest common divisor) -->
+
+# The Euclidean algorithm for finding GCD (greatest common divisor)
+
+Given two non-negative integers $a$ and $b$, we require the greater common divisor i.e. the largest number which is a divisor of $a$ and $b$ simultaneously. It's common denoted by $gcd$.
+
+![Euclid’s formula](http://e-maxx.ru/tex2png/cache/e49f97b41b2449d76d33517b580fef68.png)
+
+(here the symbol "$\mid$" denotes divisibility, i.e. “$k\mid a$” means “$k$ divides $a$”)
+
+When one of the numbers is zero, while the other is non zero, the greatest common divisor, by definition, is the second number. However, when both these numbers are zero, it is undefined(it can be an infinitely large number), but we can take it to be equal to zero. So we have a simple rule: if one of the numbers is zero, the other number is the gcd.
+
+The Euclidean algorithm, discussed below, solves the problem of finding the greatest common divisor of two numbers $a$ and $b$ in $O(\log min(a, b))$.
+
+The algorithm was first described in Euclid's “**Elements**” (circa 300 BC). However, it is possible that the algorithm has earlier origins.
+
+##Algorithm
+
+The algorithm is extremely simple and described by this formula:
+
+![image](http://e-maxx.ru/tex2png/cache/b8e1571eb429ef8ef1c06bc060dec3e7.png)
+
+##Implementation
+
+```cpp
+int gcd (int a, int b) {
+	if (b == 0)
+		return a;
+	else
+		return gcd (b, a % b);
+}
+```
+
+Using the ternary operator in C++, we can write a shorter implementation:
+
+```cpp
+int gcd (int a, int b) {
+	return b ? gcd (b, a % b) : a;
+}
+```
+
+Finally, we present a non-recursive form of implementation of the algorithm:
+
+```cpp
+int gcd (int a, int b) {
+	while (b) {
+ a %= b;
+ swap (a, b);
+	}
+	return a;
+}
+```
+
+##The Proof of correctness
+
+First, observe that at each successive iteration of the Euclidean algorithm, it's second argument strictly decreases, therefore, since it is always non-negative, the algorithm must terminate.
+
+For the proof of correctness, we need to show $gcd(a, b) = gcd(b, a mod b)$ for all $a \geq 0$, $b > 0$.
+
+We will show that the quantity on the left side of the equation, can be written as the value on the left. Obviously, this would mean that the left and right sides are the same and prove Euclid's algorithm.
+
+Let $d = gcd(a, b)$. Then, by definition $d\mid a$ and $d\mid b$.
+
+New writing the remainder on dividing $a$ by $b$:
+
+![image](http://e-maxx.ru/tex2png/cache/ad604a58d5faf878aeaa5492d8f28d12.png)
+
+But then, it follows:
+
+![image](http://e-maxx.ru/tex2png/cache/85feaf22c5f69e1d19617467cdab7a04.png)
+
+So, remembering the statement $d\mid b$, we obtain the system:
+
+![image](http://e-maxx.ru/tex2png/cache/9d785ea6dd075edc4a1849cf44affb22.png)
+
+We now use the following fact: if for any three numbers $p$, $q$, and $r$, if $p\mid q$ and $p\mid r$ then $p\mid gcd(q, r)$, In our case, we get:
+
+![image](http://e-maxx.ru/tex2png/cache/9318355a27d52014ebd91c204579fb3c.png)
+
+Or, by substituting $d$ by it's definition($gcd(a, b)$) we get:
+
+![image](http://e-maxx.ru/tex2png/cache/256b72e6f755e9181250d20bf15cc4b7.png)
+
+So, we have shown that the left side divides the right. The second half of the proof is similar.
+
+##Time complexity
+
+The running time of the algorithm is estimated by Lame's theorem, which establishes a surprising connection between the euclidean algorithm and the Fibonacci sequence:
+
+If $a > b \geq 1$ and $b < F_n$ for some $n$, the euclidean algorithm performs no more than $n-2$ recursive calls.
+
+Moreover, one can show that the upper bound of this theorem is optimal. When $a = F_n$ and $b = F_n-1$, $gcd(a, b)$ performs $n-2$ recursive calls. In other words, consecutive fibonacci numbers are the worst case input for Euclid's algorithm.
+
+Given that Fibonacci numbers grow exponentially(as a constant with respect to $n$), we find that the Euclidean algorithm is performed in $O(\log min(a, b))$
+
+LCM(Least common multiple)
+
+Calculating least common multiple (least common multiplier, lcm) is reduced to calculating $gcd$ with the following simple statement:
+
+![image](http://e-maxx.ru/tex2png/cache/1407548584803d912291dc28ee8f40ec.png)
+
+Thus, the calculation of the LCM can also be done using the euclidean algorithm with the same time complexity
+
+```cpp
+int lcm (int a, int b) {
+	return a / gcd (a, b) * b;
+}
+```
+(here it is advantageous to first divide $gcd$ and then multiply by $b$, as it helps avoid overflow in some cases)
+
+##Literature
+
+- Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein. Algorithms: Construction and analysis [2005]
\ No newline at end of file

From 647ab4a4a01c607987801478255fa84900868d5c Mon Sep 17 00:00:00 2001
From: Nalin Bhardwaj <nalin.bhardwaj@icloud.com>
Date: Wed, 26 Oct 2016 04:44:44 +0530
Subject: [PATCH 3/8] Added note

---
 src/algebra/euclid-algorithm.md | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/src/algebra/euclid-algorithm.md b/src/algebra/euclid-algorithm.md
index 55194a9c7..b7a1f713a 100644
--- a/src/algebra/euclid-algorithm.md
+++ b/src/algebra/euclid-algorithm.md
@@ -110,4 +110,6 @@ int lcm (int a, int b) {
 
 ##Literature
 
-- Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein. Algorithms: Construction and analysis [2005]
\ No newline at end of file
+- Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein. Algorithms: Construction and analysis [2005]
+
+####Note: Translated by [NibNalin](http://codeforces.com/profile/NibNalin)
\ No newline at end of file

From 4b23bfe8cf5a4cbbfb333c05cbccd7aba903e081 Mon Sep 17 00:00:00 2001
From: Nalin Bhardwaj <nalin.bhardwaj@icloud.com>
Date: Wed, 26 Oct 2016 04:50:48 +0530
Subject: [PATCH 4/8] Minor edits

Updated formatting, grammar etc.
---
 src/algebra/euclid-algorithm.md | 14 +++++++-------
 1 file changed, 7 insertions(+), 7 deletions(-)

diff --git a/src/algebra/euclid-algorithm.md b/src/algebra/euclid-algorithm.md
index b7a1f713a..198902b63 100644
--- a/src/algebra/euclid-algorithm.md
+++ b/src/algebra/euclid-algorithm.md
@@ -14,13 +14,13 @@ The Euclidean algorithm, discussed below, solves the problem of finding the grea
 
 The algorithm was first described in Euclid's “**Elements**” (circa 300 BC). However, it is possible that the algorithm has earlier origins.
 
-##Algorithm
+## Algorithm
 
 The algorithm is extremely simple and described by this formula:
 
 ![image](http://e-maxx.ru/tex2png/cache/b8e1571eb429ef8ef1c06bc060dec3e7.png)
 
-##Implementation
+## Implementation
 
 ```cpp
 int gcd (int a, int b) {
@@ -51,11 +51,11 @@ int gcd (int a, int b) {
 }
 ```
 
-##The Proof of correctness
+## The Proof of correctness
 
 First, observe that at each successive iteration of the Euclidean algorithm, it's second argument strictly decreases, therefore, since it is always non-negative, the algorithm must terminate.
 
-For the proof of correctness, we need to show $gcd(a, b) = gcd(b, a mod b)$ for all $a \geq 0$, $b > 0$.
+For the proof of correctness, we need to show $gcd(a, b) = gcd(b, a\mod b)$ for all $a \geq 0$, $b > 0$.
 
 We will show that the quantity on the left side of the equation, can be written as the value on the left. Obviously, this would mean that the left and right sides are the same and prove Euclid's algorithm.
 
@@ -83,17 +83,17 @@ Or, by substituting $d$ by it's definition($gcd(a, b)$) we get:
 
 So, we have shown that the left side divides the right. The second half of the proof is similar.
 
-##Time complexity
+## Time complexity
 
 The running time of the algorithm is estimated by Lame's theorem, which establishes a surprising connection between the euclidean algorithm and the Fibonacci sequence:
 
 If $a > b \geq 1$ and $b < F_n$ for some $n$, the euclidean algorithm performs no more than $n-2$ recursive calls.
 
-Moreover, one can show that the upper bound of this theorem is optimal. When $a = F_n$ and $b = F_n-1$, $gcd(a, b)$ performs $n-2$ recursive calls. In other words, consecutive fibonacci numbers are the worst case input for Euclid's algorithm.
+Moreover, one can show that the upper bound of this theorem is optimal. When $a = F_n$ and $b = F_{n-1}$, $gcd(a, b)$ performs $n-2$ recursive calls. In other words, consecutive fibonacci numbers are the worst case input for Euclid's algorithm.
 
 Given that Fibonacci numbers grow exponentially(as a constant with respect to $n$), we find that the Euclidean algorithm is performed in $O(\log min(a, b))$
 
-LCM(Least common multiple)
+## LCM(Least common multiple)
 
 Calculating least common multiple (least common multiplier, lcm) is reduced to calculating $gcd$ with the following simple statement:
 

From ccb9cc81aa9df6255263e111eddad3e5cee32bb3 Mon Sep 17 00:00:00 2001
From: Nalin Bhardwaj <nalin.bhardwaj@icloud.com>
Date: Wed, 26 Oct 2016 04:53:28 +0530
Subject: [PATCH 5/8] Added images

Copied images from emaxx.ru
---
 img/euclid1.png | Bin 0 -> 1364 bytes
 img/euclid2.png | Bin 0 -> 2048 bytes
 img/euclid3.png | Bin 0 -> 787 bytes
 img/euclid4.png | Bin 0 -> 643 bytes
 img/euclid5.png | Bin 0 -> 974 bytes
 img/euclid6.png | Bin 0 -> 850 bytes
 img/euclid7.png | Bin 0 -> 1002 bytes
 img/euclid8.png | Bin 0 -> 1030 bytes
 8 files changed, 0 insertions(+), 0 deletions(-)
 create mode 100644 img/euclid1.png
 create mode 100644 img/euclid2.png
 create mode 100644 img/euclid3.png
 create mode 100644 img/euclid4.png
 create mode 100644 img/euclid5.png
 create mode 100644 img/euclid6.png
 create mode 100644 img/euclid7.png
 create mode 100644 img/euclid8.png

diff --git a/img/euclid1.png b/img/euclid1.png
new file mode 100644
index 0000000000000000000000000000000000000000..4902f1959f2a6acfccb0388d63bec2945921925c
GIT binary patch
literal 1364
zcmV-a1*`grP)<h;3K|Lk000e1NJLTq008^|001Ef0{{R3%GEZc0000pP)t-s>FMbJ
z007+F+>(-#b#-;VzP^NnggQDpSXfxi&CO<JX0WiZ4h{|-9UUwzEJ;a8p`oEDl5fQT
z00i7gL_t(&1=U#DwyPivMdrcj|G)O`1W>Ws)(&@_@}LL-vNIBec-Tz1OJeTM{^q1i
zHZkW$9|NcavpSyt!=sh;Qx;_!7`5~#Br<gww*EQYFRY(H!?0uUKI{L0EOgl)<ajXo
zw}&e0=Ug)QaE?q3Wo`U9!(UiGMbF@^J)QT}A<T42^G7EZ)`e8sNJSu});ep^Xe$}~
zSREQvvV}4zrL*DpyP1~mm9LO=2$rJBtQGHW!5ei<N^nFx?&qNUhYmoQ5j!Ki4>1S{
zq=CkT*HUT@cwO1WOiAcP5;PdP805$-xFs$SYqh<@U6?zoq#R~zgeA}O4v0sfH>!i7
z#a_L!J-NI!4*K>HD(Bcm#t_^rgl0P)5%5f(!G|77NF~DMAw~LjSS-Y}_{QYcc9J6V
z>W9yccGhfD9nNN!Mm9?e89-HUG`PH#riaSdx;u1a2i(+T&S5l>AaH7q#L<Qc_8Z6Z
z`aPU{!u~-V3C-Jc7hi_df#$thOpOPwKKxW&Sd+d<!l@ooIvenT#j%D7I*t8f;Gp+E
zz$+JR0WZfIYOkU$^n>#`v<W%b1h+o{pEKRe2G4NodF&}!C?YPJ|CG-QvD17ce`h0w
zWqNYL*BiO~m_5~|P>iVO0eDl-a-pMS4tR=QSQCn4;LFgE&Z(Z_L~bAS`Nr%6yCgUw
z&Z1NUMDcPX_k|Tx7EvDInd65d50j8U?)0S3oW%kmjh#S<4L!#=o{>Y=K$8Vt=BZuS
zYTgidiTneeJeZ9o7PV`h{37>-90{Ho5ugW0qJ$hc`{j-!7xP)EDkAZY34#fINdPL&
zQ^qdqRqx5epCC)In-p?uuS4#tah`P=qEREsVWR0*8@cc7sctLxSIeT5_3A(!E@kHu
zTgWwJb`O#mwdyTG6<f%|UwX;}Nk6ErpFEmX7RcCZq|VNLyPN_|+bZ~F)UnenpFh+o
znY<?S8_wrFR=Qm_E&UJ0Hz$7XBTXu$7;h9@PuQ31OJpwurv-oA;2Upw$=L2uhZ|)!
z{Fdsa8QXl=Q?XSdV=u8<mmR(9R%vgKM2rHhUDHs9H?M{5)=z(#{uaEM*J|kLjS%t5
zR!89Bemjvg)WN-;A1-jXCk+Rw(3qFN*R77gBXsY;x75R}3ih0S;aeSE#a{wnw>koE
z<G##osH-Ht0Px<Hs3I&ff~<u;Wo+EB_E`gCvvU+elCKGv2)F&RmB`=`r`2l9hHm^}
z+E{l(ttK6JF@bjfb{mW(@1y@jxiP~B;1#NDH_C{DQ?3@g1z)zx;1%lZO|dnPB+hNn
zYp8Ll{lZoBk?cZ;ThOh{55V(<!4F(t&9^I{*SZyHUQ+N|9a)=%64Y!maYId%T%tT;
z_p|fLo6O=vvuAAw`b`B7IPeP89Ca&@CdARzk!Re`aa&=*75*D)(t7(h=CdeIc7x}Q
zf$G6(_4y}h*1REZ>x29~I5SQ#`!z_;t1|0WZ1!|1wLTQ5U;gxQ)yu3j)B@CN>3zcL
z=Z9hR+HW;NM<m@(q-aYuVtq&(y(i$k<0_K~QNgh#aCg~?173_8|95x-PT+L1R{NwE
zS+&$EmI}2j_}$l0sxt|Ov(%+qY)91F`5)_FgL94g&x_(3oNLs79{lnn<ta|jsQ&@^
W#UTtb+;I;80000<MNUMnLSTZR^P1iO

literal 0
HcmV?d00001

diff --git a/img/euclid2.png b/img/euclid2.png
new file mode 100644
index 0000000000000000000000000000000000000000..c01e5fad3bc8d640fdfda6b1997539a28495c935
GIT binary patch
literal 2048
zcmV+b2><tqP)<h;3K|Lk000e1NJLTq00CYA001ut0{{R3ocvPw0000pP)t-s>FMbJ
z007+F+>(-#b#-;VzP^NnggQDpSXfxi&CO<JX0WiZ4h{|-9UUwzEJ;a8p`oEDl5fQT
z00)RkL_t(|0p(iRf~z15MFbUb`~R=KSpY$yr88Z;9UrP9Bybv&oS+czJKFwzy8fId
zz0B>OTlCu&tf%2^x_+TZY8t$aqofOCmHCCZcMX;E`Yu(!(z7;*@79Zn=WDjcmIO+r
z#^S@$px3l_&HrEoLbNMd?YxPN%~*&cyt0Qb!!;aU|6hf*7}EGUF+DZHt(@42Bv0Od
z^M&wEWVmzpelX7(5Ae!XUE*IqPLv{<woPY)FKet;U1qX|&APut#7^PWs}*YT-tD-?
z58hKGJHR_`!l0WK+U|!D*1>xTub04UCYY_gX0RjBVt?CgfUKFon%90m)P>>gG3jaN
z4_awi^%-8uy%vmP$#GfhH4O%Z;Sx?OK@4vS@Fs5`4Z1A68@YvxQsf)(roLB@*AR<3
z{X>s6=nzD+<LUxb{O`972r`W^=+&-v6yTj8|4MzY1C~L4coouiO!#!+@9`bBD&7*q
zYY^VC5v_rcaq?*o&-A$i&hTPlyDeue8wQUy^Wfa|+#>BvxXO}?l$Knm5UR$0V|Yb7
zLZM`_FmE$WXVo8Uv17AZ{Ml`)*PT^Fm5=jk2g@A#_@L^(Cly1nXaTP`$&odGU;?i&
zAXKv8eH~Sk`a~zWbBt8Iv^AEMjtO@JuPI{}GOMw|J*4mk9bo&>^`E*Vc)K#C4w;p%
zs5Q<7A7hIz$G2b&{9nr!VT1yvVoOAtP4EWhdae@8ZR<+S_p3&n>ShqTV)Brg=Fgk3
zY&i^OG(rNFhSJeNNvSBbVUWk;TqQ8gXyiifw+|+GNDX-`{H|pm6Z(AT#Q>?1q$q`N
zyXnE66us@3Fl!gsGgX2XZMLVpY7HLbkQ#c#)P4K*UBB&2J^-^l=`&=>85cgVt{#-B
z5|HcVh^21FC$lb@g5I~`SXhrjn?>t#BsyF~@aC!n<V84Q-GO(VZ}Yyw#J;0h&Yh)l
zW)@!dnVBj9`4bnh#$dg9-`h>WIoDx!hlke*$@Th0o|+R^(FTQiw|L~$V97%8HV0a-
z<j|I>5@>v)xTuK!nva6-wY2~0JC)9!W((rs;jYyEPJ1%m-_$YqSaSVNyxYT%2g5Z`
zJIl0$zM_$UF<(q*lN^(BRRVY-XSRlry&XjFw^gw%<>7&J?@}JR^3rHf5LU(DV?DQa
z;^Tgh9c67uFHnP@dkj8EqRE2kqQ}%>V8hH*3EFX68C`k5FfN;rT%>bK?<mX)$HP78
zPP;sC$I^I!7gojKd5C8`ROG2po2@@M*4t5v5ZE<dkOSNt+saf4yib7&&3)xd1+#-Z
z4__G1!vpEQFFoHQhBpYSVel-@RSe4?I^?yctv>2|{*XQu;+#_<1j*4?BnHKrLn;Yn
zdmbK0chcp7n;708tcJm}j@gBzTI<cu%w@Jd!9Dfaj%fOKCiJuw#w${It9bZMy1lA|
zm}AT_9s1HuwUk%OQNgY*AA!}o`(4-_hU10k6?WqZ;Kmx|*uMb{QW(HwgS~l7lki95
zkKq_dbp<Rea97B3*A^<A?u#`ynfP=J27Up)Pq85EJJ30Sw~B{Hq}xeKi8;iau9b4$
zIxRZPA2q&39Xqp~)$`a$*v{ac*yI$1&~7}#3w0RUDFzLIX)i(Zrr{ejJpd8YE5vs@
z53u)wW{!p74lL4jMcL+Lkcq}Sp9tnYu}H?#O#*Kf506MUi#rkX245S_Nib-`hhcCm
zXgWKq$0j%;VLOB8N9k`Q#5)C2gN{Z{s9}I0-6+w)HN{IxPU%mD0hV}zin^xaUv-zj
zOHL7Ie~X7lq?;#oBIdMyMKKvJH;x_(78tR5x1LCt4>sAAMnXbJBQ-eXtwA4z3Vrzi
zb1MbbE6G1XM>!1^yhqeEtLEvA3A{BtTtuXsW^*RyDZI+T3n#xv4vTk3B<v=<k&rXI
zs)2$nm262fi0)>g;ZtDIQih7HdT!9#_pW{huRSO5*6{F{bko$%#JnEfSlG_sGb=v8
zYcMAwHE6wE$gVuRrU8PfXTiZ8TY+nBVAFfojFJ~LCGghp@R)Sde9pu?g;(>|-+&4B
z&gyw7v9O)NXO<ZY0r3=+NDaaZVB!#foSN`@!9Qzuxf2dR&krA8?_IIi>yHH98Xk^x
zoJhCdtB;7en=UOf_+BxfFJPV?v3l<7g~1&$crVmR+E0-X{|$A3SBx0Juxb$CZ86%7
zt|Ex=VkAH+7P{`DUwM_lTgk(jbcenAotV=^al5>Q?<^-}_!5?6TdMszdQYsL7j<Ot
zLFj4CyO51O6(HG0O&G<*IAYZx+NhVf-JmI5z*cKlWw!w%Aa^~9e^EmW?*lxXW`hgE
zBO>P9aQuxn#sjN&eNGJC3q8t!4+O{sK)d@?Anp;W2ELI9EB#Q5l)?``b@fADagO2j
zu{%VHgTf;ZFCuXmS9R+d{8NQiX?|s=crWuo9)6qjJUD63;GZh=!8yF3dmEww2!D)+
z6B&Eblmdf)rqCzN?N?&@<dy#&5C8c@>KOdb<$r9XT=<)ak4@mq70a>VYSx#p^JB|1
e-xaNEaQp`w<~RTFF&obS0000<MNUMnLSTZ%?CXXA

literal 0
HcmV?d00001

diff --git a/img/euclid3.png b/img/euclid3.png
new file mode 100644
index 0000000000000000000000000000000000000000..4a2ee9fd0974cf058ab5a6e6a5a392e87fb9242e
GIT binary patch
literal 787
zcmV+u1MK{XP)<h;3K|Lk000e1NJLTq00651001Qj0{{R33XJK40000pP)t-s>FMbJ
z007+F+>(-#b#-;VzP?FGNwBc6EG#U|&CL!D4mvtI9UUE5SXiN<p=M@ggoK2UgHWdc
z00NsyL_t(o3DuYBlB^&Mg~MVaZt(t3I|;}ZEN8UlPI396pm_XDhj1ETu;!)=B$bwV
z0Fx{IL3*o6Ak)Wyo-?{x(~V)ynbj_cX@pH=BeSj_q*Pl%g@IYEP>8wj{{!n0e*KMr
zV;eZGN+6;Y)*j=tT4HqqR9ajw;wp{LRRx;C`Tb8%Oe5C;<&3to@k#F$>!#D=$Qo8a
z9>3`@jm!!bV<JmjUa$hJg_RQO4PWz2t5H~+Nmy#%>;*MzRsWdu&xftXzhkZH-_POL
z%vR$Y*2W`P%xLR1?r(=y!8%B%T`C-t_Og!arj-6B3mSEX8HTOKJ!|U`>><38ay$G4
zenzorMHnCVk6lZttF>i?vvN+blPN7-gI4{5wbg)IR_+l%konRJ#Z+K;w-D2rHV{o)
zG|XjfDVnt=v-Vj_OLIDPQfOMManH&<0tl)TI;=YE9#oTYj3Jh>Kvg*qQf<9kpiEts
z$fs(=H16Wsc?8C)PgXpc@D+8<3fuKo{6+Yz`oPtX5_w83YD^=siqhgdtXZ8$c)%*D
zx<(w*yU5pGJ-)acnZ|7nbRL1RPO;kWl&VW`JtYSwin-1f^CDk+^+FkYOyicd^9YO;
zc3LKKqyG|$GE**T-5|U?@5J}^$6mdg!!%M3bn|H6VjjUb@lm*x7Hwk}+-}rLs5lq9
zel3MSx#JV>bkgSqrhYMvY231MkI>6WlX;}EFy-2b$(mMk|I~SfIgpEatwv#G2JDp|
zxOm+!UaDCe6E`#~GjU_Hwgzl$*4BWH&Dt8Up;?&$8=93Fu%TI*0UMf?8L*LAxd9uI
z)uSD!J-s$y<Tm}CrT@i^^MRBjHy-{KRR*kFe4zA~Q<(w#%U3^tS8Kokz5rs{7Wnu6
R#@7G<002ovPDHLkV1mn*au@&r

literal 0
HcmV?d00001

diff --git a/img/euclid4.png b/img/euclid4.png
new file mode 100644
index 0000000000000000000000000000000000000000..204f22151b4a1edf22679198b5fc9a4afdbf2b55
GIT binary patch
literal 643
zcmV-}0(||6P)<h;3K|Lk000e1NJLTq003?P000yS0{{R3TRiw~0000pP)t-s>FMbJ
z006MCu!Mw!l9G}vEG$@9SREZ5&CSi++}w3_b-up7Nl8f#4h}jxI-#MVW@cu@&FD4&
z00Ik1L_t(Y4V_i%nuH(-^;&|ZzW>uMU?ooN*Ut855RV+;fMd-4t1$U;nwI}vWPQ;2
za4n0wOfoX+)t_u|euOv|br2Zi;&Mfr=wSFSz?%VX9d`t0I}z&q)<HheE#sbVENZ_D
zI+JWy1L6RjKK5w3q%Z^hYH7N#9`H6Yx_lpW-oJ)^0%*GBlp}8fg@ADRKIr0Ea0Xq0
zlf#rei%~I%8ydFS_cMCXbZZFM%egZ&Z_c2SZYridC<JtIr)qrwSgX&*bGdV&fL_vA
z5CB!HB-;{1;bWE3PM36toDy7Vm-kM01KCC!DA%=gewEB3iGxzHI9eqzs4(1Yq)g#`
zEuGHJ6^1>4EH^C5E}69#0i%K5^{SX6QxPO0wJG<DmhOS>4w~ukptDpa85~6?GObc)
zqN`FyE!{-d=im<dGaYdJeqGbh1ilzeT{`-TD>o(^`nB(%nJ#zf7t&>y;TqXxj(~mi
zN+l**HfuufRa$5|BhBytn(55KtpO`FO<<K^AFV<WWP{w?*`d)8MW@DDWoMS2^asc_
zy9I-B$J9;J78eRdqj+TbGFmgVy2%Ey@_wS)!KmMyT|J(J8;DQp4_uGQv69h$T6|Q#
zAk&}^iLJ9Ual9or;Fk`53Ld_Rt_~F*px?OMb8=IwP*<Hr`X=-P_SZko<3T--d@N7*
dx4)iM`2n*+4wF|8rL6z}002ovPDHLkV1niSBkuqJ

literal 0
HcmV?d00001

diff --git a/img/euclid5.png b/img/euclid5.png
new file mode 100644
index 0000000000000000000000000000000000000000..c7489fc14752744409a90878f8541cfaa70e8cec
GIT binary patch
literal 974
zcmV;<12O!GP)<h;3K|Lk000e1NJLTq004df001ut0{{R35-*PE0000pP)t-s>FMbJ
z005Gbk~%s%zP`RJEG!)z9S#l-SXfxx+}ue?NrZ%i&CShqb#<_?ux4gvp`oG0fJHI@
z00UM@L_t(o3B{P}mV_V(fYG!vFZKRUyWT}Dw`n?O`mtk5ehP@N0P&$yYW?7s@tIy>
z4{<f}RzF+TW-24|awe0<gpuVX_kP<D^VUvbcwSJ2CwW!v7th}%QQgPI7zhvQM6&zz
z(~hZkJH)|wI)6I%4fzv1;$ZxmO>$$}yCMx<P%RJ#<7Y~BZ>YPR3%MH4HUqkt9uQuU
zT?zg+zrw490T|?B2u~Lq1E&3A7f-t@{NxTHGCkhCH%TS^6p6pX6DohQk?Aqsn`D05
z{V@LUYDcC=c;Uvv`ta(%ZDTwob~bzJ)sbc`wr6fkzkc*FUOB{0fM)+Lc(9%)X6u=1
zdDHzc9_Vhg;zp*;Bjww%W3zONU-IzxjS3ISUTOkeY-sm>%=7g3)I39t&)u<s@p<e`
z{P-xH;SJJGUed$HKS${dpO3{uB>rsU_^oTdf5%h^?E?9)9<}iw(qWr(eEEq6<np2y
zKiGjGE|6V6O`gwQ(pH9^`QCY+Z`a5k1e~foNH0f9*##*9J}Kcm&$rR|$z?ChTox@%
ztQB<HKkupxfO6wkVP}2jC{w}bT0x|6a}x6}@_dy(Nm{!3i}5*;+oSqV@L9&DmT1GW
zH`A>JV0=#GSX6q0ALRKw*~`fku(BzFlFpciroLb7dXE<a(^6o3sTE?lt?`3AA6zQr
z9xs#E0_q@=3Nas&fpqp^lRci&yXmTh(8%>rtq}EE;YWEsi%Cu=1H@%t;RL%dGW(r#
zYh3L$%!})xT44*Otni~e-^5z9lL6u!MEhaeJc5=q2N6ygQa-8`bXXL|5A*zp?`0ai
zj(B3rCGWThk7|Vz{3y={6V6>Pb03dug}vYXD9^X5v?{hGnER<}fd<b)iMU$3FaB_s
z-Q!we3TLBMzMc9i&v%KwC$};U9#*$6UlRELn2DvhUaA$WKs-7aKg{!C4eM=d0ke~h
zg64}>p$YqH=;VV0wJkXn*H5*ATb^BleJcDg&p+ag)7AoE9{g9B9HEQ?d`r7;{X=7^
zG|n|~(1kZMGZ&iNL&NC^FWuh?e-tBjf**F6TqjPWO;vcvxAcdwP8?+pf)D;-)8zTh
wYd7uP4vDTTv6Clh%w5#~a_T*!{twF%e>^%Eyxd$z=>Px#07*qoM6N<$f?;*mIRF3v

literal 0
HcmV?d00001

diff --git a/img/euclid6.png b/img/euclid6.png
new file mode 100644
index 0000000000000000000000000000000000000000..5a7e0d720d8c82ba644b57757eaa7d42a1bb36eb
GIT binary patch
literal 850
zcmV-Y1FigtP)<h;3K|Lk000e1NJLTq005i-000yS0{{R3Plcq)0000pP)t-s>FMbJ
z006MCu!Mw!l9G}vEG$@9SREZ5&CSi++}w3_b-up7Nl8f#4h}jxI-#MVW@cu@&FD4&
z00P=cL_t(Y4W(Awf~z15jDSi&k^leNlM6zu_H4JyLmNXFCzFsC;JyyL``&qSe7EyA
zf40Y+5B;&YZoV<ld5y`5BKp&t=pWpd<LARM=m5BR=@_4oTbUK096~o)sE+fYflk3B
zykjM+-8%4pCI?W2+@ku$>2JkVFwNz}!g=I&`q=X^x!3^0I)J{hEV+(Vhg#kD8*<(&
zm1VTVH{4noUa;~e4h#t`zEzI)G6p7rDJ4xNCy$cs-1=e-Azcc~h=XQyDMrstbfh4D
ztf?Lv(7{^#z}h)9Zw``aIa^jN8I~p12uMt#L@fz1Ne@p77^fO>HtYoPWDXFI$p^&s
z@EJUJLM{~SMeYH1!(xr%PANIt(nh(Zl4P>S(#AsRCXsul3z2sP44h-3$hPi?6K^Jw
zVxqULqS{P#7+~$J!P=-^g<ob{&MGI>n<xdGS{YEs25-2ch|&_JJ&@~;$Ow=mg3Ln|
zPcxxPqnHa}uu_63`?lpQxx{*L#!m3*70s~Zq}Xe}6c313a;cG<ESTmA28+lYQZ(Cg
zmK?6$QQLJ+-4Jp*Nu=z`NZ#;(_%S()RTBhGgQi?;Wuqt4bKXUrv#`t9phn(%B~TT}
z{FTP2dqBLB%i7=z_0s^8yue~ngGYw06NGWw47sp4=VT{v#~?9OW9MH8>2UeNmE?`P
zT#5(8D>+#BupBX9<f288vOy+a_fTmJ%}#`oeXCraODSvNi9<YP-l<Xex-P1AsK>^o
zkGo#qS43B*EkK(06xD=ESkf&9Oy7NCF?sfI;jk4?B8GD9_sPpWLzR$&BgkK+qg{ft
z^uUVHx*@9De4^uQcy%y+l(S-nF`L?!d<}ARVPt7@*%-BFmei~kZam+cJg6VmAlD|@
zInZvg$CZt<`rm?o=Wx%$*`9M-aIV%DfyQet|GHpY_!04?rT-Kk4qtx6<NxKj#6Dns
c>+-C}KWax7E%CY@5C8xG07*qoM6N<$g1h;c!vFvP

literal 0
HcmV?d00001

diff --git a/img/euclid7.png b/img/euclid7.png
new file mode 100644
index 0000000000000000000000000000000000000000..7e16d4826e277b8c9a040ac4a7f29ac82c3e019d
GIT binary patch
literal 1002
zcmV<G0~P#<P)<h;3K|Lk000e1NJLTq007wl000yS0{{R3Hx_6v0000pP)t-s>FMbJ
z007+F+>(-#b#-;VzP^NnggQDpSXfxi&CO<JX0WiZ4h{|-9UUwzEJ;a8p`oEDl5fQT
z00VMKL_t(o38k0Yf~z15MKPcVsP+H9_T&N>aN1%|AEsPa_J#l*W4?ao@M*~0cAn7I
zKh-{iKh6Bo*J<iTLs}9y&93W_YUw|1)9qza)7DnXM8n`(YX=S2n)#*DY3g8*cD4j-
z*O9A`Ch_E&6&i7-!4>m&l&`HtCJ(HzR?`jQ+1dJT6T&1}3WuKg-I*~BxL`EoQCVm*
zrNCNEHylq1jcz^0?zt9qJ`Ou8;EK`gCuQxd!WvCC8c$i4TYGL;OPbCvHDuUX0auKI
zJSu8u6(*X%x*04v0Oy=+!0Z;_DMvX)II6w&c59vF<EA>avmx+>DSnzrA-ND1Iya}Y
z90#I{XC7N+=K2LAP2gv<t|0~kXd~=oZFK;S5BgLXuVh@ciH%{30S>mN-Kg>qSYiH*
z6wYa}0Q<SjW}%ZYdyKhAzFab8u7Z({HKIGd4QMZe$MtZWUkBbG^OomqxN0fi8Qf%P
zRXol$=A|-LIU52i%$rCP#c-S#6N=b*zYbdeOQuXU3PzeZ=_a%YQ{H5d`<yzGmr0(y
z*7HeioYJ1V9bck(;B}P_ffXhL`bZ?rI1YrxQ<BKx_9>Y%wb$fmr)WtMGjLEYC})Aa
z*7Hdq&f1-`;*GNru*R^wd!*Kx%g*pi$>gawO|UNsk6ImB3+zlT{gd;M&14AYugEa*
z?>!p<YYda`k;a{A7-?Ek$QiWpdBFp^@dZiFK$ghT7e0fbTuNr97AH>{9nJDl=WGP5
zF^srJYMsq;)>q2eOQuBEFw$h#loH=@mXaCJo)k9P3O>1L3X5?vHellNtw9~I(^ea!
zuT14^1Y9u%t0FPmnARCy+t@CVl}s7iX_^o3{qE_lKrQ^PNx{?QxXOOmi0{gg&~@14
zy0r0pi7_ZYMhLH*4T1$zu;z-yYEztE7T=rA1u2?{BKh=Wy)2W*;#{pM|H@hT@&VaA
zTof$uKN+XI9ELI$Bx`BW@KbUadD6gtFJ}+HJTqf;B*j%lNV1~XRAuJwMpL=i<UlDv
zE*`X*&8J8xjr4TZ&*khXxW`uHF9p(+U##+Q-7se#G3EQFj7)mVR5m^Y_t=8}>030V
zmrW_g+tw6h|G$p92x&<7|J$`^<{7xdmgqlyS54vbdgb4}Z(=O%k~D+=3;ZVDNHc5t
Y2SA}6*jO9G`2YX_07*qoM6N<$g7sbB3;+NC

literal 0
HcmV?d00001

diff --git a/img/euclid8.png b/img/euclid8.png
new file mode 100644
index 0000000000000000000000000000000000000000..fad67553ce5178686ddbde251b1f9b97e0e944aa
GIT binary patch
literal 1030
zcmV+h1o``kP)<h;3K|Lk000e1NJLTq006B3001rs0{{R3ZB=Op0000pP)t-s>FMbJ
z007O+&9Jbrb#-;2p`m7GW=Tm&l9H0#+}tcIEWW<J9UUE5SXeqbIt~sFgoK3s(WTb_
z00WLmL_t(o3C);oyF?%mhN;lV;{X5JGcz)X;jngBA6%u>BlB`6%br%i_V#I-bUk2m
zulGK#$K>X5nsh<F(fgj)^Ljl`6Dk7lU_)5ry?dT5gvw^F4yj&~mj>#m$u%7cwQG;^
z9d3AArZ4g1c3Yu<$)li(af{8iZGWsTS>A9|ojfY!q#jE{s+)&-TERBJ(pY2`29E=}
zKfKCt{}ET8qYO+0rdY}ebl*KK<Qh^{=9y2uADs-ERis$H(q1d16D|i|oY|MwncDWt
z$<Xo2qEe?c_)Pl1vK`#AJ+?+zDlS5ZLDYf`+@kwhF-5-9i%)^(o&rlw-3o2dH|`&(
zeW@=q!V=VPtbX><eYHlHBB8y!XbWeR()fL~{mKnw4GHZb26pNBV1?C!a}IZie9rV_
zh=ubUt_3^R#5BPYrS>lsQVS@`U}8a^>pehI^daln1}H32SrgL?mRhmxV5f2rYleBx
zUP&!|RMS#g$%%d(Z&r?59J*n;4Pu(XQYGe6wNp_d-&uXj@u(JZ$$xAYjuD8eHo{Os
zOf<s`mfV4`{HB7dqA1H6`6ag1ro==;XRvgnmS?`_vafasU@KxmQ=h?7DSP`ByY1NU
z$Ssn+g~7`<h-nT>Z1KEz->}=vlX(J3PSj>YaGDX5>EbD521^p=Sn-w1J~>Hhw`ERe
z4F9qo#SSf3ch1C)*WiB>F_|ugi3yhADvpj|lquvi_OHMR>~?r8BGk-?X*5!SC4cqI
z2e#qKG;%r*PW38JjcVnKx7#l&{X3PGCsWDkG&mKhI4g-Os<2nL7N2LeIys#Orxaf$
zkwmfDXWZG*sf*R><a7a?4h|Rn%2XyXQbQ&RKz^J>e!^OCJ+N8{DJydN2{>iY2F%o^
zG{R4qxgCIGFH^~B6P#oRK2~|5X>;<M_{lL8*XR{GIc<W|$3)7+{J|;l2tUE_2b?-|
zaykJ{veXR~M?^|#QTQoVW@<Oc={Mkn|1)}vrmLvc$Y~p#ZrHqoDSA65KH;a1kDj!*
zDmiU~)4@_VbR&k?A+-xX4V8{^k4jFrg46$BBh+{RYFdiSk)L9vrJ$ga(+%MCe~mIS
zrq-U1O~Ox9VN%q|X|x~wJ0_ETyfU7I#x#&FcuY=jfK$5IVLL|DF|e-2ACl8M;Ivxp
z@P@6twPmRi#Q{0J1x|<JHU^j#Xf6irlhX)Je^!qf{jsx+$^ZZW07*qoM6N<$g6DYW
Aga7~l

literal 0
HcmV?d00001


From 4a2a166ea729f3c692bf52e4bc16910fcac8d36f Mon Sep 17 00:00:00 2001
From: Nalin Bhardwaj <nalin.bhardwaj@icloud.com>
Date: Wed, 26 Oct 2016 04:55:04 +0530
Subject: [PATCH 6/8] Updated links

Updated image links to root
---
 src/algebra/euclid-algorithm.md | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/src/algebra/euclid-algorithm.md b/src/algebra/euclid-algorithm.md
index 198902b63..6ed136842 100644
--- a/src/algebra/euclid-algorithm.md
+++ b/src/algebra/euclid-algorithm.md
@@ -4,7 +4,7 @@
 
 Given two non-negative integers $a$ and $b$, we require the greater common divisor i.e. the largest number which is a divisor of $a$ and $b$ simultaneously. It's common denoted by $gcd$.
 
-![Euclid’s formula](http://e-maxx.ru/tex2png/cache/e49f97b41b2449d76d33517b580fef68.png)
+![Euclid’s formula](&imgroot&/euclid1.png)
 
 (here the symbol "$\mid$" denotes divisibility, i.e. “$k\mid a$” means “$k$ divides $a$”)
 
@@ -18,7 +18,7 @@ The algorithm was first described in Euclid's “**Elements**” (circa 300 BC).
 
 The algorithm is extremely simple and described by this formula:
 
-![image](http://e-maxx.ru/tex2png/cache/b8e1571eb429ef8ef1c06bc060dec3e7.png)
+![image](&imgroot&/euclid2.png)
 
 ## Implementation
 
@@ -63,23 +63,23 @@ Let $d = gcd(a, b)$. Then, by definition $d\mid a$ and $d\mid b$.
 
 New writing the remainder on dividing $a$ by $b$:
 
-![image](http://e-maxx.ru/tex2png/cache/ad604a58d5faf878aeaa5492d8f28d12.png)
+![image](&imgroot&/euclid3.png)
 
 But then, it follows:
 
-![image](http://e-maxx.ru/tex2png/cache/85feaf22c5f69e1d19617467cdab7a04.png)
+![image](&imgroot&/euclid4.png)
 
 So, remembering the statement $d\mid b$, we obtain the system:
 
-![image](http://e-maxx.ru/tex2png/cache/9d785ea6dd075edc4a1849cf44affb22.png)
+![image](&imgroot&/euclid5.png)
 
 We now use the following fact: if for any three numbers $p$, $q$, and $r$, if $p\mid q$ and $p\mid r$ then $p\mid gcd(q, r)$, In our case, we get:
 
-![image](http://e-maxx.ru/tex2png/cache/9318355a27d52014ebd91c204579fb3c.png)
+![image](&imgroot&/euclid6.png)
 
 Or, by substituting $d$ by it's definition($gcd(a, b)$) we get:
 
-![image](http://e-maxx.ru/tex2png/cache/256b72e6f755e9181250d20bf15cc4b7.png)
+![image](&imgroot&/euclid7.png)
 
 So, we have shown that the left side divides the right. The second half of the proof is similar.
 
@@ -97,7 +97,7 @@ Given that Fibonacci numbers grow exponentially(as a constant with respect to $n
 
 Calculating least common multiple (least common multiplier, lcm) is reduced to calculating $gcd$ with the following simple statement:
 
-![image](http://e-maxx.ru/tex2png/cache/1407548584803d912291dc28ee8f40ec.png)
+![image](&imgroot&/euclid8.png)
 
 Thus, the calculation of the LCM can also be done using the euclidean algorithm with the same time complexity
 

From 379ca99533d484a7a39506f5ce9c46d58c646b12 Mon Sep 17 00:00:00 2001
From: Nalin Bhardwaj <nalin.bhardwaj@icloud.com>
Date: Wed, 26 Oct 2016 05:10:39 +0530
Subject: [PATCH 7/8] Added problem and link to home

Added basic problem and updated link in index.
---
 src/algebra/euclid-algorithm.md | 4 ++++
 src/index.md                    | 5 +----
 2 files changed, 5 insertions(+), 4 deletions(-)

diff --git a/src/algebra/euclid-algorithm.md b/src/algebra/euclid-algorithm.md
index 6ed136842..a0ca5ab74 100644
--- a/src/algebra/euclid-algorithm.md
+++ b/src/algebra/euclid-algorithm.md
@@ -112,4 +112,8 @@ int lcm (int a, int b) {
 
 - Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein. Algorithms: Construction and analysis [2005]
 
+## Problems
+
+- [GCD and LCM[easy]](https://www.codechef.com/problems/FLOW016)
+
 ####Note: Translated by [NibNalin](http://codeforces.com/profile/NibNalin)
\ No newline at end of file
diff --git a/src/index.md b/src/index.md
index 2e4fc8195..31c55b78a 100644
--- a/src/index.md
+++ b/src/index.md
@@ -9,6 +9,7 @@ especially popular in field of competitive programming.*
 
 ### Algebra
 - [Euler's Totient Function](./algebra/phi-function.html)
+- [Euclidean algorithm for finding the GCD(greatest common divisor)](./algebra/euclid-algorithm.html)
 - [Sieve of Eratosthenes](./algebra/sieve-of-eratosthenes.html)
 - [Binary Exponentiation](./algebra/binary-exp.html)
 - [Balanced Ternary](./algebra/balanced-ternary.html)
@@ -53,8 +54,6 @@ especially popular in field of competitive programming.*
 - [Kirchhoff theorem](./graph/kirchhoff-theorem.html)
 - [Topological sorting](./graph/topological-sort.html)
 - [Searching for bridges in O(N+M)](./graph/bridge-searching.html)
-<<<<<<< HEAD
-=======
 - [Finding a negative cycle in the graph](./graph/finding-negative-cycle-in-graph.html)
 - [Floyd-Warshall - all shortest paths](./graph/all-pair-shortest-path-floyd-warshall.html)
 - [Dijkstra - shortests paths from given vertex](./graph/dijkstra.html)
@@ -68,9 +67,7 @@ especially popular in field of competitive programming.*
 ### Sequences
 - [RMQ task (Range Minimum Query - the smallest element in an interval)](./sequences/rmq.html)
 - [K-th order statistic in O(N)](./sequences/k-th.html)
->>>>>>> e-maxx-eng/master
 
 ---
 
 [Information for contributors](./contrib.html) and [Test-Your-Page form](./test.php)
-

From e0413265295640ac863887ec5d630c359d91b0ea Mon Sep 17 00:00:00 2001
From: Nalin Bhardwaj <nalin.bhardwaj@icloud.com>
Date: Wed, 11 Jan 2017 11:52:58 +0530
Subject: [PATCH 8/8] Fixed issues

---
 img/euclid1.png                 | Bin 1364 -> 0 bytes
 img/euclid2.png                 | Bin 2048 -> 0 bytes
 img/euclid3.png                 | Bin 787 -> 0 bytes
 img/euclid4.png                 | Bin 643 -> 0 bytes
 img/euclid5.png                 | Bin 974 -> 0 bytes
 img/euclid6.png                 | Bin 850 -> 0 bytes
 img/euclid7.png                 | Bin 1002 -> 0 bytes
 img/euclid8.png                 | Bin 1030 -> 0 bytes
 src/algebra/euclid-algorithm.md |  54 +++++++++++++++++++-------------
 9 files changed, 33 insertions(+), 21 deletions(-)
 delete mode 100644 img/euclid1.png
 delete mode 100644 img/euclid2.png
 delete mode 100644 img/euclid3.png
 delete mode 100644 img/euclid4.png
 delete mode 100644 img/euclid5.png
 delete mode 100644 img/euclid6.png
 delete mode 100644 img/euclid7.png
 delete mode 100644 img/euclid8.png

diff --git a/img/euclid1.png b/img/euclid1.png
deleted file mode 100644
index 4902f1959f2a6acfccb0388d63bec2945921925c..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 1364
zcmV-a1*`grP)<h;3K|Lk000e1NJLTq008^|001Ef0{{R3%GEZc0000pP)t-s>FMbJ
z007+F+>(-#b#-;VzP^NnggQDpSXfxi&CO<JX0WiZ4h{|-9UUwzEJ;a8p`oEDl5fQT
z00i7gL_t(&1=U#DwyPivMdrcj|G)O`1W>Ws)(&@_@}LL-vNIBec-Tz1OJeTM{^q1i
zHZkW$9|NcavpSyt!=sh;Qx;_!7`5~#Br<gww*EQYFRY(H!?0uUKI{L0EOgl)<ajXo
zw}&e0=Ug)QaE?q3Wo`U9!(UiGMbF@^J)QT}A<T42^G7EZ)`e8sNJSu});ep^Xe$}~
zSREQvvV}4zrL*DpyP1~mm9LO=2$rJBtQGHW!5ei<N^nFx?&qNUhYmoQ5j!Ki4>1S{
zq=CkT*HUT@cwO1WOiAcP5;PdP805$-xFs$SYqh<@U6?zoq#R~zgeA}O4v0sfH>!i7
z#a_L!J-NI!4*K>HD(Bcm#t_^rgl0P)5%5f(!G|77NF~DMAw~LjSS-Y}_{QYcc9J6V
z>W9yccGhfD9nNN!Mm9?e89-HUG`PH#riaSdx;u1a2i(+T&S5l>AaH7q#L<Qc_8Z6Z
z`aPU{!u~-V3C-Jc7hi_df#$thOpOPwKKxW&Sd+d<!l@ooIvenT#j%D7I*t8f;Gp+E
zz$+JR0WZfIYOkU$^n>#`v<W%b1h+o{pEKRe2G4NodF&}!C?YPJ|CG-QvD17ce`h0w
zWqNYL*BiO~m_5~|P>iVO0eDl-a-pMS4tR=QSQCn4;LFgE&Z(Z_L~bAS`Nr%6yCgUw
z&Z1NUMDcPX_k|Tx7EvDInd65d50j8U?)0S3oW%kmjh#S<4L!#=o{>Y=K$8Vt=BZuS
zYTgidiTneeJeZ9o7PV`h{37>-90{Ho5ugW0qJ$hc`{j-!7xP)EDkAZY34#fINdPL&
zQ^qdqRqx5epCC)In-p?uuS4#tah`P=qEREsVWR0*8@cc7sctLxSIeT5_3A(!E@kHu
zTgWwJb`O#mwdyTG6<f%|UwX;}Nk6ErpFEmX7RcCZq|VNLyPN_|+bZ~F)UnenpFh+o
znY<?S8_wrFR=Qm_E&UJ0Hz$7XBTXu$7;h9@PuQ31OJpwurv-oA;2Upw$=L2uhZ|)!
z{Fdsa8QXl=Q?XSdV=u8<mmR(9R%vgKM2rHhUDHs9H?M{5)=z(#{uaEM*J|kLjS%t5
zR!89Bemjvg)WN-;A1-jXCk+Rw(3qFN*R77gBXsY;x75R}3ih0S;aeSE#a{wnw>koE
z<G##osH-Ht0Px<Hs3I&ff~<u;Wo+EB_E`gCvvU+elCKGv2)F&RmB`=`r`2l9hHm^}
z+E{l(ttK6JF@bjfb{mW(@1y@jxiP~B;1#NDH_C{DQ?3@g1z)zx;1%lZO|dnPB+hNn
zYp8Ll{lZoBk?cZ;ThOh{55V(<!4F(t&9^I{*SZyHUQ+N|9a)=%64Y!maYId%T%tT;
z_p|fLo6O=vvuAAw`b`B7IPeP89Ca&@CdARzk!Re`aa&=*75*D)(t7(h=CdeIc7x}Q
zf$G6(_4y}h*1REZ>x29~I5SQ#`!z_;t1|0WZ1!|1wLTQ5U;gxQ)yu3j)B@CN>3zcL
z=Z9hR+HW;NM<m@(q-aYuVtq&(y(i$k<0_K~QNgh#aCg~?173_8|95x-PT+L1R{NwE
zS+&$EmI}2j_}$l0sxt|Ov(%+qY)91F`5)_FgL94g&x_(3oNLs79{lnn<ta|jsQ&@^
W#UTtb+;I;80000<MNUMnLSTZR^P1iO

diff --git a/img/euclid2.png b/img/euclid2.png
deleted file mode 100644
index c01e5fad3bc8d640fdfda6b1997539a28495c935..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 2048
zcmV+b2><tqP)<h;3K|Lk000e1NJLTq00CYA001ut0{{R3ocvPw0000pP)t-s>FMbJ
z007+F+>(-#b#-;VzP^NnggQDpSXfxi&CO<JX0WiZ4h{|-9UUwzEJ;a8p`oEDl5fQT
z00)RkL_t(|0p(iRf~z15MFbUb`~R=KSpY$yr88Z;9UrP9Bybv&oS+czJKFwzy8fId
zz0B>OTlCu&tf%2^x_+TZY8t$aqofOCmHCCZcMX;E`Yu(!(z7;*@79Zn=WDjcmIO+r
z#^S@$px3l_&HrEoLbNMd?YxPN%~*&cyt0Qb!!;aU|6hf*7}EGUF+DZHt(@42Bv0Od
z^M&wEWVmzpelX7(5Ae!XUE*IqPLv{<woPY)FKet;U1qX|&APut#7^PWs}*YT-tD-?
z58hKGJHR_`!l0WK+U|!D*1>xTub04UCYY_gX0RjBVt?CgfUKFon%90m)P>>gG3jaN
z4_awi^%-8uy%vmP$#GfhH4O%Z;Sx?OK@4vS@Fs5`4Z1A68@YvxQsf)(roLB@*AR<3
z{X>s6=nzD+<LUxb{O`972r`W^=+&-v6yTj8|4MzY1C~L4coouiO!#!+@9`bBD&7*q
zYY^VC5v_rcaq?*o&-A$i&hTPlyDeue8wQUy^Wfa|+#>BvxXO}?l$Knm5UR$0V|Yb7
zLZM`_FmE$WXVo8Uv17AZ{Ml`)*PT^Fm5=jk2g@A#_@L^(Cly1nXaTP`$&odGU;?i&
zAXKv8eH~Sk`a~zWbBt8Iv^AEMjtO@JuPI{}GOMw|J*4mk9bo&>^`E*Vc)K#C4w;p%
zs5Q<7A7hIz$G2b&{9nr!VT1yvVoOAtP4EWhdae@8ZR<+S_p3&n>ShqTV)Brg=Fgk3
zY&i^OG(rNFhSJeNNvSBbVUWk;TqQ8gXyiifw+|+GNDX-`{H|pm6Z(AT#Q>?1q$q`N
zyXnE66us@3Fl!gsGgX2XZMLVpY7HLbkQ#c#)P4K*UBB&2J^-^l=`&=>85cgVt{#-B
z5|HcVh^21FC$lb@g5I~`SXhrjn?>t#BsyF~@aC!n<V84Q-GO(VZ}Yyw#J;0h&Yh)l
zW)@!dnVBj9`4bnh#$dg9-`h>WIoDx!hlke*$@Th0o|+R^(FTQiw|L~$V97%8HV0a-
z<j|I>5@>v)xTuK!nva6-wY2~0JC)9!W((rs;jYyEPJ1%m-_$YqSaSVNyxYT%2g5Z`
zJIl0$zM_$UF<(q*lN^(BRRVY-XSRlry&XjFw^gw%<>7&J?@}JR^3rHf5LU(DV?DQa
z;^Tgh9c67uFHnP@dkj8EqRE2kqQ}%>V8hH*3EFX68C`k5FfN;rT%>bK?<mX)$HP78
zPP;sC$I^I!7gojKd5C8`ROG2po2@@M*4t5v5ZE<dkOSNt+saf4yib7&&3)xd1+#-Z
z4__G1!vpEQFFoHQhBpYSVel-@RSe4?I^?yctv>2|{*XQu;+#_<1j*4?BnHKrLn;Yn
zdmbK0chcp7n;708tcJm}j@gBzTI<cu%w@Jd!9Dfaj%fOKCiJuw#w${It9bZMy1lA|
zm}AT_9s1HuwUk%OQNgY*AA!}o`(4-_hU10k6?WqZ;Kmx|*uMb{QW(HwgS~l7lki95
zkKq_dbp<Rea97B3*A^<A?u#`ynfP=J27Up)Pq85EJJ30Sw~B{Hq}xeKi8;iau9b4$
zIxRZPA2q&39Xqp~)$`a$*v{ac*yI$1&~7}#3w0RUDFzLIX)i(Zrr{ejJpd8YE5vs@
z53u)wW{!p74lL4jMcL+Lkcq}Sp9tnYu}H?#O#*Kf506MUi#rkX245S_Nib-`hhcCm
zXgWKq$0j%;VLOB8N9k`Q#5)C2gN{Z{s9}I0-6+w)HN{IxPU%mD0hV}zin^xaUv-zj
zOHL7Ie~X7lq?;#oBIdMyMKKvJH;x_(78tR5x1LCt4>sAAMnXbJBQ-eXtwA4z3Vrzi
zb1MbbE6G1XM>!1^yhqeEtLEvA3A{BtTtuXsW^*RyDZI+T3n#xv4vTk3B<v=<k&rXI
zs)2$nm262fi0)>g;ZtDIQih7HdT!9#_pW{huRSO5*6{F{bko$%#JnEfSlG_sGb=v8
zYcMAwHE6wE$gVuRrU8PfXTiZ8TY+nBVAFfojFJ~LCGghp@R)Sde9pu?g;(>|-+&4B
z&gyw7v9O)NXO<ZY0r3=+NDaaZVB!#foSN`@!9Qzuxf2dR&krA8?_IIi>yHH98Xk^x
zoJhCdtB;7en=UOf_+BxfFJPV?v3l<7g~1&$crVmR+E0-X{|$A3SBx0Juxb$CZ86%7
zt|Ex=VkAH+7P{`DUwM_lTgk(jbcenAotV=^al5>Q?<^-}_!5?6TdMszdQYsL7j<Ot
zLFj4CyO51O6(HG0O&G<*IAYZx+NhVf-JmI5z*cKlWw!w%Aa^~9e^EmW?*lxXW`hgE
zBO>P9aQuxn#sjN&eNGJC3q8t!4+O{sK)d@?Anp;W2ELI9EB#Q5l)?``b@fADagO2j
zu{%VHgTf;ZFCuXmS9R+d{8NQiX?|s=crWuo9)6qjJUD63;GZh=!8yF3dmEww2!D)+
z6B&Eblmdf)rqCzN?N?&@<dy#&5C8c@>KOdb<$r9XT=<)ak4@mq70a>VYSx#p^JB|1
e-xaNEaQp`w<~RTFF&obS0000<MNUMnLSTZ%?CXXA

diff --git a/img/euclid3.png b/img/euclid3.png
deleted file mode 100644
index 4a2ee9fd0974cf058ab5a6e6a5a392e87fb9242e..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 787
zcmV+u1MK{XP)<h;3K|Lk000e1NJLTq00651001Qj0{{R33XJK40000pP)t-s>FMbJ
z007+F+>(-#b#-;VzP?FGNwBc6EG#U|&CL!D4mvtI9UUE5SXiN<p=M@ggoK2UgHWdc
z00NsyL_t(o3DuYBlB^&Mg~MVaZt(t3I|;}ZEN8UlPI396pm_XDhj1ETu;!)=B$bwV
z0Fx{IL3*o6Ak)Wyo-?{x(~V)ynbj_cX@pH=BeSj_q*Pl%g@IYEP>8wj{{!n0e*KMr
zV;eZGN+6;Y)*j=tT4HqqR9ajw;wp{LRRx;C`Tb8%Oe5C;<&3to@k#F$>!#D=$Qo8a
z9>3`@jm!!bV<JmjUa$hJg_RQO4PWz2t5H~+Nmy#%>;*MzRsWdu&xftXzhkZH-_POL
z%vR$Y*2W`P%xLR1?r(=y!8%B%T`C-t_Og!arj-6B3mSEX8HTOKJ!|U`>><38ay$G4
zenzorMHnCVk6lZttF>i?vvN+blPN7-gI4{5wbg)IR_+l%konRJ#Z+K;w-D2rHV{o)
zG|XjfDVnt=v-Vj_OLIDPQfOMManH&<0tl)TI;=YE9#oTYj3Jh>Kvg*qQf<9kpiEts
z$fs(=H16Wsc?8C)PgXpc@D+8<3fuKo{6+Yz`oPtX5_w83YD^=siqhgdtXZ8$c)%*D
zx<(w*yU5pGJ-)acnZ|7nbRL1RPO;kWl&VW`JtYSwin-1f^CDk+^+FkYOyicd^9YO;
zc3LKKqyG|$GE**T-5|U?@5J}^$6mdg!!%M3bn|H6VjjUb@lm*x7Hwk}+-}rLs5lq9
zel3MSx#JV>bkgSqrhYMvY231MkI>6WlX;}EFy-2b$(mMk|I~SfIgpEatwv#G2JDp|
zxOm+!UaDCe6E`#~GjU_Hwgzl$*4BWH&Dt8Up;?&$8=93Fu%TI*0UMf?8L*LAxd9uI
z)uSD!J-s$y<Tm}CrT@i^^MRBjHy-{KRR*kFe4zA~Q<(w#%U3^tS8Kokz5rs{7Wnu6
R#@7G<002ovPDHLkV1mn*au@&r

diff --git a/img/euclid4.png b/img/euclid4.png
deleted file mode 100644
index 204f22151b4a1edf22679198b5fc9a4afdbf2b55..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 643
zcmV-}0(||6P)<h;3K|Lk000e1NJLTq003?P000yS0{{R3TRiw~0000pP)t-s>FMbJ
z006MCu!Mw!l9G}vEG$@9SREZ5&CSi++}w3_b-up7Nl8f#4h}jxI-#MVW@cu@&FD4&
z00Ik1L_t(Y4V_i%nuH(-^;&|ZzW>uMU?ooN*Ut855RV+;fMd-4t1$U;nwI}vWPQ;2
za4n0wOfoX+)t_u|euOv|br2Zi;&Mfr=wSFSz?%VX9d`t0I}z&q)<HheE#sbVENZ_D
zI+JWy1L6RjKK5w3q%Z^hYH7N#9`H6Yx_lpW-oJ)^0%*GBlp}8fg@ADRKIr0Ea0Xq0
zlf#rei%~I%8ydFS_cMCXbZZFM%egZ&Z_c2SZYridC<JtIr)qrwSgX&*bGdV&fL_vA
z5CB!HB-;{1;bWE3PM36toDy7Vm-kM01KCC!DA%=gewEB3iGxzHI9eqzs4(1Yq)g#`
zEuGHJ6^1>4EH^C5E}69#0i%K5^{SX6QxPO0wJG<DmhOS>4w~ukptDpa85~6?GObc)
zqN`FyE!{-d=im<dGaYdJeqGbh1ilzeT{`-TD>o(^`nB(%nJ#zf7t&>y;TqXxj(~mi
zN+l**HfuufRa$5|BhBytn(55KtpO`FO<<K^AFV<WWP{w?*`d)8MW@DDWoMS2^asc_
zy9I-B$J9;J78eRdqj+TbGFmgVy2%Ey@_wS)!KmMyT|J(J8;DQp4_uGQv69h$T6|Q#
zAk&}^iLJ9Ual9or;Fk`53Ld_Rt_~F*px?OMb8=IwP*<Hr`X=-P_SZko<3T--d@N7*
dx4)iM`2n*+4wF|8rL6z}002ovPDHLkV1niSBkuqJ

diff --git a/img/euclid5.png b/img/euclid5.png
deleted file mode 100644
index c7489fc14752744409a90878f8541cfaa70e8cec..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 974
zcmV;<12O!GP)<h;3K|Lk000e1NJLTq004df001ut0{{R35-*PE0000pP)t-s>FMbJ
z005Gbk~%s%zP`RJEG!)z9S#l-SXfxx+}ue?NrZ%i&CShqb#<_?ux4gvp`oG0fJHI@
z00UM@L_t(o3B{P}mV_V(fYG!vFZKRUyWT}Dw`n?O`mtk5ehP@N0P&$yYW?7s@tIy>
z4{<f}RzF+TW-24|awe0<gpuVX_kP<D^VUvbcwSJ2CwW!v7th}%QQgPI7zhvQM6&zz
z(~hZkJH)|wI)6I%4fzv1;$ZxmO>$$}yCMx<P%RJ#<7Y~BZ>YPR3%MH4HUqkt9uQuU
zT?zg+zrw490T|?B2u~Lq1E&3A7f-t@{NxTHGCkhCH%TS^6p6pX6DohQk?Aqsn`D05
z{V@LUYDcC=c;Uvv`ta(%ZDTwob~bzJ)sbc`wr6fkzkc*FUOB{0fM)+Lc(9%)X6u=1
zdDHzc9_Vhg;zp*;Bjww%W3zONU-IzxjS3ISUTOkeY-sm>%=7g3)I39t&)u<s@p<e`
z{P-xH;SJJGUed$HKS${dpO3{uB>rsU_^oTdf5%h^?E?9)9<}iw(qWr(eEEq6<np2y
zKiGjGE|6V6O`gwQ(pH9^`QCY+Z`a5k1e~foNH0f9*##*9J}Kcm&$rR|$z?ChTox@%
ztQB<HKkupxfO6wkVP}2jC{w}bT0x|6a}x6}@_dy(Nm{!3i}5*;+oSqV@L9&DmT1GW
zH`A>JV0=#GSX6q0ALRKw*~`fku(BzFlFpciroLb7dXE<a(^6o3sTE?lt?`3AA6zQr
z9xs#E0_q@=3Nas&fpqp^lRci&yXmTh(8%>rtq}EE;YWEsi%Cu=1H@%t;RL%dGW(r#
zYh3L$%!})xT44*Otni~e-^5z9lL6u!MEhaeJc5=q2N6ygQa-8`bXXL|5A*zp?`0ai
zj(B3rCGWThk7|Vz{3y={6V6>Pb03dug}vYXD9^X5v?{hGnER<}fd<b)iMU$3FaB_s
z-Q!we3TLBMzMc9i&v%KwC$};U9#*$6UlRELn2DvhUaA$WKs-7aKg{!C4eM=d0ke~h
zg64}>p$YqH=;VV0wJkXn*H5*ATb^BleJcDg&p+ag)7AoE9{g9B9HEQ?d`r7;{X=7^
zG|n|~(1kZMGZ&iNL&NC^FWuh?e-tBjf**F6TqjPWO;vcvxAcdwP8?+pf)D;-)8zTh
wYd7uP4vDTTv6Clh%w5#~a_T*!{twF%e>^%Eyxd$z=>Px#07*qoM6N<$f?;*mIRF3v

diff --git a/img/euclid6.png b/img/euclid6.png
deleted file mode 100644
index 5a7e0d720d8c82ba644b57757eaa7d42a1bb36eb..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 850
zcmV-Y1FigtP)<h;3K|Lk000e1NJLTq005i-000yS0{{R3Plcq)0000pP)t-s>FMbJ
z006MCu!Mw!l9G}vEG$@9SREZ5&CSi++}w3_b-up7Nl8f#4h}jxI-#MVW@cu@&FD4&
z00P=cL_t(Y4W(Awf~z15jDSi&k^leNlM6zu_H4JyLmNXFCzFsC;JyyL``&qSe7EyA
zf40Y+5B;&YZoV<ld5y`5BKp&t=pWpd<LARM=m5BR=@_4oTbUK096~o)sE+fYflk3B
zykjM+-8%4pCI?W2+@ku$>2JkVFwNz}!g=I&`q=X^x!3^0I)J{hEV+(Vhg#kD8*<(&
zm1VTVH{4noUa;~e4h#t`zEzI)G6p7rDJ4xNCy$cs-1=e-Azcc~h=XQyDMrstbfh4D
ztf?Lv(7{^#z}h)9Zw``aIa^jN8I~p12uMt#L@fz1Ne@p77^fO>HtYoPWDXFI$p^&s
z@EJUJLM{~SMeYH1!(xr%PANIt(nh(Zl4P>S(#AsRCXsul3z2sP44h-3$hPi?6K^Jw
zVxqULqS{P#7+~$J!P=-^g<ob{&MGI>n<xdGS{YEs25-2ch|&_JJ&@~;$Ow=mg3Ln|
zPcxxPqnHa}uu_63`?lpQxx{*L#!m3*70s~Zq}Xe}6c313a;cG<ESTmA28+lYQZ(Cg
zmK?6$QQLJ+-4Jp*Nu=z`NZ#;(_%S()RTBhGgQi?;Wuqt4bKXUrv#`t9phn(%B~TT}
z{FTP2dqBLB%i7=z_0s^8yue~ngGYw06NGWw47sp4=VT{v#~?9OW9MH8>2UeNmE?`P
zT#5(8D>+#BupBX9<f288vOy+a_fTmJ%}#`oeXCraODSvNi9<YP-l<Xex-P1AsK>^o
zkGo#qS43B*EkK(06xD=ESkf&9Oy7NCF?sfI;jk4?B8GD9_sPpWLzR$&BgkK+qg{ft
z^uUVHx*@9De4^uQcy%y+l(S-nF`L?!d<}ARVPt7@*%-BFmei~kZam+cJg6VmAlD|@
zInZvg$CZt<`rm?o=Wx%$*`9M-aIV%DfyQet|GHpY_!04?rT-Kk4qtx6<NxKj#6Dns
c>+-C}KWax7E%CY@5C8xG07*qoM6N<$g1h;c!vFvP

diff --git a/img/euclid7.png b/img/euclid7.png
deleted file mode 100644
index 7e16d4826e277b8c9a040ac4a7f29ac82c3e019d..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 1002
zcmV<G0~P#<P)<h;3K|Lk000e1NJLTq007wl000yS0{{R3Hx_6v0000pP)t-s>FMbJ
z007+F+>(-#b#-;VzP^NnggQDpSXfxi&CO<JX0WiZ4h{|-9UUwzEJ;a8p`oEDl5fQT
z00VMKL_t(o38k0Yf~z15MKPcVsP+H9_T&N>aN1%|AEsPa_J#l*W4?ao@M*~0cAn7I
zKh-{iKh6Bo*J<iTLs}9y&93W_YUw|1)9qza)7DnXM8n`(YX=S2n)#*DY3g8*cD4j-
z*O9A`Ch_E&6&i7-!4>m&l&`HtCJ(HzR?`jQ+1dJT6T&1}3WuKg-I*~BxL`EoQCVm*
zrNCNEHylq1jcz^0?zt9qJ`Ou8;EK`gCuQxd!WvCC8c$i4TYGL;OPbCvHDuUX0auKI
zJSu8u6(*X%x*04v0Oy=+!0Z;_DMvX)II6w&c59vF<EA>avmx+>DSnzrA-ND1Iya}Y
z90#I{XC7N+=K2LAP2gv<t|0~kXd~=oZFK;S5BgLXuVh@ciH%{30S>mN-Kg>qSYiH*
z6wYa}0Q<SjW}%ZYdyKhAzFab8u7Z({HKIGd4QMZe$MtZWUkBbG^OomqxN0fi8Qf%P
zRXol$=A|-LIU52i%$rCP#c-S#6N=b*zYbdeOQuXU3PzeZ=_a%YQ{H5d`<yzGmr0(y
z*7HeioYJ1V9bck(;B}P_ffXhL`bZ?rI1YrxQ<BKx_9>Y%wb$fmr)WtMGjLEYC})Aa
z*7Hdq&f1-`;*GNru*R^wd!*Kx%g*pi$>gawO|UNsk6ImB3+zlT{gd;M&14AYugEa*
z?>!p<YYda`k;a{A7-?Ek$QiWpdBFp^@dZiFK$ghT7e0fbTuNr97AH>{9nJDl=WGP5
zF^srJYMsq;)>q2eOQuBEFw$h#loH=@mXaCJo)k9P3O>1L3X5?vHellNtw9~I(^ea!
zuT14^1Y9u%t0FPmnARCy+t@CVl}s7iX_^o3{qE_lKrQ^PNx{?QxXOOmi0{gg&~@14
zy0r0pi7_ZYMhLH*4T1$zu;z-yYEztE7T=rA1u2?{BKh=Wy)2W*;#{pM|H@hT@&VaA
zTof$uKN+XI9ELI$Bx`BW@KbUadD6gtFJ}+HJTqf;B*j%lNV1~XRAuJwMpL=i<UlDv
zE*`X*&8J8xjr4TZ&*khXxW`uHF9p(+U##+Q-7se#G3EQFj7)mVR5m^Y_t=8}>030V
zmrW_g+tw6h|G$p92x&<7|J$`^<{7xdmgqlyS54vbdgb4}Z(=O%k~D+=3;ZVDNHc5t
Y2SA}6*jO9G`2YX_07*qoM6N<$g7sbB3;+NC

diff --git a/img/euclid8.png b/img/euclid8.png
deleted file mode 100644
index fad67553ce5178686ddbde251b1f9b97e0e944aa..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 1030
zcmV+h1o``kP)<h;3K|Lk000e1NJLTq006B3001rs0{{R3ZB=Op0000pP)t-s>FMbJ
z007O+&9Jbrb#-;2p`m7GW=Tm&l9H0#+}tcIEWW<J9UUE5SXeqbIt~sFgoK3s(WTb_
z00WLmL_t(o3C);oyF?%mhN;lV;{X5JGcz)X;jngBA6%u>BlB`6%br%i_V#I-bUk2m
zulGK#$K>X5nsh<F(fgj)^Ljl`6Dk7lU_)5ry?dT5gvw^F4yj&~mj>#m$u%7cwQG;^
z9d3AArZ4g1c3Yu<$)li(af{8iZGWsTS>A9|ojfY!q#jE{s+)&-TERBJ(pY2`29E=}
zKfKCt{}ET8qYO+0rdY}ebl*KK<Qh^{=9y2uADs-ERis$H(q1d16D|i|oY|MwncDWt
z$<Xo2qEe?c_)Pl1vK`#AJ+?+zDlS5ZLDYf`+@kwhF-5-9i%)^(o&rlw-3o2dH|`&(
zeW@=q!V=VPtbX><eYHlHBB8y!XbWeR()fL~{mKnw4GHZb26pNBV1?C!a}IZie9rV_
zh=ubUt_3^R#5BPYrS>lsQVS@`U}8a^>pehI^daln1}H32SrgL?mRhmxV5f2rYleBx
zUP&!|RMS#g$%%d(Z&r?59J*n;4Pu(XQYGe6wNp_d-&uXj@u(JZ$$xAYjuD8eHo{Os
zOf<s`mfV4`{HB7dqA1H6`6ag1ro==;XRvgnmS?`_vafasU@KxmQ=h?7DSP`ByY1NU
z$Ssn+g~7`<h-nT>Z1KEz->}=vlX(J3PSj>YaGDX5>EbD521^p=Sn-w1J~>Hhw`ERe
z4F9qo#SSf3ch1C)*WiB>F_|ugi3yhADvpj|lquvi_OHMR>~?r8BGk-?X*5!SC4cqI
z2e#qKG;%r*PW38JjcVnKx7#l&{X3PGCsWDkG&mKhI4g-Os<2nL7N2LeIys#Orxaf$
zkwmfDXWZG*sf*R><a7a?4h|Rn%2XyXQbQ&RKz^J>e!^OCJ+N8{DJydN2{>iY2F%o^
zG{R4qxgCIGFH^~B6P#oRK2~|5X>;<M_{lL8*XR{GIc<W|$3)7+{J|;l2tUE_2b?-|
zaykJ{veXR~M?^|#QTQoVW@<Oc={Mkn|1)}vrmLvc$Y~p#ZrHqoDSA65KH;a1kDj!*
zDmiU~)4@_VbR&k?A+-xX4V8{^k4jFrg46$BBh+{RYFdiSk)L9vrJ$ga(+%MCe~mIS
zrq-U1O~Ox9VN%q|X|x~wJ0_ETyfU7I#x#&FcuY=jfK$5IVLL|DF|e-2ACl8M;Ivxp
z@P@6twPmRi#Q{0J1x|<JHU^j#Xf6irlhX)Je^!qf{jsx+$^ZZW07*qoM6N<$g6DYW
Aga7~l

diff --git a/src/algebra/euclid-algorithm.md b/src/algebra/euclid-algorithm.md
index a0ca5ab74..39404b896 100644
--- a/src/algebra/euclid-algorithm.md
+++ b/src/algebra/euclid-algorithm.md
@@ -2,9 +2,11 @@
 
 # The Euclidean algorithm for finding GCD (greatest common divisor)
 
-Given two non-negative integers $a$ and $b$, we require the greater common divisor i.e. the largest number which is a divisor of $a$ and $b$ simultaneously. It's common denoted by $gcd$.
+Euclid's algorithm solves the following problem: Given two non-negative integers $a$ and $b$, we require the greater common divisor i.e. the largest number which is a divisor of $a$ and $b$ simultaneously. It's commonly denoted by $gcd$.
 
-![Euclid’s formula](&imgroot&/euclid1.png)
+$$
+gcd(a, b) = \max_ {k = 1, \ldots \infty  \ : \ k \mid a \ \& \ k \mid b} k
+$$
 
 (here the symbol "$\mid$" denotes divisibility, i.e. “$k\mid a$” means “$k$ divides $a$”)
 
@@ -18,7 +20,7 @@ The algorithm was first described in Euclid's “**Elements**” (circa 300 BC).
 
 The algorithm is extremely simple and described by this formula:
 
-![image](&imgroot&/euclid2.png)
+$$ gcd(a, b) = \cases{a,&if $b = 0$\cr gcd(b, a \mod b),&otherwise \cr}$$
 
 ## Implementation
 
@@ -44,8 +46,8 @@ Finally, we present a non-recursive form of implementation of the algorithm:
 ```cpp
 int gcd (int a, int b) {
 	while (b) {
- a %= b;
- swap (a, b);
+		a %= b;
+		swap(a, b);
 	}
 	return a;
 }
@@ -53,33 +55,43 @@ int gcd (int a, int b) {
 
 ## The Proof of correctness
 
-First, observe that at each successive iteration of the Euclidean algorithm, it's second argument strictly decreases, therefore, since it is always non-negative, the algorithm must terminate.
+First, observe that at each successive iteration of the Euclidean algorithm, it's second argument strictly decreases, therefore, since the arguments are always non-negative, the algorithm must terminate.
 
-For the proof of correctness, we need to show $gcd(a, b) = gcd(b, a\mod b)$ for all $a \geq 0$, $b > 0$.
+For the proof of correctness, we need to show $gcd(a, b) = gcd(b, a \mod b)$ for all $a \geq 0$, $b > 0$.
 
-We will show that the quantity on the left side of the equation, can be written as the value on the left. Obviously, this would mean that the left and right sides are the same and prove Euclid's algorithm.
+We will show that the quantity on the left side of the equation, divides the quantity on it's right. Obviously, this would mean that the left and right sides are equal and prove Euclid's algorithm.
 
 Let $d = gcd(a, b)$. Then, by definition $d\mid a$ and $d\mid b$.
 
 New writing the remainder on dividing $a$ by $b$:
 
-![image](&imgroot&/euclid3.png)
+$$
+a \mod b = a - b \cdot \Bigl\lfloor\dfrac{a}{b}\Bigr\rfloor\qquad
+$$
 
 But then, it follows:
 
-![image](&imgroot&/euclid4.png)
+$$
+d \mid (a \mod b)
+$$
 
-So, remembering the statement $d\mid b$, we obtain the system:
+So, remembering the statement $d \mid b$, we obtain the system:
 
-![image](&imgroot&/euclid5.png)
+$$
+\cases{d \mid b,\cr d \mid (a \mod b)\cr}
+$$
 
-We now use the following fact: if for any three numbers $p$, $q$, and $r$, if $p\mid q$ and $p\mid r$ then $p\mid gcd(q, r)$, In our case, we get:
+We now use the fact that if for any three numbers $p$, $q$, and $r$, if $p\mid q$ and $p\mid r$ then $p\mid gcd(q, r)$, In our case, we get:
 
-![image](&imgroot&/euclid6.png)
+$$
+d \mid gcd(b, a \mod b)
+$$
 
 Or, by substituting $d$ by it's definition($gcd(a, b)$) we get:
 
-![image](&imgroot&/euclid7.png)
+$$
+gcd(a, b) \mid gcd(b, a \mod b)
+$$
 
 So, we have shown that the left side divides the right. The second half of the proof is similar.
 
@@ -95,9 +107,11 @@ Given that Fibonacci numbers grow exponentially(as a constant with respect to $n
 
 ## LCM(Least common multiple)
 
-Calculating least common multiple (least common multiplier, lcm) is reduced to calculating $gcd$ with the following simple statement:
+Calculating least common multiple (least common multiplier or LCM) is reduced to calculating $gcd$ with the following simple statement:
 
-![image](&imgroot&/euclid8.png)
+$$
+lcm(a, b) = \dfrac{a \cdot b}{gcd(a, b)}
+$$
 
 Thus, the calculation of the LCM can also be done using the euclidean algorithm with the same time complexity
 
@@ -108,12 +122,10 @@ int lcm (int a, int b) {
 ```
 (here it is advantageous to first divide $gcd$ and then multiply by $b$, as it helps avoid overflow in some cases)
 
-##Literature
+## Literature
 
 - Thomas Cormen, Charles Leiserson, Ronald Rivest, Clifford Stein. Algorithms: Construction and analysis [2005]
 
-## Problems
+## Practice Problems
 
 - [GCD and LCM[easy]](https://www.codechef.com/problems/FLOW016)
-
-####Note: Translated by [NibNalin](http://codeforces.com/profile/NibNalin)
\ No newline at end of file