Gestalte GoConqr mit. Was sollen wir als Nächstes hinzufügen?

Mindmap

Exam 2

jwyatt06 Englisch

Exam 2

Inhalt der Mindmap

Exam 2

  1. Definition

    • Def. of a multiplicative function
  2. State and Prove

    • Theorem 4.1
    • Fermat's Little Theorem (know the statement and proof of)
    • Statement and idea of the proof of Wilson's Theorem.
    • State and prove Theorem 7.1
  3. Know

    • Theorem 4.2
      • Do not need to memorize.
      • **Especially statement f.**
    • Theorem 4.3
    • How to use Fermat's Little Theorem and proof of a=b(mod mn) to get results about congruences (Section 5.2).
    • Know statement of Theorem 6.4. USE THIS TO CONCLUDE tao and sigma are multiplicative.
    • Know the idea that phi is multiplicative. Be able to write out 'table'.
    • Know statement in Euler's Theorem 7.5, As in the proof of Fermat's theorem, multiply some set of integers together and conclude that the product of this set is congruent modn to the product of some other set, then argue that you can cancel some quantity appropriately.
    • The idea behind the RSA encryption scheme.
  4. GIVEN

    • Theorem 4.7
    • Info in middle of page 77.
    • Formulas from Theorem 6.2
    • General formula an arbitrary integer n.
  5. Be Able To

    • Prove
      • Theorem 4.3- Corollary 1; give a direct proof which does not make use of the more general statement.
      • Prove Directly: If a=b(mod n) and a=b(mod m) and gcd(m,n)=1, then a=b(mod mn).
    • Interpret
      • 'Units Digit', 'last two digits', etc. as congruence mod 10^n for some n.
    • Solve
      • Problems like 4.4 (1)
      • If f is known to be a multiplicative number-theoretic function, be able to compute f(n) for any integer n in case the values of f(p^k) are gicen for each prime p and each integer k greater than or equal to 1.
      • Questions from 10.1

Bilder und Dateien der Mindmap

  • Exam 2
  • Exam 2
  • Exam 2

Informationen

Beschreibung
Mindmap am Exam 2, erstellt von jwyatt06 am 24/03/2015.
Erstellt von
jwyatt06 · Mär 2015
Aktualisiert
19 Feb 2016
Aufrufe
0
Bewertung

Feedback

Worum geht es?

Was sollen wir als Nächstes hinzufügen?