Arvutiteaduse instituut
Login
  • Trace::

MathWiki

finite_fields:04_isomorphisms
  • Asymptotics
    • 1. The need for asymptotic notation: a case study
    • 2. Big Oh
    • 3. Big Omega
    • 4. Multiple variables
    • 5. Polynomial complexity
    • 6. The negligible, the noticeable and the overwhelming
  • Divisibility and modular arithmetics
    • 1. Divisibility
    • 2. Primes and divisibility
    • 3. Greatest common divisor and least common multiple
    • 4. Euclidean algorithm
    • 5. Extended Euclidean algorithm
    • 6. Modular arithmetics
  • Finite fields
    • 1. What are rings and fields?
    • 2. Long division of polynomials
    • 3. The general way of constructing finite fields
    • 4. Isomorphisms, homomorphisms, automorphisms. Classification of all finite fields
    • 5. Computations in finite fields
    • 6. What is a group?
    • 7. Multiplicative group in finite fields
    • 8. Subfields
  • Linear algebra
    • 1. Matrices
    • 2. Systems of linear equations and matrices
    • 3. Gaussian elimination algorithm
    • 4. Solving systems of linear equations via invertible matrices
  • Number theory
  • Probability theory
    • 1. Event and probability
    • 2. Probability of two events
    • 3. Conditional probability
    • 4. Total probability
    • 5. Expected value
    • 6. Inequalities
    • 7. Game notation

Send new password

Please enter your user name in the form below to request a new password for your account in this wiki. A confirmation link will be sent to your registered email address.

Set new password for



finite_fields/04_isomorphisms.txt ยท Last modified: 2014/01/20 11:16 by marje
Contact: ati.comp@ut.ee
study IT in .ee
CC Attribution-Noncommercial-Share Alike 3.0 Unported