scholarly journals A simple proof of Euler's continued fraction of e1/M

2016 ◽  
Vol 100 (548) ◽  
pp. 279-287
Author(s):  
Joseph Tonien
Keyword(s):  
Simple Proof ◽  
Continued Fraction ◽  
Infinite Continued Fraction ◽  
Image Position ◽  
Positive Integers

A continued fraction is an expression of the formand we will denote it by the notation [f0, (g0, f1), (g1, f2), (g2, f3), … ]. If the numerators gi are all equal to 1 then we will use a shorter notation [f0, f1, f2, f3, … ]. A simple continued fraction is a continued fraction with all the gi coefficients equal to 1 and with all the fi coefficients positive integers except perhaps f0.The finite continued fraction [f0, (g0, f1), (g1, f2),…, (gk–1, fk)] is called the k th convergent of the infinite continued fraction [f0, (g0, f1), (g1, f2),…]. We defineif this limit exists and in this case we say that the infinite continued fraction converges.

scholarly journals GENERALIZED CONTINUED FRACTION EXPANSIONS WITH CONSTANT PARTIAL DENOMINATORS

2018 ◽  
Vol 107 (02) ◽  
pp. 272-288
Author(s):  
TOPI TÖRMÄ
Keyword(s):  
Positive Integer ◽  
Real Number ◽  
Continued Fraction ◽  
Positive Real Number ◽  
Rational Numbers ◽  
Positive Real ◽  
Image Position ◽  
Fixed Positive Integer ◽  
Continued Fraction Expansions ◽  
Positive Integers

We study generalized continued fraction expansions of the form $$\begin{eqnarray}\frac{a_{1}}{N}\frac{}{+}\frac{a_{2}}{N}\frac{}{+}\frac{a_{3}}{N}\frac{}{+}\frac{}{\cdots },\end{eqnarray}$$ where $N$ is a fixed positive integer and the partial numerators $a_{i}$ are positive integers for all $i$ . We call these expansions $\operatorname{dn}_{N}$ expansions and show that every positive real number has infinitely many $\operatorname{dn}_{N}$ expansions for each $N$ . In particular, we study the $\operatorname{dn}_{N}$ expansions of rational numbers and quadratic irrationals. Finally, we show that every positive real number has, for each $N$ , a $\operatorname{dn}_{N}$ expansion with bounded partial numerators.

scholarly journals Application of Wynn's epsilon algorithm to periodic continued fractions

1987 ◽  
Vol 30 (2) ◽  
pp. 295-299 ◽  
Author(s):  
M. J. Jamieson
Keyword(s):  
Continued Fractions ◽  
Continued Fraction ◽  
Rational Numbers ◽  
Quadratic Surd ◽  
Partial Quotients ◽  
Infinite Continued Fraction ◽  
Image Position ◽  
Epsilon Algorithm ◽  
Periodic Continued Fractions

The infinite continued fractionin whichis periodic with period l and is equal to a quadratic surd if and only if the partial quotients, ak, are integers or rational numbers [1]. We shall also assume that they are positive. The transformation discussed below applies only to pure periodic fractions where n is zero.

Some properties of the continued fraction expansion of (m/n) e1/q

1970 ◽  
Vol 67 (1) ◽  
pp. 67-74 ◽  
Author(s):  
K. R. Matthews ◽  
R. F. C. Walters
Keyword(s):  
Continued Fractions ◽  
Continued Fraction ◽  
Continued Fraction Expansion ◽  
Image Position ◽  
Positive Integers

Introduction. Continued fractions of the form are called Hurwitzian if b1, …, bh, are positive integers, ƒ1(x), …, ƒk(x) are polynomials with rational coefficients which take positive integral values for x = 0, 1, 2, …, and at least one of the polynomials is not constant. f1(x), …, fk(x) are said to form a quasi-period.

On the Lower Range of Perron's Modular Function

1969 ◽  
Vol 21 ◽  
pp. 808-816 ◽  
Author(s):  
J. R. Kinney ◽  
T. S. Pitcher
Keyword(s):  
Finite Number ◽  
Continued Fraction ◽  
Modular Function ◽  
Finite Collection ◽  
Continued Fraction Expansion ◽  
Lower Range ◽  
Image Position ◽  
Positive Integers

The modular function Mwas introduced by Perron in (6). M(ξ) (for irrational ξ) is denned by the property that the inequalityis satisfied by an infinity of relatively prime pairs (p, q)for positive d,but by at most a finite number of such pairs for negative d.We will writefor the continued fraction expansion of ξ ∈ (0, 1) and for any finite collection y1,…, ykof positive integers we will writeIt is known (see 6) thatWhere

A Combinatorial Interpretation of Ramanujan's Continued Fraction

1968 ◽  
Vol 11 (3) ◽  
pp. 405-408 ◽  
Author(s):  
G. Szekeres
Keyword(s):  
Continued Fraction ◽  
Present Note ◽  
Combinatorial Interpretation ◽  
Image Position ◽  
Positive Integers ◽  
Ramanujan's Continued Fraction

