TOPICS
Search

Search Results for ""


9681 - 9690 of 13135 for Computational GeometrySearch Results
In number theory (e.g., Ivić 2003), the symbol log_kx is commonly used to mean the nested logarithm (also called the repeated logarithm or iterated logarithm) ...
The nested radical constant is the constant defined by C = sqrt(1+sqrt(2+sqrt(3+sqrt(4+sqrt(5+...))))) (1) = 1.75793275... (2) (OEIS A072449). No closed-form expression is ...
The probability that two elements P_1 and P_2 of a symmetric group generate the entire group tends to 3/4 as n->infty (Netto 1964, p. 90). The conjecture was proven by Dixon ...
A graph or directed graph together with a function which assigns a positive real number to each edge (Harary 1994, p. 52).
Polynomials O_n(x) that can be defined by the sum O_n(x)=1/4sum_(k=0)^(|_n/2_|)(n(n-k-1)!)/(k!)(1/2x)^(2k-n-1) (1) for n>=1, where |_x_| is the floor function. They obey the ...
The functions theta_s(u) = (H(u))/(H^'(0)) (1) theta_d(u) = (Theta(u+K))/(Theta(k)) (2) theta_c(u) = (H(u))/(H(K)) (3) theta_n(u) = (Theta(u))/(Theta(0)), (4) where H(u) and ...
A paradox in decision theory. Given two boxes, B1 which contains $1000 and B2 which contains either nothing or a million dollars, you may pick either B2 or both. However, at ...
Samuel Pepys wrote Isaac Newton a long letter asking him to determine the probabilities for a set of dice rolls related to a wager he planned to make. Pepys asked which was ...
Let pi_n(x)=product_(k=0)^n(x-x_k), (1) then f(x)=f_0+sum_(k=1)^npi_(k-1)(x)[x_0,x_1,...,x_k]+R_n, (2) where [x_1,...] is a divided difference, and the remainder is ...
The next prime function NP(n) gives the smallest prime larger than n. The function can be given explicitly as NP(n)=p_(1+pi(n)), where p_i is the ith prime and pi(n) is the ...
1 ... 966|967|968|969|970|971|972 ... 1314 Previous Next

...