TOPICS
Search

Search Results for ""


661 - 670 of 7069 for Numbered Equation 4Search Results
Let there be x successes out of n Bernoulli trials. The sample proportion is the fraction of samples which were successes, so p^^=x/n. (1) For large n, p^^ has an ...
A cyclic number is an (n-1)-digit integer that, when multiplied by 1, 2, 3, ..., n-1, produces the same digits in a different order. Cyclic numbers are generated by the full ...
A number n is called k-hyperperfect if n = 1+ksum_(i)d_i (1) = 1+k[sigma(n)-n-1], (2) where sigma(n) is the divisor function and the summation is over the proper divisors ...
The spherical curve taken by a ship which travels from the south pole to the north pole of a sphere while keeping a fixed (but not right) angle with respect to the meridians. ...
There are (at least) two mathematical constants associated with Theodorus. The first Theodorus's constant is the elementary algebraic number sqrt(3), i.e., the square root of ...
The sextic curve also known as atriphtothlassic curve and given by the equation x^4(x^2+y^2)-(ax^2-b)^2=0, where a,b>0.
Clean tile is a game investigated by Buffon (1777) in which players bet on the number of different tiles a thrown coin will partially cover on a floor that is regularly ...
The sum-of-factorial powers function is defined by sf^p(n)=sum_(k=1)^nk!^p. (1) For p=1, sf^1(n) = sum_(k=1)^(n)k! (2) = (-e+Ei(1)+pii+E_(n+2)(-1)Gamma(n+2))/e (3) = ...
A magic hexagon of order n is an arrangement of close-packed hexagons containing the numbers 1, 2, ..., H_(n-1), where H_n is the nth hex number such that the numbers along ...
A spider graph, spider tree, or simply "spider," is a tree with one vertex of degree at least 3 and all others with degree at most 2. The numbers of spiders on n=1, 2, ... ...
1 ... 64|65|66|67|68|69|70 ... 707 Previous Next

...