TOPICS
Search

Search Results for ""


2791 - 2800 of 13135 for number theorySearch Results
The ideal quotient (a:b) is an analog of division for ideals in a commutative ring R, (a:b)={x in R:xb subset a}. The ideal quotient is always another ideal. However, this ...
As Gauss showed in 1812, the hyperbolic tangent can be written using a continued fraction as tanhx=x/(1+(x^2)/(3+(x^2)/(5+...))) (Wall 1948, p. 349; Olds 1963, p. 138).
Let t(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Then if S_m=sum_(t(m))1/t, (1) then {S_m=0 (mod m^2) ...
A method used by Gauss to solve the quadratic Diophantine equation of the form mx^2+ny^2=A (Dickson 2005, pp. 391 and 407).
A quantity by which another (the multiplicand) is multiplied. For example, in the expression a×b, a is the multiplier. The result of the multiplication of two or more ...
An Artin L-function over the rationals Q encodes in a generating function information about how an irreducible monic polynomial over Z factors when reduced modulo each prime. ...
Two complex numbers z=x+iy and z^'=x^'+iy^' are added together componentwise, z+z^'=(x+x^')+i(y+y^'). In component form, (x,y)+(x^',y^')=(x+x^',y+y^') (Krantz 1999, p. 1).
The division of two complex numbers can be accomplished by multiplying the numerator and denominator by the complex conjugate of the denominator, for example, with z_1=a+bi ...
A connected dominating set in a connected graph G is a dominating set in G whose vertices induce a connected subgraph, i.e., one in which there is no dominating vertex not ...
An algorithm for computing an Egyptian fraction, called the Farey sequence method by Bleicher (1972).
1 ... 277|278|279|280|281|282|283 ... 1314 Previous Next

...