Search Results for ""
1271 - 1280 of 1586 for Sturm Liouville ProblemSearch Results
In antiquity, geometric constructions of figures and lengths were restricted to the use of only a straightedge and compass (or in Plato's case, a compass only; a technique ...
A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...
Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...
The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...
Perfect numbers are positive integers n such that n=s(n), (1) where s(n) is the restricted divisor function (i.e., the sum of proper divisors of n), or equivalently ...
First published in Riemann's groundbreaking 1859 paper (Riemann 1859), the Riemann hypothesis is a deep mathematical conjecture which states that the nontrivial Riemann zeta ...
A prime number (or prime integer, often simply called a "prime" for short) is a positive integer p>1 that has no positive integer divisors other than 1 and p itself. More ...
The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...
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 harmonic number is a number of the form H_n=sum_(k=1)^n1/k (1) arising from truncation of the harmonic series. A harmonic number can be expressed analytically as ...
...
View search results from all Wolfram sites (160336 matches)

