Difference between revisions of "Template:AotD"

Revision as of 15:23, 27 January 2008

Introductory modular arithmetic

Modular arithmetic is a special type of arithmetic that involves only integers. This goal of this article is to explain the basics of modular arithmetic while presenting a progression of more difficult and more interesting problems that are easily solved using... [more]

@@ Line 1: / Line 1: @@
 <blockquote style="display:table;background:#eeeeee;padding:10px;" class="toccolours">
-===[[Rational approximation of famous numbers]]===
+===[[Modular arithmetic/Introduction|Introductory modular arithmetic]]===
-'''Rational approximation''' is the application of [[Rational approximation|Dirichlet's theorem]] which shows that, for each irrational number <math>x\in\mathbb R</math>, the inequality <math>\left|x-\frac pq\right|<\frac 1{q^2}</math> has infinitely many solutions. On the other hand, sometimes it is useful to know that <math>x</math> cannot be approximated by rationals too well, or, more precisely, that <math>x</math> is not a [[Liouvillian number]], i.e., that for some power <math>M<+\infty</math>, the inequality [[Rational approximation of famous numbers|[more]]]
+'''[[Modular arithmetic]]''' is a special type of arithmetic that involves only [[integers]].  This goal of this article is to explain the basics of modular arithmetic while presenting a progression of more difficult and more interesting problems that are easily solved using... [[Modular arithmetic/Introduction|[more]]]
 </blockquote>

Page

Toolbox

Search

Difference between revisions of "Template:AotD"

Revision as of 15:23, 27 January 2008

Introductory modular arithmetic