Search Results

MA 361 — Number Theory

3 credits; 3 lecture hours

Students are introduced to modular arithmetic and basic cryptography algorithms through a systematic treatment of topics such as divisibility, remainders, fractions and functions, mod b, and Fermat's little theorem. The course culminates in applications of the RSA encryption algorithm.
Prerequisite(s): mathematic proficiency (see beginning of Mathematics section).

Graphic Design BFA Degree Program

http://catalog.fitnyc.edu/undergraduate/majors/baccalaureatedegreeprograms/graphicdesignmajor/

...335 , GD 347 , GD 361 , GD 380A , or...credits. CHOICE of any MA that meets SUNY...