Search Results for ""

An inhomogeneous linear ordinary differential equation with constant coefficients is an ordinary differential equation in which coefficients are constants (i.e., not ...

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...

Find a way to stack a square of cannonballs laid out on the ground into a square pyramid (i.e., find a square number which is also square pyramidal). This corresponds to ...

The Franel numbers are the numbers Fr_n=sum_(k=0)^n(n; k)^3, (1) where (n; k) is a binomial coefficient. The first few values for n=0, 1, ... are 1, 2, 10, 56, 346, ... (OEIS ...

Archimedes' cattle problem, also called the bovinum problema, or Archimedes' reverse, is stated as follows: "The sun god had a herd of cattle consisting of bulls and cows, ...

The tribonacci numbers are a generalization of the Fibonacci numbers defined by T_1=1, T_2=1, T_3=2, and the recurrence equation T_n=T_(n-1)+T_(n-2)+T_(n-3) (1) for n>=4 ...

In elliptic cylindrical coordinates, the scale factors are h_u=h_v=sqrt(sinh^2u+sin^2v), h_z=1, and the separation functions are f_1(u)=f_2(v)=f_3(z)=1, giving a Stäckel ...

A homogeneous linear ordinary differential equation with constant coefficients is an ordinary differential equation in which coefficients are constants (i.e., not functions), ...

To solve the system of differential equations (dx)/(dt)=Ax(t)+p(t), (1) where A is a matrix and x and p are vectors, first consider the homogeneous case with p=0. The ...

An integer N which is a product of distinct primes and which satisfies 1/N+sum_(p|N)1/p=1 (Butske et al. 1999). The first few are 2, 6, 42, 1806, 47058, ... (OEIS A054377). ...