✦ LIBER ✦

A number-theoretic class of weak Bernoulli transformations

✍ Scribed by S. M. Rudolfer; K. M. Wilkinson

Publisher: Springer
Year: 1973
Tongue: English
Weight: 534 KB
Volume: 7
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01824802

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On isomorphism of weak Bernoulli transfo

On isomorphism of weak Bernoulli transformations

✍ N.A. Friedman; D.S. Ornstein 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 991 KB

A number-theoretic game

✍ Prithvi Ramesh 📂 Article 📅 2003 🏛 Indian Academy of Sciences 🌐 English ⚖ 232 KB

Decidable classes of number-theoretic se

Decidable classes of number-theoretic sentences

✍ I. J. Heath 📂 Article 📅 1969 🏛 John Wiley and Sons 🌐 English ⚖ 507 KB

DECIDABLE CLASSES OF NUMBER-THEORETIC SENTENCES by I. J. HEATH in Leicester (England) A. Method of Construction 1. Limited Constituents Terminology. Let h ' denote the class of natural numbers 0, 1 , 2 , . . . We say that P ( x l , . . . , x,) is a predicate if P : N" -+ ( 0 , l}, and that f(xl, . .

The eigenstructure of the number theoret

The eigenstructure of the number theoretic transforms

✍ D.T. Birtwistle 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 504 KB

On discrete Fourier transforms (number-t

On discrete Fourier transforms (number-theoretic transforms) with minimum number of rotations (shifts)

✍ P. Duhamel; H. Hollmann 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Applications of a Recurrence for the Ber

Applications of a Recurrence for the Bernoulli Numbers

✍ F.T. Howard 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 416 KB

We give an easy proof of a recently published recurrence for the Bernoulli numbers and we present some applications of the recurrence. One of the applications is a simple proof of the well-known Staudt-Clausen Theorem. Proofs are also given for theorems of Carlitz. Frobenius, and Ramanujan. An analo