TOPICS
Search

Search Results for ""


5261 - 5270 of 13135 for floating point numberSearch Results
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 ...
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 ...
Polynomials b_n(x) which form a Sheffer sequence with g(t) = t/(e^t-1) (1) f(t) = e^t-1, (2) giving generating function sum_(k=0)^infty(b_k(x))/(k!)t^k=(t(t+1)^x)/(ln(1+t)). ...
The "binary" Champernowne constant is obtained by concatenating the binary representations of the integers C_2 = 0.(1)(10)(11)(100)(101)(110)(111)..._2 (1) = ...
The binomial transform takes the sequence a_0, a_1, a_2, ... to the sequence b_0, b_1, b_2, ... via the transformation b_n=sum_(k=0)^n(-1)^(n-k)(n; k)a_k. The inverse ...
The Borwein integrals are the class of definite integrals defined by I_n=1/piint_0^inftyx^(-(n+1)/2)product_(k=1,3,...)^nsin(x/k)dx for odd n. The integrals are curious ...
The second part of Pollard rho factorization method concerns detection of the fact that a sequence has become periodic. Pollard's original suggestion was to use the idea ...
The only known classically known algebraic curve of curve genus g>1 that has an explicit parametrization (x(t),y(t)) in terms of standard special functions (Burnside 1893, ...
A set of positive integers S is called sum-free if the equation x+y=z has no solutions x, y, z in S. The probability that a random sum-free set S consists entirely of odd ...
Assume that f is a nonnegative real function on [0,infty) and that the two integrals int_0^inftyx^(p-1-lambda)[f(x)]^pdx (1) int_0^inftyx^(q-1+mu)[f(x)]^qdx (2) exist and are ...
1 ... 524|525|526|527|528|529|530 ... 1314 Previous Next

...