TOPICS
Search

Search Results for ""


721 - 730 of 736 for COMPLEXITYSearch Results
The Lucas numbers are the sequence of integers {L_n}_(n=1)^infty defined by the linear recurrence equation L_n=L_(n-1)+L_(n-2) (1) with L_1=1 and L_2=3. The nth Lucas number ...
Machin-like formulas have the form mcot^(-1)u+ncot^(-1)v=1/4kpi, (1) where u, v, and k are positive integers and m and n are nonnegative integers. Some such formulas can be ...
Number theory is a vast and fascinating field of mathematics, sometimes called "higher arithmetic," consisting of the study of the properties of whole numbers. Primes and ...
Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...
The j-function is the modular function defined by j(tau)=1728J(tau), (1) where tau is the half-period ratio, I[tau]>0, ...
Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. Apéry (1979) proved that zeta(3) is irrational, although ...
The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...
A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...
The angles mpi/n (with m,n integers) for which the trigonometric functions may be expressed in terms of finite root extraction of real numbers are limited to values of m ...
The Euler-Mascheroni constant gamma, sometimes also called 'Euler's constant' or 'the Euler constant' (but not to be confused with the constant e=2.718281...) is defined as ...
1 ... 70|71|72|73|74 Previous Next

...