The purpose of the present note is to give a combinatorial interpretation of the coefficients of expansion of the Ramanujan continued fraction ([1], p. 295)The result is expressed by formula (12) below.The enumeration of distinct score vectors of a tournament leads to the following problem: (Erdős and Moser, see Moon [2], p. 68). Given n ≥ 1, k ≥ 0, determine the number of distinct sequences of positive integers

scholarly journals A Note on Continued Fractions

1960 ◽  
Vol 12 ◽  
pp. 303-308 ◽  
Author(s):  
A. Oppenheim
Keyword(s):  
Real Number ◽  
Continued Fractions ◽  
Continued Fraction ◽  
Continued Fraction Expansion ◽  
Quadratic Irrational ◽  
Image Position ◽  
Positive Integers ◽  
Periodic Continued Fractions

Any real number y leads to a continued fraction of the type(1)where ai, bi are integers which satisfy the inequalities(2)by means of the algorithm(3)the a's being assigned positive integers. The process terminates for rational y; the last denominator bk satisfying bk ≥ ak + 1. For irrational y, the process does not terminate. For a preassigned set of numerators ai ≥ 1, this C.F. development of y is unique; its value being y.Bankier and Leighton (1) call such fractions (1), which satisfy (2), proper continued fractions. Among other questions, they studied the problem of expanding quadratic surds in periodic continued fractions. They state that “it is well-known that not only does every periodic regular continued fraction represent a quadratic irrational, but the regular continued fraction expansion of a quadratic irrational is periodic.

scholarly journals The Divisibility of Divisor Functions

1961 ◽  
Vol 5 (1) ◽  
pp. 35-40 ◽  
Author(s):  
R. A. Rankin
Keyword(s):  
Positive Integer ◽  
Divisor Functions ◽  
Image Position ◽  
Positive Integers

For any positive integers n and v letwhere d runs through all the positive divisors of n. For each positive integer k and real x > 1, denote by N(v, k; x) the number of positive integers n ≦ x for which σv(n) is not divisible by k. Then Watson [6] has shown that, when v is odd,as x → ∞; it is assumed here and throughout that v and k are fixed and independent of x. It follows, in particular, that σ (n) is almost always divisible by k. A brief account of the ideas used by Watson will be found in § 10.6 of Hardy's book on Ramanujan [2].

scholarly journals Monochromatic solutions to equations with unit fractions

1991 ◽  
Vol 43 (3) ◽  
pp. 387-392 ◽  
Author(s):  
Tom C. Brown ◽  
Voijtech Rödl
Keyword(s):  
Solutions To Equations ◽  
Unit Fractions ◽  
Image Position ◽  
Positive Integers

Our main result is that if G(x1, …, xn) = 0 is a system of homogeneous equations such that for every partition of the positive integers into finitely many classes there are distinct y1,…, yn in one class such that G(y1, …, yn) = 0, then, for every partition of the positive integers into finitely many classes there are distinct Z1, …, Zn in one class such thatIn particular, we show that if the positive integers are split into r classes, then for every n ≥ 2 there are distinct positive integers x1, x1, …, xn in one class such thatWe also show that if [1, n6 − (n2 − n)2] is partitioned into two classes, then some class contains x0, x1, …, xn such that(Here, x0, x2, …, xn are not necessarily distinct.)

Analogue of a theorem of Khintchine in fields of formal power series

1966 ◽  
Vol 62 (4) ◽  
pp. 637-642 ◽  
Author(s):  
T. W. Cusick
Keyword(s):  
Power Series ◽  
Positive Constant ◽  
Classical Result ◽  
Real Numbers ◽  
Linear Forms ◽  
Absolute Value ◽  
The Difference ◽  
Image Position ◽  
Formal Power ◽  
Positive Integers

For a real number λ, ‖λ‖ is the absolute value of the difference between λ and the nearest integer. Let X represent the m-tuple (x1, x2, … xm) and letbe any n linear forms in m variables, where the Θij are real numbers. The following is a classical result of Khintchine (1):For all pairs of positive integers m, n there is a positive constant Г(m, n) with the property that for any forms Lj(X) there exist real numbers α1, α2, …, αn such thatfor all integers x1, x2, …, xm not all zero.

Central Limit Theorems for Interchangeable Processes

1958 ◽  
Vol 10 ◽  
pp. 222-229 ◽  
Author(s):  
J. R. Blum ◽  
H. Chernoff ◽  
M. Rosenblatt ◽  
H. Teicher
Keyword(s):  
Stochastic Process ◽  
Probability Measure ◽  
Central Limit ◽  
Joint Distribution ◽  
Limit Theorems ◽  
Random Variables ◽  
Central Limit Theorems ◽  
Probability Measures ◽  
Image Position ◽  
Positive Integers

Let {Xn} (n = 1, 2 , …) be a stochastic process. The random variables comprising it or the process itself will be said to be interchangeable if, for any choice of distinct positive integers i 1, i 2, H 3 … , ik, the joint distribution of depends merely on k and is independent of the integers i 1, i 2, … , i k. It was shown by De Finetti (3) that the probability measure for any interchangeable process is a mixture of probability measures of processes each consisting of independent and identically distributed random variables.

Sign in / Sign up

Export Citation Format

Share Document