D.3: Modular Arithmetic
From
(Difference between revisions)
Poul.murtha (Talk | contribs) |
m (→Discrete Math Learning modules) |
||
| Line 24: | Line 24: | ||
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: [http://newterra.chemeketa.edu/faculty/mfry5/#] | 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: [http://newterra.chemeketa.edu/faculty/mfry5/#] | ||
| + | |||
| + | <br/><br/> | ||
| + | ---- | ||
| + | {{HS Discrete Math (CS0)/ChapNav}} | ||
| + | ---- | ||
| + | [[Category:HS Discrete Math (CS0)|{{SUBPAGENAME}}]] | ||
Revision as of 07:40, 2 August 2010
Discrete Math Learning modules
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.
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]
