OurBigBook
About
$
Donate
Sign in
Sign up
Positive generalized continued fraction
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Number theory
Diophantine approximation
Continued fraction
Created
2026-09-24
Updated
2026-11-05
0
Like
0 By others
on same topic
0 Discussions
Create my own version
For positive
a
j
,
b
j
,
define
p
0
=
a
0
,
p
−
1
=
1
,
q
0
=
1
,
q
−
1
=
0
and
p
j
=
a
j
p
j
−
1
+
b
j
−
1
p
j
−
2
,
q
j
=
a
j
q
j
−
1
+
b
j
−
1
q
j
−
2
.
(1)
Then
(
p
n
q
n
b
n
p
n
−
1
b
n
q
n
−
1
)
=
∏
j
=
0
n
(
a
j
1
b
j
0
)
,
(2)
and
p
n
/
q
n
is the corresponding finite generalized
continued fraction
.
Table of contents
Convergence of a positive simple continued fraction
Positive generalized continued fraction
All-one continued fraction and Fibonacci ratios
Convergence of a positive simple continued fraction
Convergence of a positive simple continued fraction
0
0
0
Positive generalized continued fraction
When
b
j
=
1
and
a
j
are positive
integers
, adjacent convergents satisfy
p
n
q
n
−
1
−
q
n
p
n
−
1
=
(
−
1
)
n
+
1
.
(1)
Even and odd convergents are monotone from opposite sides, their separation is
1/
(
q
n
q
n
+
1
)
, and
q
n
→
∞
. They therefore have
a
common limit
x
, with
q
n
p
n
−
x
+
q
n
+
1
p
n
+
1
−
x
=
q
n
q
n
+
1
1
.
(2)
All-one continued fraction and Fibonacci ratios
0
0
0
Convergence of a positive simple continued fraction
If every
a
j
=
b
j
=
1
, then
p
n
=
F
n
+
2
and
q
n
=
F
n
+
1
. Binet'
s
formula
F
n
=
5
ϕ
n
−
ψ
n
,
ϕ
=
2
1
+
5
,
ψ
=
−
ϕ
−
1
,
(1)
shows that the convergents tend to
ϕ
and gives sharp scaled errors through
F
n
+
1
−
ϕ
F
n
=
ψ
n
.
Ancestors
(6)
Continued fraction
Diophantine approximation
Number theory
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2024
/
ii
/
Paper 2
/
11G
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version