About 2,100 results
|Dilcher's Formula 733 See also EXPANSION, PARALLEL, PERSPECTIVE |
TRIANGLES, TRANSLATION References Coxeter, H. S. M. and Greitzer, S. L. "
Dilation." §4.7 in Geometry Revisited. Washington, DC: Math. Assoc. Amer., pp.
|In particular,we present anew combinatorial formula for such sequencesin |
termsof a 'shift byrank' quasi-expansion based on ordered set partitions.As an
application, wegive a new proof of Dilcher's formula for expressing generalized
|Thus understanding logos as cosmic formula is out of sync with the context of the |
proem in which it occurs. But what, then, does it mean here? Dilcher offers a
thorough analysis of the word in classical literature. This analysis I will
summarize in ...
Canadian Number Theory Association. Conference, Karl Dilcher - 1995 - Preview
|Conference Karl Dilcher. Conference Proceedings Volume 15, 1995 Five |
Formulas of Ramanujan Arising From Eisenstein Series BRUCE C. BERNDT
AND PAUL BIALEK ABSTRACT. On pages 277, 278 in the unorganized portion
|Now Binet's formula can be generalized for sequences Fn , which are defined by |
arbitrary linear recursions with constant ... Dilcher's results say roughly (in our
terminology), that there is a distinguished single real root a(f,∞)1 in 0 < a(f,∞)1 <
|In 1989 K. Dilcher  extended (64) to n— 1 m / \ Bn(Xx)=XnBn(x)+n J2J2(-Vk+|
l(n!) ... By making use of the Alzer and Dilcher results, P. G. Todorov  gave
twelve explicit formulas for the Bernoulli and Euler polynomials and numbers,
Matti Jutila, Tauno Metsänkylä - 2001 - Preview
|Multiple zeta sums via box splines Karl Dilcher and Kirk Haller Abstract. We |
present a method, based ... Introduction An important tool for summing infinite
series is the Poisson summation formula; see, e.g., [15, p. 376ff.] or  for some
|K. Dilcher, L. Skula, and I. Sh. Slavutskiˇı (1991). Bernoulli Numbers. |
Bibliography (1713–1990), Volume 87 of Queen's Papers in Pure and Applied
Mathematics. Kingston, ON: Queen's University. A. M. Din (1981). A simple sum
formula for ...
|Rodrigues formula (2.5) for the Legendre polynomials that /„(P„(z)) is just the |
polynomial (1 — г2)", with the "lower half removed (see also the ... K. Dilcher and
K. B. Stolarsky, Sequences of polynomials whose zeros lie on fixed lemniscates.
|Another point of view: the Wieferich Conjecture, first version The Crandall-Dilcher|
-Pomerance ... primes p N; this conjecture predicts, for each integer A, an
asymptotic formula for the number of primes p ≤ X, p N, for which p + 1 − #E(Fp)
= A, cf.