Search Results for ""

Consider the general system of two first-order ordinary differential equations x^. = f(x,y) (1) y^. = g(x,y). (2) Let x_0 and y_0 denote fixed points with x^.=y^.=0, so ...

There are several different definition of link. In knot theory, a link is one or more disjointly embedded circles in three-space. More informally, a link is an assembly of ...

By analogy with the log sine function, define the log cosine function by C_n=int_0^(pi/2)[ln(cosx)]^ndx. (1) The first few cases are given by C_1 = -1/2piln2 (2) C_2 = ...

The log sine function, also called the logsine function, is defined by S_n=int_0^pi[ln(sinx)]^ndx. (1) The first few cases are given by S_1 = -piln2 (2) S_2 = ...

The longest increasing scattered subsequence is the longest subsequence of increasing terms, where intervening nonincreasing terms may be dropped. Finding the largest ...

The problem of finding the strategy to guarantee reaching the boundary of a given region ("forest") in the shortest distance (i.e., a strategy having the best worst-case ...

The Lucas polynomials are the w-polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. It is given explicitly by ...

A Lucas polynomial sequence is a pair of generalized polynomials which generalize the Lucas sequence to polynomials is given by W_n^k(x) = ...

Lucas's theorem states that if n>=3 be a squarefree integer and Phi_n(z) a cyclotomic polynomial, then Phi_n(z)=U_n^2(z)-(-1)^((n-1)/2)nzV_n^2(z), (1) where U_n(z) and V_n(z) ...

A method for computing the prime counting function. Define the function T_k(x,a)=(-1)^(beta_0+beta_1+...+beta_(a-1))|_x/(p_1^(beta_0)p_2^(beta_1)...p_a^(beta_(a-1)))_|, (1) ...