# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Computation of tangent, Euler, and Bernoulli numbers. (English) Zbl 0178.04401
The tangent numbers $T_n$, Euler numbers $E_n$, and Bernoulli numbers $B_n$ are defined to be the coefficients in the following power series $$\tan z=\sum_{n\ge 0} T_nz^n/z!,\qquad \sec z=\sum_{n\ge 0} E_nz^n/z!,\qquad z/(e^z-1)=\sum_{n\ge 0} B_nz^n/z!.$$ The authors discuss traditional recurrence relations used for calculating these numbers, and then proceed to develop calculating techniques more suitable for modern binary computers based on new recurrence relations which are derived through simple trigonometric identities. Two theorems are given about the periodicity of $T_n$ and $E_n$ modulo an odd prime $p$. A table is given for the integers $T_n$ and $E_n$ $(n\le 120)$ and for the numbers $B_n$ $(n\le 250)$. The $B_n$ ar given in the Staudt-Clausen form $B_{2n}=C_{2n}-\sum 1/p$ where the $C_{2n}$ are integers and the summation runs over all primes $p$ such that $(p-1)$ divides $2n$. The authors have deposited a copy of the values of $T_n$ $(n\le 835)$, $E_n$ $(n\le 808)$ and $B_n$ $(n\le 836)$ in the Unpublished Mathematical Tables of Math. Comput.
Reviewer: T. R. Parkin

##### MSC:
 11Y16 Algorithms; complexity (number theory) 11B68 Bernoulli and Euler numbers and polynomials
Full Text: