Search references for MODULAR FORMS-MODULO-P. Phrases containing MODULAR FORMS-MODULO-P
See searches and references containing MODULAR FORMS-MODULO-P!MODULAR FORMS-MODULO-P
Mathematical concept
modulo a prime p, there is an analogous theory to the classical theory of complex modular forms and the p-adic theory of modular forms. Modular forms
Modular_forms_modulo_p
Computation modulo a fixed integer
using modular arithmetic was developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801. Modular arithmetic modulo m consists
Modular_arithmetic
Concept in modular arithmetic
group of integers modulo p form a cyclic group of order p − 1. For any integer n>1, it's always the case that n2−n+1 is the modular multiplicative inverse
Modular multiplicative inverse
Modular_multiplicative_inverse
Word with multiple distinct meanings
cyclic shifts". Look up modulo in Wiktionary, the free dictionary. Essentially unique List of mathematical jargon Up to "Modular arithmetic". Encyclopedia
Modulo_(mathematics)
Computational operation
same. Modulo (disambiguation) – many uses of the word modulo, all of which grew out of Carl F. Gauss' approach to modular arithmetic in 1801. Modulo (mathematics)
Modulo
Algorithm for fast modular multiplication
division and reduction modulo R are inexpensive, and the modulus is not useful for modular multiplication unless R > N. The Montgomery form of the residue class
Montgomery modular multiplication
Montgomery_modular_multiplication
Modular arithmetic concept
primitive root modulo n if every number a coprime to n is congruent to a power of g modulo n. In symbols, g is a primitive root modulo n if for every
Primitive_root_modulo_n
Exponentation in modular arithmetic
modulo m (for instance by using extended Euclidean algorithm). More precisely: c = be mod m = d−e mod m, where e < 0 and b ⋅ d ≡ 1 (mod m). Modular exponentiation
Modular_exponentiation
Algebraic variety
In number theory and algebraic geometry, a modular curve Y(Γ) is a Riemann surface, or the corresponding algebraic curve, constructed as a quotient of
Modular_curve
Group of units of the ring of integers modulo n
calculating x can be found in the article Modular multiplicative inverse. The set of (congruence classes of) integers modulo n with the operations of addition
Multiplicative group of integers modulo n
Multiplicative_group_of_integers_modulo_n
Number system extending the rational numbers
not form a field. Therefore, these generalized p-adic numbers are rarely encountered in the literature. Roughly speaking, modular arithmetic modulo a positive
P-adic_number
Orientation-preserving mapping class group of the torus
modular group has a trivial center, and thus the modular group is isomorphic to the quotient group of B3 modulo its center; equivalently, to the group of inner
Modular_group
Matrix group
fundamental objects in the classical theory of modular forms; the modern theory of automorphic forms makes a similar use of congruence subgroups in more
Congruence_subgroup
Algorithm used in modular arithmetic
in modular arithmetic to solve for r in a congruence of the form r2 ≡ n (mod p), where p is a prime: that is, to find a square root of n modulo p. The
Tonelli–Shanks_algorithm
Integer that is a perfect square modulo some integer
number theory, an integer q is a quadratic residue modulo n if it is congruent to a perfect square modulo n; that is, if there exists an integer x such that
Quadratic_residue
17th-century conjecture proved by Andrew Wiles in 1994
from modular forms" (PDF). Inventiones Mathematicae. 100 (2): 431–476. Bibcode:1990InMat.100..431R. doi:10.1007/BF01231195. MR 1047143. Singh 2022, p. 205
Fermat's_Last_Theorem
Nonlinear differential operator used to study conformal mappings
of the complex projective line, and in particular, in the theory of modular forms and hypergeometric functions. It plays an important role in the theory
Schwarzian_derivative
Relates rational elliptic curves to modular forms
number theory, the modularity theorem states that elliptic curves over the field of rational numbers are related to modular forms in a particular way
Modularity_theorem
1995 publication in mathematics
announced his proof on 23 June 1993 at a lecture in Cambridge entitled "Modular Forms, Elliptic Curves and Galois Representations". However, in September
Wiles's proof of Fermat's Last Theorem
Wiles's_proof_of_Fermat's_Last_Theorem
Method of exchanging cryptographic keys
protocol uses the multiplicative group of integers modulo p, where p is prime, and g is a primitive root modulo p. To guard against potential vulnerabilities
Diffie–Hellman_key_exchange
A prime p divides a^p–a for any integer a
fact, the extended Euclidean algorithm allows computing the modular inverse of e modulo φ(n), that is, the integer f such that ef≡1(modφ(n)). It follows
Fermat's_little_theorem
Basic Introduction
coefficients of modular forms. More specifically, it gives the modularity of certain two-dimensional Galois representations. In one common form, it states
Langlands–Tunnell_theorem
Unsolved problem in mathematics
Boylan, Matthew (2005-01-01). "Coefficients of half-integral weight modular forms modulo ℓj". Mathematische Annalen. 331 (1): 219–239. doi:10.1007/s00208-004-0555-9
Newman's_conjecture
Theorem in number theory
finite field arises from a modular form. A stronger version of this conjecture specifies the weight and level of the modular form. The conjecture in the level
Serre's_modularity_conjecture
Gives conditions for the solvability of quadratic equations modulo prime numbers
reciprocity is a theorem about modular arithmetic that gives conditions for the solvability of quadratic equations modulo prime numbers. Due to its subtlety
Quadratic_reciprocity
Algorithm for public-key cryptography
Determine d as d ≡ e−1 (mod λ(n)); that is, d is the modular multiplicative inverse of e modulo λ(n). This means: solve for d the equation de ≡ 1 (mod
RSA_cryptosystem
Mathematical group that can be generated as the set of powers of a single element
integer n, the set of integers modulo n, again with the operation of addition, forms a finite cyclic group, denoted Z/nZ. A modular integer i is a generator
Cyclic_group
Famous open problem in mathematics
difficult to determine, but the L-function depends only on the points modulo all prime p and is much simpler: thus the conjecture is a local-to-global statement
Birch and Swinnerton-Dyer conjecture
Birch_and_Swinnerton-Dyer_conjecture
Function studied by Ramanujan
Swinnerton-Dyer, H. P. F. (1973). "On ℓ {\displaystyle \ell } -adic representations and congruences for coefficients of modular forms". In Kuyk, Willem;
Ramanujan_tau_function
Unique numeric book identifier since 1970
(11 minus the remainder of the sum of the products modulo 11) modulo 11. Taking the remainder modulo 11 a second time accounts for the possibility that
ISBN
Special-purpose algorithm for factoring integers
preceding the factor, p − 1, is powersmooth; the essential observation is that, by working in the multiplicative group modulo a composite number N, we
Pollard's_p_−_1_algorithm
Complex-valued smooth functions of the upper half-plane (harmonic analysis topic)
conditions at the cusps of a fundamental domain of Γ. In contrast to modular forms, Maass forms need not be holomorphic. They were studied first by Hans Maass
Maass_wave_form
Theorem on polynomial roots modulo prime powers
Hensel, is a result in modular arithmetic, stating that if a univariate polynomial has a simple root modulo a prime number p, then this root can be lifted
Hensel's_lemma
Method for computing the relation of two integers with their greatest common divisor
that provision, x is the modular multiplicative inverse of a modulo b, and y is the modular multiplicative inverse of b modulo a. Similarly, the polynomial
Extended_Euclidean_algorithm
Mathematical identities related to integer partitions
function for partitions such that each part is congruent to either 1 or 4 modulo 5. qn2+n(q;q)n is the generating function for partitions with exactly n
Rogers–Ramanujan_identities
Class of cryptographic attacks
monic modulo N if its leading coefficient is 1 mod N. Let N be an integer. If f(x) is a polynomial of degree d which is monic modulo N, then the modular equation
Coppersmith's_attack
Theorem on prime numbers
classes modulo a prime number form a finite field (specifically, a prime field). The result is trivial when p=2, so assume p is an odd prime, p≥3. Since
Wilson's_theorem
Mathematical function
mathematics, the Dedekind eta function, named after Richard Dedekind, is a modular form of weight 1/2 and is a function defined on the upper half-plane of complex
Dedekind_eta_function
Number of partitions of an integer
q-Pochhammer symbol and is similar to the product formulation of many modular forms, and specifically the Dedekind eta function. The same sequence of pentagonal
Partition function (number theory)
Partition_function_(number_theory)
Algebraic structure
prime number p, the prime field of order p may be constructed as the integers modulo p, ℤ/pℤ. The elements of the prime field of order p may be represented
Finite_field
range 0 ≤ a ≤ p − 1. This is a simple consequence of the laws of modular arithmetic; we are simply saying that we may first reduce a modulo p. This is consistent
Proofs of Fermat's little theorem
Proofs_of_Fermat's_little_theorem
Set of residue classes modulo n, relatively prime to n
integers modulo n Congruence relation Euler's totient function Greatest common divisor Modular arithmetic Number theory Residue number system Long (1972, p. 85)
Reduced_residue_system
Representation of modular integers by "small" fractions
two squares by taking m to be a prime p that is congruent to 1 modulo 4 and taking a to satisfy a2 + 1 ≡ 0 mod p. The existence of such an a follows from
Thue's_lemma
Particular kind of exponential sum
x modulo m. The Kloosterman sums are a finite ring analogue of Bessel functions. They occur (for example) in the Fourier expansion of modular forms. There
Kloosterman_sum
even integer u in the range 1 ≤ u ≤ p−1, denote by r(u) the least positive residue of au modulo p. (For example, for p = 11, a = 7, we allow u = 2, 4, 6
Proofs of quadratic reciprocity
Proofs_of_quadratic_reciprocity
Function in number theory
a and p defined as (ap)={1if a is a quadratic residue modulo p and a≢0(modp),−1if a is a quadratic nonresidue modulo p,0if a≡0(modp). where p is an odd
Legendre_symbol
Noncototient Nontotient Euler's theorem Wilson's theorem Primitive root modulo n Multiplicative order Discrete logarithm Quadratic residue Euler's criterion
List_of_number_theory_topics
Efficient algorithm to count points on elliptic curves
or Atkin. In order to do so, we make use of modular polynomials, which come from the study of modular forms and an interpretation of elliptic curves over
Schoof's_algorithm
Some remarkable congruences for the partition function
Zbl 0984.11050. Ono, Ken (2004). The web of modularity: arithmetic of the coefficients of modular forms and q-series. CBMS Regional Conference Series
Ramanujan's_congruences
On properties of Galois representations associated with modular forms
level descent modulo p strips all odd primes from the conductor. However, no newforms of level 2 remain because the genus of the modular curve X0(2) is
Ribet's_theorem
Formula concerning prime numbers
an integer is a quadratic residue modulo a prime. Precisely, Let p be an odd prime and a be an integer coprime to p. Then ap−12≡{1(modp) if there is an
Euler's_criterion
Reduction of a ring by one of its ideals
of the notation for residue classes in modular arithmetic and leads to the terminology "residue class of a modulo I" for this equivalence class. The set
Quotient_ring
On unit fractions adding to 4/n
only need to test values that are 1 modulo 4. One way to make progress on this problem is to collect more modular identities, allowing computer searches
Erdős–Straus_conjecture
One over a whole number
perform modular division: dividing by a number x, modulo y, can be performed by converting the unit fraction 1/x into an equivalent whole number modulo y,
Unit_fraction
Arithmetic in a field with a finite number of elements
finite field theory, Évariste Galois. GF(p), where p is a prime number, is simply the ring of integers modulo p. That is, one can perform operations (addition
Finite_field_arithmetic
Period of the Fibonacci sequence modulo an integer
1 modulo p. Every p other than 2 and 5 lie in the residue classes p≡±1 (mod 10) or p≡±3 (mod 10). If p≡±1 (mod 10), then π(p) divides p − 1. If p≡±3 (mod 10)
Pisano_period
Boolean polynomials as sums of monomials
1927, they are the polynomial ring over the integers modulo 2. The resulting degeneracies of modular arithmetic result in Zhegalkin polynomials being simpler
Algebraic_normal_form
Algorithm for integer factorization
This addition would form a group in the non-modular case and in the case when n is prime, because ℤ/nℤ (the integers modulo n) forms a group when n is prime
Lenstra elliptic-curve factorization
Lenstra_elliptic-curve_factorization
Space of complex matrices with positive definite imaginary part
Bowman, Joshua P. "Some Elementary Results on the Siegel Half-plane" (PDF).. van der Geer, Gerard (2008), "Siegel modular forms and their applications"
Siegel_upper_half-space
American mathematician
on Hilbert modular surfaces. Hirzebruch and Zagier coauthored Intersection numbers of curves on Hilbert modular surfaces and modular forms of Nebentypus
Don_Zagier
Number divisible only by 1 and itself
algebra, the ability to perform division means that modular arithmetic modulo a prime number forms a field or, more specifically, a finite field, while
Prime_number
set of all cusp forms of level N and depth 0. Suppose that, φ,φ1,φ2∈S0(Γ0(N)). Definition 1. Let (cd) be the Legendre symbol of c modulo d, SL~2(k∞)=Mp2(k∞)
Waldspurger_formula
Problem of inverting exponentiation in groups
multiplicative group of integers modulo p. Its elements are non-zero congruence classes modulo p, which can be written 1,2,3,…,p−1. The group product of two
Discrete_logarithm
Real root of the polynomial x^5+x+a
on whether 2 is a quadratic residue modulo n or not, respectively, and m∈{0,1,…,n−1}. For n = 5, we have the modular equation: Ω5(u,v)=0⟺u6−v6+5u2v2(u2−v2)+4uv(1−u4v4)=0
Bring_radical
Algorithm for generating pseudo-randomized numbers
of the integers modulo m. The initial state must be chosen between 1 and m−1. One disadvantage of a prime modulus is that the modular reduction requires
Linear_congruential_generator
Mathematical functions
Lafon (2004) p. 226, without the minus sign at the front of the right-hand side. The even Gaussian integers are the residue class of 0, modulo 1+i, the
Lemniscate_elliptic_functions
Group obtained by aggregating similar elements of a larger group
within the original larger group. For example, the cyclic group of addition modulo n can be obtained from the group of integers under addition by identifying
Quotient_group
Shorthand way of determining whether a given number is divisible by a fixed divisor
means 10≡1(mod3) (see modular arithmetic). The same for all the higher powers of 10: 10n≡1n≡1(mod3). They are all congruent to 1 modulo 3. Since two things
Divisibility_rule
American mathematician
Polymath project on bounded gaps between primes, the L-functions and Modular Forms Database, the sums of three cubes project, and the computation and classification
Andrew Sutherland (mathematician)
Andrew_Sutherland_(mathematician)
Prime such that p^2 divides 2^(p-1)-1
that for a prime p, the (p − 1)-th degree roots of unity modulo p2 are uniformly distributed in the multiplicative group of integers modulo p2. The following
Wieferich_prime
Number whose square ends in the same digits
Z {\displaystyle \mathbb {Z} /b^{k}\mathbb {Z} } , the ring of integers modulo b k {\displaystyle b^{k}} . As the inverse limit of Z / b k Z {\displaystyle
Automorphic_number
Quantum algorithm for integer factorization
multiplicative group of integers modulo N, having a multiplicative inverse modulo N. Thus, a has a multiplicative order r modulo N, meaning ar≡1modN, and r
Shor's_algorithm
Variant of fast Fourier transform
Mersenne primes (which requires repeated squaring modulo a Mersenne number M p = 2 p − 1 {\displaystyle M_{p}=2^{p}-1} ), is based on four key elements developed
Irrational base discrete weighted transform
Irrational_base_discrete_weighted_transform
Type of linear congruential generator with no additive constant
congruential generator (LCG) that operates in multiplicative group of integers modulo n. The general formula is Xk+1=a⋅Xkmodm, where the modulus m is a prime
Lehmer random number generator
Lehmer_random_number_generator
Algorithm for determining whether a number is prime
Wilson's theorem, which states that p is prime if and only if: (p−1)!≡−1(modp) Although this method requires about p modular multiplications, rendering it impractical
Primality_test
modulo prime powers. Inputs: p {\displaystyle p} , an odd prime, n ∈ F p {\displaystyle n\in \mathbf {F} _{p}} , which is a square. Outputs: x ∈ F p {\displaystyle
Cipolla's_algorithm
Function in mathematical number theory
algebraic terms, λ(n) is the exponent of the multiplicative group of integers modulo n. As this is a finite abelian group, there must exist an element whose
Carmichael_function
Primality test for numbers of a certain form
working, and if p is not prime, then no chosen a will work. Furthermore, since the calculation is modulo p, only values of a smaller than p have to be considered
Proth's_theorem
Algebraic structure with addition, multiplication, and division
order, are most directly accessible using modular arithmetic. For a fixed positive integer n, arithmetic "modulo n" means to work with the numbers Z/nZ =
Field_(mathematics)
Numbers obtained by adding the two previous ones
or 3 modulo 5, then, p divides Fp+1. The remaining case is that p = 5, and in this case p divides Fp. {p=5⇒p∣Fp,p≡±1(mod5)⇒p∣Fp−1,p≡±2(mod5)⇒p∣Fp+1.
Fibonacci_sequence
is a prime number one less than a power of 2. modular form Modular form modularity theorem The modularity theorem (which used to be called the Taniyama–Shimura
Glossary_of_number_theory
Type of group in group theory
another direction the classical topic of modular forms has blossomed into the modern theory of automorphic forms. The driving force behind this effort is
Arithmetic_group
Condition under which an integer is a quadratic residue
any odd prime p let a be an integer that is coprime to p. Consider the integers a,2a,3a,…,p−12a and their least positive residues modulo p. These residues
Gauss's_lemma_(number_theory)
Approach to public-key cryptography
keys to provide equivalent security, compared to cryptosystems based on modular exponentiation in finite fields, such as the RSA cryptosystem and ElGamal
Elliptic-curve_cryptography
Error detection for identification numbers
check digit method would be to take the sum of all digits (digital sum) modulo 10. This would catch any single-digit error, as such an error would always
Check_digit
Mathematical function associated to algebraic varieties
reducing modulo each prime number p. It is a global L-function defined as an Euler product of local zeta functions. Hasse–Weil L-functions form one of the
Hasse–Weil_zeta_function
Result on the class group of certain number fields, strengthening Ernst Kummer's theorem
prime to p, ω(n) be congruent to n modulo p. The p part of the class group is a Z p {\displaystyle \mathbb {Z} _{p}} -module (since it is p-primary),
Herbrand–Ribet_theorem
About simultaneous modular congruences
When this condition is satisfied, the set of solutions forms a single congruence class modulo N=lcm(n1,…,nk). That is, any two solutions differ by a multiple
Chinese_remainder_theorem
Result of partitioning the elements of an algebraic structure using a congruence relation
the equivalence class of x ∈ A {\displaystyle x\in A} generated by E ("x modulo E"). For an algebra A = ( A , ( f i A ) i ∈ I ) {\displaystyle {\mathcal
Quotient_(universal_algebra)
Open problem on 3x+1 and x/2 functions
it and add one. In modular arithmetic notation, define the function f as follows: f(n)={n/2if n≡0(mod2),3n+1if n≡1(mod2). Now form a sequence by performing
Collatz_conjecture
Number in {..., –2, –1, 0, 1, 2, ...}
to denote either the set of integers modulo p (i.e., the set of congruence classes of integers), or the set of p-adic integers. The whole numbers were
Integer
Type of mathematical function
character modulo k, we can write its Dirichlet L-function as L(s,χ)=∑n=1∞χ(n)ns=1ks∑r=1kχ(r)ζ(s,rk). Generalized Riemann hypothesis L-function Modularity theorem
Dirichlet_L-function
Mathematical concept
to zero modulo p. When q=p>3 this is equivalent to having the trace of Frobenius equal to zero (by the Hasse bound); this does not hold for p=2 or 3.
Supersingular_elliptic_curve
Property of being an even or odd number
commutative and associative in modulo 2 arithmetic, and multiplication is distributive over addition. However, subtraction in modulo 2 is identical to addition
Parity_(mathematics)
Mathematical concept
canonical representatives. For example, in modular arithmetic, for every integer m greater than 1, the congruence modulo m is an equivalence relation on the
Equivalence_class
Standard representation of a mathematical object
with equivalence classes more effective. For example, in modular arithmetic, the canonical form for a residue class is usually taken as the least non-negative
Canonical_form
Multiplication algorithm
by recursively applying fast Fourier transform (FFT) over the integers modulo 2n+1. The run-time bit complexity to multiply two n-digit numbers using
Schönhage–Strassen_algorithm
Mathematical concept
ISBN 3-540-33068-2 Kato, Kazuya (2004), "p-adic Hodge theory and values of zeta functions of modular forms", in Pierre Berthelot; Jean-Marc Fontaine;
Euler_system
Solving integer equations from all modular solutions
equation by using the Chinese remainder theorem to piece together solutions modulo powers of each different prime number. This is handled by examining the
Hasse_principle
Group in arithmetic geometry
Konstantinou's examples and these examples confirm a conjecture of Stein. Thus modulo squares any integer can be the order of Ш. Birch and Swinnerton-Dyer conjecture
Tate–Shafarevich_group
travel, tourism, insurance
MODULAR FORMS-MODULO-P
MODULAR FORMS-MODULO-P
MODULAR FORMS-MODULO-P
MODULAR FORMS-MODULO-P
MODULAR FORMS-MODULO-P
MODULAR FORMS-MODULO-P
MODULAR FORMS-MODULO-P
MODULAR FORMS-MODULO-P
MODULAR FORMS-MODULO-P
travel, tourism, insurance