Search Results for ""

A number theoretic character, also called a Dirichlet character (because Dirichlet first introduced them in his famous proof that every arithmetic progression with relatively ...

A figurate number corresponding to a pentagonal pyramid. The first few are 1, 6, 18, 40, 75, ... (OEIS A002411). The generating function for the pentagonal pyramidal numbers ...

A delay differential equation (also called a differential delay equation or difference-differential equation, although the latter term has a different meaning in the modern ...

A difference-differential equation is a two-variable equation consisting of a coupled ordinary differential equation and recurrence equation. In older literature, the term ...

The second-order ordinary differential equation (d^2y)/(dx^2)+[theta_0+2sum_(n=1)^inftytheta_ncos(2nx)]y=0, (1) where theta_n are fixed constants. A general solution can be ...

The partial differential equation (u_t)/(u_x)=1/4(u_(xxx))/(u_x)-3/8(u_(xx)^2)/(u_x^2)+3/2(p(u))/(u_x^2), where p(u)=1/4(4u^3-g_2u-g_3). The special cases ...

A colossally abundant number is a positive integer n for which there is a positive exponent epsilon such that (sigma(n))/(n^(1+epsilon))>=(sigma(k))/(k^(1+epsilon)) for all ...

A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...

Let G_1, G_2, ..., G_t be a t-graph edge coloring of the complete graph K_n, where for each i=1, 2, ..., t, G_i is the spanning subgraph of K_n consisting of all graph edges ...

The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...