D.3: Modular Arithmetic
From
(Difference between revisions)
m (→Discrete Math Learning modules) |
m (→Discrete Math Learning modules) |
||
| Line 1: | Line 1: | ||
| - | == | + | == Oregon Department of Education knowledge and skills for Modular Arithmetic == |
| - | + | ||
| - | + | ||
| - | + | ||
| - | + | ||
'''D.3 Modular Arithmetic:''' Demonstrate understanding of modular arithmetic and its | '''D.3 Modular Arithmetic:''' Demonstrate understanding of modular arithmetic and its | ||
relationship to set theory. | relationship to set theory. | ||
| Line 15: | Line 11: | ||
congruence relations such as creating error detection codes, calculating | congruence relations such as creating error detection codes, calculating | ||
greatest common factor, and solving simple coin-change problems. | greatest common factor, and solving simple coin-change problems. | ||
| + | |||
| + | <br/><br/> | ||
| + | |||
| + | == Discrete Math Learning modules == | ||
| + | |||
| + | <br/><br/> | ||
| + | |||
| + | |||
| + | |||
Revision as of 07:58, 2 August 2010
Oregon Department of Education knowledge and skills for Modular Arithmetic
D.3 Modular Arithmetic: Demonstrate understanding of modular arithmetic and its relationship to set theory.
D.3.1 Perform modular arithmetic operations.
D.3.2 Demonstrate understanding of the relationship of modular arithmetic to two numbers being congruent modulo n.
D.3.3 Solve practical problems or develop algorithms using modular arithmetic or congruence relations such as creating error detection codes, calculating greatest common factor, and solving simple coin-change problems.
Discrete Math Learning modules
Online CS Modules: Number Systems
Online CS Modules: Number Systems, Part 2
Note that all of the above links have related Problem Sets in MicroSoft WORD format that can be accessed through Mitch Fry's CS 160 site: [1]
