D.3: Modular Arithmetic
From
Poul.murtha (Talk | contribs) |
(→Discrete Math Learning modules) |
||
| (10 intermediate revisions not shown) | |||
| 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 16: | Line 12: | ||
greatest common factor, and solving simple coin-change problems. | greatest common factor, and solving simple coin-change problems. | ||
| + | <br/><br/> | ||
| + | == Discrete Math Learning modules == | ||
| + | [[media:Modular_Arithmetic.pptx | Modular Arithmetic Overview (from Terrel Smith's class, MS-Powerpoint slide set)]]<br/> | ||
| + | [[media:Kirkwood's Modular Arithmetic.doc | Modular Arithmetic Java exercises (from Don Kirkwood's class)]]<br/> | ||
| + | [http://newterra.chemeketa.edu/faculty/mfry5/cs160/Labs/160-Lab03BKG.pdf Online CS Modules: Number Systems]<br/><br/> | ||
| - | + | == Resources for Modular Arithmetic == | |
[http://newterra.chemeketa.edu/faculty/mfry5/CS160/VTCS0/NumberSystems/Lessons/index.html Online CS Modules: Number Systems] | [http://newterra.chemeketa.edu/faculty/mfry5/CS160/VTCS0/NumberSystems/Lessons/index.html Online CS Modules: Number Systems] | ||
| - | [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}}]] | ||
Current revision as of 15:43, 1 February 2011
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
Modular Arithmetic Overview (from Terrel Smith's class, MS-Powerpoint slide set)
Modular Arithmetic Java exercises (from Don Kirkwood's class)
Online CS Modules: Number Systems
Resources for Modular Arithmetic
Online CS Modules: Number Systems
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]
