TOPICS
Search

Search Results for ""


3831 - 3840 of 13134 for binomial theorySearch Results
The determination of a set of factors (divisors) of a given integer ("prime factorization"), polynomial ("polynomial factorization"), etc., which, when multiplied together, ...
A functor is said to be faithful if it is injective on maps. This does not necessarily imply injectivity on objects. For example, the forgetful functor from the category of ...
The formal term used for a collection of objects. It is denoted {a_i}_(i in I) (but other kinds of brackets can be used as well), where I is a nonempty set called the index ...
The sequence of six 9s which begins at the 762nd decimal place of pi, pi=3.14159...134999999_()_(six 9s)837... (Wells 1986, p. 51). The positions of the first occurrences of ...
A fibered category F over a topological space X consists of 1. a category F(U) for each open subset U subset= X, 2. a functor i^*:F(U)->F(V) for each inclusion i:V↪U, and 3. ...
Let F and G be fibered categories over a topological space X. A morphism phi:F->G of fibered categories consists of: 1. a functor phi(U):F->G(U) for each open subset U ...
Let psi = 1+phi (1) = 1/2(3+sqrt(5)) (2) = 2.618033... (3) (OEIS A104457), where phi is the golden ratio, and alpha = lnphi (4) = 0.4812118 (5) (OEIS A002390). Define the ...
Consider a Lucas sequence with P>0 and Q=+/-1. A Fibonacci pseudoprime is a composite number n such that V_n=P (mod n). There exist no even Fibonacci pseudoprimes with ...
The Fibonacci Q-matrix is the matrix defined by Q=[F_2 F_1; F_1 F_0]=[1 1; 1 0], (1) where F_n is a Fibonacci number. Then Q^n=[F_(n+1) F_n; F_n F_(n-1)] (2) (Honsberger ...
A field automorphism of a field F is a bijective map sigma:F->F that preserves all of F's algebraic properties, more precisely, it is an isomorphism. For example, complex ...
1 ... 381|382|383|384|385|386|387 ... 1314 Previous Next

...