TOPICS
Search

Search Results for ""


391 - 400 of 1299 for Equivalent and non-equivalent fractionsSearch Results
A conjecture due to Paul Erdős and E. G. Straus that the Diophantine equation 4/n=1/a+1/b+1/c involving Egyptian fractions always can be solved (Obláth 1950, Rosati 1954, ...
alpha_n(z) = int_1^inftyt^ne^(-zt)dt (1) = n!z^(-(n+1))e^(-z)sum_(k=0)^(n)(z^k)/(k!). (2) It is equivalent to alpha_n(z)=E_(-n)(z), (3) where E_n(z) is the En-function.
Barycentric coordinates (t_1,t_2,t_3) normalized so that they become the areas of the triangles PA_1A_2, PA_1A_3, and PA_2A_3, where P is the point whose coordinates have ...
The process used to generate an expression for a covariant in the first degree of any one of the equivalent sets of coefficients for a curve.
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. ...
A pattern tau=(tau_1,...,tau_n) is said to avoid alpha=(alpha_1,...,alpha_k) if alpha is not contained in tau. In other words, tau avoids alpha iff no k-subset of tau is ...
The Banach density of a set A of integers is defined as lim_(d->infty)max_(n)(|{A intersection [n+1,...,n+d]}|)/d, if the limit exists. If the lim is replaced with lim sup or ...
The connective in A<=>B (also denoted A=B) that returns a true result iff A and B are either both true or both false. The biconditional is also called an equivalence.
A number n satisfies the Carmichael condition iff (p-1)|(n/p-1) for all prime divisors p of n. This is equivalent to the condition (p-1)|(n-1) for all prime divisors p of n.
Chain equivalences give an equivalence relation on the space of chain homomorphisms. Two chain complexes are chain equivalent if there are chain maps phi:C_*->D_* and ...
1 ... 37|38|39|40|41|42|43 ... 130 Previous Next

...