Can All Coefficients in a Continued Fraction Be the Same Integer?

  • Thread starter Thread starter Klaus_Hoffmann
  • Start date Start date
  • Tags Tags
    Fractions
Klaus_Hoffmann
Messages
85
Reaction score
1
Hi, my question is given the recurrence relation for the convergents, could we construct a continued fraction so..

\alpha = a_{0}+ \frac{b_{0}}{a_{1}+\frac{b_{1}}{a_{2}}+...

all the coefficients a's and b's are equal to a certain integer ?

for example if all the coefficients (numerators and denomiators)

* are one we have just the Fibonacci (Golden ratio) constant \frac{2}{\sqrt 5 -1}

* are two we have exactly \sqrt 2 +1

i the sense that expanding the 2 numbers above their continued fraction is made only by 1 or 2, but can we construct a general continued fraction with all the numbers equal to 3,4,5,6,...
 
Physics news on Phys.org
Klaus_Hoffmann said:
Hi, my question is given the recurrence relation for the convergents, could we construct a continued fraction so..

\alpha = a_{0}+ \frac{b_{0}}{a_{1}+\frac{b_{1}}{a_{2}}+...

all the coefficients a's and b's are equal to a certain integer ?

for example if all the coefficients (numerators and denomiators)

* are one we have just the Fibonacci (Golden ratio) constant \frac{2}{\sqrt 5 -1}

* are two we have exactly \sqrt 2 +1

i the sense that expanding the 2 numbers above their continued fraction is made only by 1 or 2, but can we construct a general continued fraction with all the numbers equal to 3,4,5,6,...
Something doesn't seem right. If making all the a's and b's 1 gives the Fibonacci (golden ratio) constant, wouldn't making all the a's and b's 2 simply be 2 times the Golden ration rather than \sqrt 2 + 1.

Postscript. On the other hand: It seemed to me that any similar manner of construction a continued fraction will give an irrational number of some fixed value which would be a multiple of the continued fraction comprising only ones, but then n/n = 1 so I guess I made a mistake. Anyway at least the numbers are completely predefined.
 
Last edited:
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top