Some help with a continued fraction?

  • Thread starter Thread starter csprof2000
  • Start date Start date
  • Tags Tags
    Fraction
csprof2000
Messages
286
Reaction score
0
I wasn't exactly sure where to put this, so I decided to try this section. It may be more appropriate to put this in the Calculus / Analysis section... I don't know.

Can anybody tell me whether or not it's possible to find the value of the continued fraction

0 + 1 / (2 + 3 / (4 + 5 / (6 + 7 / (...))))

I wrote a relatively simple program to calculate partial fractions... when I go up to the nth odd number, I get this sequence:

1
0.2
0.428571
0.372549
0.38057
0.379654
0.379738
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732

When I go up to the nth even integer, I get:

0
0.5
0.363636
0.381579
0.379562
0.379745
0.379731
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732
0.379732

So it looks like it converges... to something.

Does anybody know of a way to (a) determine whether it actually converges to anything and (b) find this value analytically, in closed form?

Just a curiosity...

P.S. I know that most continued fractions like this don't have a closed form, I just thought this one was of interest because it seems so simple... just the numbers, you know.

Thanks!
 
Physics news on Phys.org
Nice...
 
There's a comment on Sloane's http://www.research.att.com/~njas/sequences/A113014 that the constant is equal to

sqrt(2e/pi)/erfi(1/sqrt(2)) - 1
 
Last edited by a moderator:
##\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