Search Results for ""

The sequence {F_n-1} is complete even if restricted to subsequences which contain no two consecutive terms, where F_n is a Fibonacci number.

A number N=p_1p_2...p_n where the p_is are distinct primes and n>=3 such that p_i=Ap_(i-1)+B (1) for i=1, 2, ..., n, p_0 taken as 1, and with A and B some fixed integers. For ...

F_mF_(n+1)-F_nF_(m+1)=(-1)^nF_(m-n), where F_n is a Fibonacci number.

d is called an e-divisor (or exponential divisor) of a number n with prime factorization n=p_1^(a_1)p_2^(a_2)...p_r^(a_r) if d|n and d=p_1^(b_1)p_2^(b_2)...p_r^(b_r), where ...

A number n is called a k e-perfect number if sigma_e(n)=kn, where sigma_e(n) is the sum of the e-divisors of n.

n-minex is defined as 10^(-n).

n-plex is defined as 10^n.

A q-analog of the beta function B(a,b) = int_0^1t^(a-1)(1-t)^(b-1)dt (1) = (Gamma(a)Gamma(b))/(Gamma(a+b)), (2) where Gamma(z) is a gamma function, is given by B_q(a,b) = ...

The q-analog of the derivative, defined by (d/(dx))_qf(x)=(f(x)-f(qx))/(x-qx). (1) For example, (d/(dx))_qsinx = (sinx-sin(qx))/(x-qx) (2) (d/(dx))_qlnx = ...

where _8phi_7 is a q-hypergeometric function.