TOPICS
Search

Search Results for ""


2811 - 2820 of 13134 for binomial theorySearch Results
A quantity such as a polynomial discriminant which remains unchanged under a given class of algebraic transformations. Such invariants were originally called ...
A class of fibered knots and links which arises in algebraic geometry. An algebraic link is formed by connecting the NW and NE strings and the SW and SE strings of an ...
An almost perfect number, also known as a least deficient or slightly defective (Singh 1997) number, is a positive integer n for which the divisor function satisfies ...
For some constant alpha_0, alpha(f,z)<alpha_0 implies that z is an approximate zero of f, where alpha(f,z)=(|f(z)|)/(|f^'(z)|)sup_(k>1)|(f^((k))(z))/(k!f^'(z))|^(1/(k-1)). ...
An amicable quadruple as a quadruple (a,b,c,d) such that sigma(a)=sigma(b)=sigma(c)=sigma(d)=a+b+c+d, (1) where sigma(n) is the divisor function. If (a,b) and (x,y) are ...
An approximate unit for a C^*-algebra A is an increasing net {u_lambda}_(lambda in Lambda) of positive elements in the closed unit ball of A such that a=lim_(lambda)au_lambda ...
An automorphic function f(z) of a complex variable z is one which is analytic (except for poles) in a domain D and which is invariant under a countably infinite group of ...
A number n is called a barrier of a number-theoretic function f(m) if, for all m<n, m+f(m)<=n. Neither the totient function phi(n) nor the divisor function sigma(n) has a ...
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. Define f_m(x)=product_(t in T(m))(x-t). (1) Then a ...
Let m>=3 be an integer and let f(x)=sum_(k=0)^na_kx^(n-k) be an integer polynomial that has at least one real root. Then f(x) has infinitely many prime divisors that are not ...
1 ... 279|280|281|282|283|284|285 ... 1314 Previous Next

...