Search Results for ""

A generalization of the polylogarithm function defined by S_(n,p)(z)=((-1)^(n+p-1))/((n-1)!p!)int_0^1((lnt)^(n-1)[ln(1-zt)]^p)/tdt. The function reduces to the usual ...

Let A, B, and C be three circles in the plane, and let X be any circle touching B and C. Then build up a chain of circles such that Y:CAX, Z:ABY, X^':BCZ, Y^':CAX^', ...

The following table gives the number of nonadjacent vertex pairs k on graphs of n=1, 2, ... vertices. k counts 1 0, 1, 1, 1, 1, 1, 1, ... 2 0, 0, 1, 2, 2, 2, 2, ... 3 0, 0, ...

A number which is simultaneously a nonagonal number N_m and heptagonal number Hep_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=1/2n(5n-4). (1) Completing the ...

A number which is simultaneously a nonagonal number N_m and hexagonal number Hex_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=n(2n-1). (1) Completing the ...

A number which is simultaneously a nonagonal number N_m and octagonal number O_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=n(3n-2). (1) Completing the ...

A number which is simultaneously a nonagonal number N_m and pentagonal number P_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=1/2n(3n-1). (1) Completing the ...

A number which is simultaneously a nonagonal number N_m and a square number S_n and therefore satisfies the Diophantine equation 1/2m(7m-5)=n^2. (1) Completing the square and ...

A number which is simultaneously a nonagonal number N_m and a triangular number T_n and therefore satisfies the Diophantine equation. 1/2m(7m-5)=1/2n(1+n). (1) Completing the ...

A nondeterministic Turing machine is a "parallel" Turing machine that can take many computational paths simultaneously, with the restriction that the parallel Turing machines ...