Ads
related to: step by modular equations wordgenerationgenius.com has been visited by 10K+ users in the past month
- Grades K-2 Math Lessons
Get instant access to hours of fun
standards-based K-2 videos & more.
- K-8 Standards Alignment
Videos & lessons cover most
of the standards for every state
- Teachers Try it Free
Get 30 days access for free.
No credit card or commitment needed
- Grades 3-5 Math lessons
Get instant access to hours of fun
standards-based 3-5 videos & more.
- Grades K-2 Math Lessons
Search results
Results from the WOW.Com Content Network
In that sense a modular equation becomes the equation of a modular curve. Such equations first arose in the theory of multiplication of elliptic functions (geometrically, the n 2 -fold covering map from a 2- torus to itself given by the mapping x → n · x on the underlying group) expressed in terms of complex analysis .
A word equation is a formal equality:= = between a pair of words and , each over an alphabet comprising both constants (c.f. ) and unknowns (c.f. ). [1] An assignment of constant words to the unknowns of is said to solve if it maps both sides of to identical words.
A modular form for G of weight k is a function on H satisfying the above functional equation for all matrices in G, that is holomorphic on H and at all cusps of G. Again, modular forms that vanish at all cusps are called cusp forms for G. The C-vector spaces of modular and cusp forms of weight k are denoted M k (G) and S k (G), respectively.
The modular inverse of aR mod N is REDC((aR mod N) −1 (R 3 mod N)). Modular exponentiation can be done using exponentiation by squaring by initializing the initial product to the Montgomery representation of 1, that is, to R mod N, and by replacing the multiply and square steps by Montgomery multiplies.
To find from a given value =, it takes the following steps: Find the modular square root ().This step is quite easy when is a prime, irrespective of how large is.; Solve a quadratic equation associated with the modular square root of = + +.
A related object is the classical modular polynomial, a polynomial in one variable defined as Φ n (x, x). The classical modular curves are part of the larger theory of modular curves . In particular it has another expression as a compactified quotient of the complex upper half-plane H .
A modular multiplicative inverse of a modulo m can be found by using the extended Euclidean algorithm. The Euclidean algorithm determines the greatest common divisor (gcd) of two integers, say a and m. If a has a multiplicative inverse modulo m, this gcd must be 1. The last of several equations produced by the algorithm may be solved for this gcd.
The modular equation of degree (where is a prime number) is an algebraic equation in () and (). If λ ( p τ ) = u 8 {\displaystyle \lambda (p\tau )=u^{8}} and λ ( τ ) = v 8 {\displaystyle \lambda (\tau )=v^{8}} , the modular equations of degrees p = 2 , 3 , 5 , 7 {\displaystyle p=2,3,5,7} are, respectively, [ 8 ]
Ads
related to: step by modular equations wordgenerationgenius.com has been visited by 10K+ users in the past month