Exploring Number Theory and Modular Arithmetic in Mathematics

slide1 n.w
1 / 8
Embed
Share

Delve into the fascinating world of number theory and modular arithmetic, uncovering the foundational concepts and applications in mathematics. Understand the significance of these topics in computer science and pure mathematics, paving the way for advanced studies and problem-solving. Featuring insights on the queen of mathematics and the principles of modular arithmetic, this exploration offers a comprehensive view of the interconnectedness of these fields.

  • Mathematics
  • Number Theory
  • Modular Arithmetic
  • Computer Science
  • Pure Math

Uploaded on | 0 Views


Download Presentation

Please find below an Image/Link to download the presentation.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.

You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.

The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.

E N D

Presentation Transcript


  1. DRP Carl Gauss Mathematics is the queen of sciences Number Theory is the queen of mathematics

  2. Number Theory Whole Numbers Cryptography

  3. Modular Arithmetic (General) Foundation Knowledge Generic Expression A modulo B == C A: dividend Modulo = mod = % B: modulus ==: Indicates congruency C: remainder derived from A/B

  4. Clock Analogy

  5. Computer Science Algorithm Algorithm for Most Programming Languages: 1. Quotient = RoundToZero(A/B) 2. Remainder = A (Quotient * B)

  6. Pure Math Modular Arithmetic -1 mod 4 == -5, -1, 3, 7 Infinite possible answers, infinite remainders Pure Math handles infinite sets

  7. Applied Math Java Modular arithmetic Application limited to finite sets Java Programming Language Java picks number closest to zero as an ANSWER -1 % 300 == -1 (8 bits) -1 % 300 == 299 (10 bits)

  8. Final Thoughts Staff Book Chief DRP Mentor: Tim Mercure DRP Student: Geri Dunellari Auxiliary Resources: Dr. Larry Washington Corry Bedwell

Related


More Related Content