TOPICS
Search

Search Results for ""


7961 - 7970 of 13135 for Computational GeometrySearch Results
The numbers three and four appear prominently in the game of baseball. There are three strikes for an out, three outs per half-inning (i.e., teams switch after three outs, ...
A polynomial sequence p_n(x) is called the basic polynomial sequence for a delta operator Q if 1. p_0(x)=1, 2. p_n(0)=0 for all n>0, 3. Qp_n(x)=np_(n-1)(x). If p_n(x) is a ...
k_nu(x)=(e^(-x))/(Gamma(1+1/2nu))U(-1/2nu,0,2x) for x>0, where U is a confluent hypergeometric function of the second kind.
A class of curve defined at integer values which hops from one value to another. Their name derives from the Greek word betaalphataurhoalphachiiotaomicronnu batrachion, which ...
If C_1, C_2, ...C_r are sets of positive integers and union _(i=1)^rC_i=Z^+, then some C_i contains arbitrarily long arithmetic progressions. The conjecture was proved by van ...
A transformation formula for continued fractions (Lorentzen and Waadeland 1992) which can, for example, be used to prove identities such as ...
Let T(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Define f_m(x)=product_(t in T(m))(x-t). (1) Then a ...
Let m>=3 be an integer and let f(x)=sum_(k=0)^na_kx^(n-k) be an integer polynomial that has at least one real root. Then f(x) has infinitely many prime divisors that are not ...
The Baum-Sweet sequence is the sequence of numbers {b_n} such that b_n=1 if the binary representation of n contains no block of consecutive 0s of odd length, and b_n=0 ...
In April 1999, Ed Pegg conjectured on sci.math that there were only finitely many zerofree cubes, to which D. Hickerson responded with a counterexample. A few days later, Lew ...
1 ... 794|795|796|797|798|799|800 ... 1314 Previous Next

...