Does there exist a real number 0 < x < 1 with decimal representation x = 0 . a 1 a 2 a 3 … that can be written as the continued fraction as below?
x = a 1 + a 3 + a 5 + ⋱ a 6 a 4 a 2 1
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Interesting, I wonder if this constant has a name.
If every second digit is a 1, then how come there is a pair of consecutive 2's and a pair of consecutive 3's?
Log in to reply
When the continued fraction contained a 23, later a 122 and also a 33, I just added them to the end of the number. Actually, it's not rigorous...
@Henry U Hello!!! You can check this out........!!!
Log in to reply
Cool, I didn't know that these numbers have a name and that there are a few different ones! It's also interesting to see that the terms of their continued fractions are always less than 10.
Makes me wonder if T n > 1 and n is finite.
Log in to reply
Since x ≈ 0 . 2 7 3 9 4 4 1 9 5 7 3 9 2 7 1 6 1 7 1 7 1 can be written as the continued fraction
x = 7 + 9 + 4 + 9 + ⋱ 1 4 3 2 ,
the continued fraction
x ′ = 1 + x = 1 + 7 + 9 + 4 + 9 + ⋱ 1 4 3 2
will correspond to
x ′ = 1 + x ≈ 1 . 2 7 3 9 4 4 1 9 .
The same thing can be done to generate Trott constants of any arbitrary size and therefore there are infinitely many.
However, I don't know if there are finitely or infinitely many Trott constants between 0 and 1.
Log in to reply
@Henry U – Ah, true. But what about not having a term outside of the fraction; it seems like cheating.
Log in to reply
@Blan Morrison – This is the only other source I found and it also says that it is unknown how many Trott constants exist. It's probably an open problem.
@Henry U
–
Yeah....this also works.....I had thought about this too......:)
@Blan Morrison
But, hey, even Wolfram Alpha cheated........check out the Third Trott Constant.......even tho it is a zero outside the fraction, it still counts...... :p
Note that your format requires that the top most numerator is 1 (and not the first digit of the decimal), whereas the Trott constants have a slightly different definition.
Log in to reply
Do you think there arre still numbers that satisfy this?
Log in to reply
I believe the answer is no, but am not fully certain. This is how I approached it:
First, to determine a 1 , observe a 1 + fractional part 1 is a decreasing sequence and 0 . a 1 is an increasing sequence, hence there is a unique solution. In particular, we must have a 1 = 3 , and the decimal will be between 3 1 ≈ 0 . 3 3 and 4 1 ≈ 0 . 2 5 . (Alternatively, just list the values of 1 1 , 2 1 , 3 1 , … and compare, as I'm going to do below.
Next, to determine
a
2
, observe that
0
.
2
5
<
3
+
1
+
fractional part
1
1
<
0
.
2
8
5
7
0
.
2
8
5
7
<
3
+
2
+
fractional part
1
1
<
0
.
3
0
.
3
<
3
+
3
+
fractional part
1
1
<
0
.
3
0
7
7
0
.
3
0
7
7
<
3
+
4
+
fractional part
1
1
<
0
.
3
1
2
5
and clearly
3
+
5
+
any part
1
1
<
0
.
3
3
3
.
Hence, there is no possible value for
a
2
.
Let me know if you agree, and I will update the answer to no.
Log in to reply
@Calvin Lin – I definetly agree, and I also think that this is a better problem than the one about Trott constants because it isn't known much about them. Prooving there are no solutions is better in this case.
Log in to reply
@Henry U – Oh, I just realized that I misread your problem.
The first Trott constant T 1 = 0 . 1 0 8 4 1 … satisfies your problem doesn't it? It starts with a 1 (though a 2 = 0 might seem iffy, but that isn't disallowed.)
I had changed the answer to no, and then changed it back to yes.
Can you post the "all numerators = 1" version of this problem?
Log in to reply
@Calvin Lin – I will right now. Thanks for the help!
Log in to reply
@Henry U – Argh, I still misread the problem. The 1 in your numerator isn't used in the problem, so T 1 doesn't work. At this point in time, I'm not quite sure if a solution exists.
My guess is yes, and it is done by iteratively finding the value that works, similar to what I did for the all 1's version. The crux is to show that this can always be done, which seems somewhat reasonable to me, but I haven't checked the details.
Log in to reply
@Calvin Lin – I think that you made an error when correcting the problem because, apparently, 105% of people got the problem correct.
Problem Loading...
Note Loading...
Set Loading...
x ≈ 0 . 2 7 3 9 4 4 1 9 5 7 3 9 2 7 1 6 1 7 1 7 1 is one example.
As @Blan Morrison pointed out, the previous example wasn't quite valid; thanks to @Aaghaz Mahajan for showing this page from Wolfram Mathworld where such constants are called Trott constants.