D.3: Modular Arithmetic

From

(Difference between revisions)
Jump to: navigation, search
m (Created page with '== Discrete Math Learning modules == <br/><br/>')
Line 2: Line 2:
<br/><br/>
<br/><br/>
 +
 +
 +
'''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.
 +
 +
 +
 +
 +
[http://newterra.chemeketa.edu/faculty/mfry5/CS160/VTCS0/NumberSystems/Lessons/index.html Online CS Modules: Number Systems]
 +
 +
[http://newterra.chemeketa.edu/faculty/mfry5/cs160/Labs/160-Lab03BKG.pdf 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: [http://newterra.chemeketa.edu/faculty/mfry5/#]

Revision as of 23:21, 31 July 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]

Personal tools
MediaWiki Appliance - Powered by TurnKey Linux