User:Temperal/The Problem Solver's Resource6: Difference between revisions

Revision as of 18:54, 3 October 2007

The Problem Solver's Resource

Introduction	Other Tips and Tricks	Methods of Proof	You are currently viewing page 6.

Modulos

Definition

$n\equiv a\pmod{b}$ if $n$ is the remainder when $a$ is divided by $b$ to give an integral amount.

Special Notation

Properties

For any number there will be only one congruent number modulo $m$ between $0$ and $m-1$ .

If $a\equiv b \pmod{m}$ and $c \equiv d \pmod{m}$ , then $(a+c) \equiv (b+d) \pmod {m}$ .

$a \pmod{m} + b \pmod{m} \equiv (a + b) \pmod{m}$ $a \pmod{m} - b \pmod{m} \equiv (a - b) \pmod{m}$ $a \pmod{m} \cdot b \pmod{m} \equiv (a \cdot b) \pmod{m}$

Back to page 5 | Continue to page 7

@@ Line 6: / Line 6: @@
 | style="background:lime; border:1px solid black;height:200px;padding:10px;" | {{User:Temperal/testtemplate|page 6}}
 ==<span style="font-size:20px; color: blue;">Modulos</span>==
-<!-- will fill in later! -->
-[[User:Temperal/The Problem Solver's Resource5|Back to page 5]] | [[User:Temperal/The Problem Solver's Resource7|Continue to page 7]]
-|}<br /><br />
 ==Definition==
 *<math>n\equiv a\pmod{b}</math> if <math>n</math> is the remainder when <math>a</math> is divided by <math>b</math> to give an integral amount.
@@ Line 24: / Line 21: @@
 <!-- to be continued -->
+[[User:Temperal/The Problem Solver's Resource5|Back to page 5]] | [[User:Temperal/The Problem Solver's Resource7|Continue to page 7]]
+|}<br /><br />

Page

Toolbox