Search Results for ""

Watson (1939) considered the following three triple integrals, I_1 = 1/(pi^3)int_0^piint_0^piint_0^pi(dudvdw)/(1-cosucosvcosw) (1) = (4[K(1/2sqrt(2))]^2)/(pi^2) (2) = ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...

As defined in this work, a wheel graph W_n of order n, sometimes simply called an n-wheel (Harary 1994, p. 46; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 78), is a ...

A problem posed by the Slovak mathematician Stefan Znám in 1972 asking whether, for all integers k>=2, there exist k integers x_1,...,x_k all greater than 1 such that x_i is ...

A graph G having chromatic number gamma(G)=k is called a k-chromatic graph (Harary 1994, p. 127). In contrast, a graph having gamma(G)<=k is said to be a k-colorable graph. A ...

The q-analog of the Pochhammer symbol defined by (a;q)_k={product_(j=0)^(k-1)(1-aq^j) if k>0; 1 if k=0; product_(j=1)^(|k|)(1-aq^(-j))^(-1) if k<0; ...

An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...

Start with an integer n, known as the digitaddition generator. Add the sum of the digitaddition generator's digits to obtain the digitaddition n^'. A number can have more ...

Let Sigma(n)=sum_(i=1)^np_i (1) be the sum of the first n primes (i.e., the sum analog of the primorial function). The first few terms are 2, 5, 10, 17, 28, 41, 58, 77, ... ...

Zeros of the Riemann zeta function zeta(s) come in two different types. So-called "trivial zeros" occur at all negative even integers s=-2, -4, -6, ..., and "nontrivial ...