TOPICS
Search

Search Results for ""


2621 - 2630 of 3574 for Inverse FunctionsSearch Results
Exponentiation is the process of taking a quantity b (the base) to the power of another quantity e (the exponent). This operation most commonly denoted b^e. In TeX, the ...
The extended greatest common divisor of two integers m and n can be defined as the greatest common divisor GCD(m,n) of m and n which also satisfies the constraint ...
The w-polynomials obtained by setting p(x)=3x and q(x)=-2 in the Lucas polynomial sequence. Setting f_n(1)=f_n (1) give a Fermat-Lucas number. The first few Fermat-Lucas ...
The W-polynomials obtained by setting p(x)=3x and q(x)=-2 in the Lucas polynomial sequence. The first few Fermat polynomials are F_1(x) = 1 (1) F_2(x) = 3x (2) F_3(x) = ...
For even h, (1) (Nagell 1951, p. 176). Writing out symbolically, sum_(n=0)^h((-1)^nproduct_(k=0)^(n-1)(1-x^(h-k)))/(product_(k=1)^(n)(1-x^k))=product_(k=0)^(h/2-1)1-x^(2k+1), ...
For a form Q, the generic character chi_i(Q) of Q is defined as the values of chi_i(m) where (m,2d)=1 and Q represents m: chi_1(Q), chi_2(Q), ..., chi_r(Q) (Cohn 1980, p. ...
The determinant G(f_1,f_2,...,f_n)=|intf_1^2dt intf_1f_2dt ... intf_1f_ndt; intf_2f_1dt intf_2^2dt ... intf_2f_ndt; | | ... |; intf_nf_1dt intf_nf_2dt ... intf_n^2dt|.
Let alpha_(n+1) = (2alpha_nbeta_n)/(alpha_n+beta_n) (1) beta_(n+1) = sqrt(alpha_nbeta_n), (2) then H(alpha_0,beta_0)=lim_(n->infty)a_n=1/(M(alpha_0^(-1),beta_0^(-1))), (3) ...
Let F be a finite field with q elements, and let F_s be a field containing F such that [F_s:F]=s. Let chi be a nontrivial multiplicative character of F and chi^'=chi ...
The Jacobi symbol (a/y)=chi(y) as a number theoretic character can be extended to the Kronecker symbol (f(a)/y)=chi^*(y) so that chi^*(y)=chi(y) whenever chi(y)!=0. When y is ...
1 ... 260|261|262|263|264|265|266 ... 358 Previous Next

...