Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

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

(→‎<span style="font-size:20px; color: blue;">Modulos</span>: Creation)
(asdf)
Line 6: Line 6:
 
| style="background:lime; border:1px solid black;height:200px;padding:10px;" | {{User:Temperal/testtemplate|page 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>==
 
==<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==
 
==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.
 
*<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 -->
 
<!-- 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 />

Revision as of 19: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



Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=User:Temperal/The_Problem_Solver%27s_Resource6&oldid=17383"