Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision Both sides next revision
modular:02_gcd [2014/01/31 11:41]
marje
modular:02_gcd [2014/01/31 11:45]
marje
Line 109: Line 109:
 </​WRAP>​ </​WRAP>​
  
-Clearly $\min(e_i, e'_i) +\max(e_i, e'​_i)=e_i+e'​_1$ (for example, $\min\{4,​10\}+\max\{4,​10\}=4+10=14$),​ thus obviously.+Clearly $\min(e_i, e'_i) +\max(e_i, e'​_i)=e_i+e'​_1$ (for example, $\min\{4,​10\}+\max\{4,​10\}=4+10=14$),​ thus 
 + 
 +$$\gcd(a,​b)\cdot\operatorname{lcm}(a,​b)=a\cdot b.$$
  
 <WRAP nl> <WRAP nl>
 [[modular:​04_euclidean_algorithm]]\\ [[modular:​04_euclidean_algorithm]]\\
 </​WRAP>​ </​WRAP>​
modular/02_gcd.txt · Last modified: 2014/02/01 00:00 by marje