Finding all rationals in a given range using Stern-Brocot tree











up vote
1
down vote

favorite












I know the Stern-Brocot tree lists out all the possible fractions. But how do I enumerate the fractions that are present in $[a, b]$ where $a$ and $b$ are two fractions.










share|cite|improve this question




















  • 1




    Between any two distinct real numbers, it would be impossible to list out all of the possible fractions due to their density in the real numbers (vaguely, there are infinitely many fractions between any two distinct numbers). Perhaps you can provide more context within your post?
    – Clayton
    Mar 29 at 18:41












  • @Clayton They can be enumerated with an infinite list.
    – Mike Earnest
    Mar 29 at 18:44










  • Say I want to find all rationals between 1 and 1/2. Is there a particular pattern or design that we have to follow in the tree structure to list them out? I understand that the pattern would be infinitely long.
    – Free Radical
    Mar 29 at 18:44










  • Do you mean that you would like a formula that would iterate through all the rationals number in this interval? It is possible because the set of rationals is countable. You could look at proofs of: $mathbb Q$ is countable
    – Max Ft
    Mar 29 at 18:45






  • 1




    Yeah, something like that if it is possible. I was wondering if all rationals in a particular range follow some pattern in the Stern-Brocot tree/series
    – Free Radical
    Mar 29 at 18:47















up vote
1
down vote

favorite












I know the Stern-Brocot tree lists out all the possible fractions. But how do I enumerate the fractions that are present in $[a, b]$ where $a$ and $b$ are two fractions.










share|cite|improve this question




















  • 1




    Between any two distinct real numbers, it would be impossible to list out all of the possible fractions due to their density in the real numbers (vaguely, there are infinitely many fractions between any two distinct numbers). Perhaps you can provide more context within your post?
    – Clayton
    Mar 29 at 18:41












  • @Clayton They can be enumerated with an infinite list.
    – Mike Earnest
    Mar 29 at 18:44










  • Say I want to find all rationals between 1 and 1/2. Is there a particular pattern or design that we have to follow in the tree structure to list them out? I understand that the pattern would be infinitely long.
    – Free Radical
    Mar 29 at 18:44










  • Do you mean that you would like a formula that would iterate through all the rationals number in this interval? It is possible because the set of rationals is countable. You could look at proofs of: $mathbb Q$ is countable
    – Max Ft
    Mar 29 at 18:45






  • 1




    Yeah, something like that if it is possible. I was wondering if all rationals in a particular range follow some pattern in the Stern-Brocot tree/series
    – Free Radical
    Mar 29 at 18:47













up vote
1
down vote

favorite









up vote
1
down vote

favorite











I know the Stern-Brocot tree lists out all the possible fractions. But how do I enumerate the fractions that are present in $[a, b]$ where $a$ and $b$ are two fractions.










share|cite|improve this question















I know the Stern-Brocot tree lists out all the possible fractions. But how do I enumerate the fractions that are present in $[a, b]$ where $a$ and $b$ are two fractions.







fractions






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 29 at 18:53

























asked Mar 29 at 18:39









Free Radical

18311




18311








  • 1




    Between any two distinct real numbers, it would be impossible to list out all of the possible fractions due to their density in the real numbers (vaguely, there are infinitely many fractions between any two distinct numbers). Perhaps you can provide more context within your post?
    – Clayton
    Mar 29 at 18:41












  • @Clayton They can be enumerated with an infinite list.
    – Mike Earnest
    Mar 29 at 18:44










  • Say I want to find all rationals between 1 and 1/2. Is there a particular pattern or design that we have to follow in the tree structure to list them out? I understand that the pattern would be infinitely long.
    – Free Radical
    Mar 29 at 18:44










  • Do you mean that you would like a formula that would iterate through all the rationals number in this interval? It is possible because the set of rationals is countable. You could look at proofs of: $mathbb Q$ is countable
    – Max Ft
    Mar 29 at 18:45






  • 1




    Yeah, something like that if it is possible. I was wondering if all rationals in a particular range follow some pattern in the Stern-Brocot tree/series
    – Free Radical
    Mar 29 at 18:47














  • 1




    Between any two distinct real numbers, it would be impossible to list out all of the possible fractions due to their density in the real numbers (vaguely, there are infinitely many fractions between any two distinct numbers). Perhaps you can provide more context within your post?
    – Clayton
    Mar 29 at 18:41












  • @Clayton They can be enumerated with an infinite list.
    – Mike Earnest
    Mar 29 at 18:44










  • Say I want to find all rationals between 1 and 1/2. Is there a particular pattern or design that we have to follow in the tree structure to list them out? I understand that the pattern would be infinitely long.
    – Free Radical
    Mar 29 at 18:44










  • Do you mean that you would like a formula that would iterate through all the rationals number in this interval? It is possible because the set of rationals is countable. You could look at proofs of: $mathbb Q$ is countable
    – Max Ft
    Mar 29 at 18:45






  • 1




    Yeah, something like that if it is possible. I was wondering if all rationals in a particular range follow some pattern in the Stern-Brocot tree/series
    – Free Radical
    Mar 29 at 18:47








1




1




Between any two distinct real numbers, it would be impossible to list out all of the possible fractions due to their density in the real numbers (vaguely, there are infinitely many fractions between any two distinct numbers). Perhaps you can provide more context within your post?
– Clayton
Mar 29 at 18:41






Between any two distinct real numbers, it would be impossible to list out all of the possible fractions due to their density in the real numbers (vaguely, there are infinitely many fractions between any two distinct numbers). Perhaps you can provide more context within your post?
– Clayton
Mar 29 at 18:41














@Clayton They can be enumerated with an infinite list.
– Mike Earnest
Mar 29 at 18:44




@Clayton They can be enumerated with an infinite list.
– Mike Earnest
Mar 29 at 18:44












Say I want to find all rationals between 1 and 1/2. Is there a particular pattern or design that we have to follow in the tree structure to list them out? I understand that the pattern would be infinitely long.
– Free Radical
Mar 29 at 18:44




Say I want to find all rationals between 1 and 1/2. Is there a particular pattern or design that we have to follow in the tree structure to list them out? I understand that the pattern would be infinitely long.
– Free Radical
Mar 29 at 18:44












Do you mean that you would like a formula that would iterate through all the rationals number in this interval? It is possible because the set of rationals is countable. You could look at proofs of: $mathbb Q$ is countable
– Max Ft
Mar 29 at 18:45




Do you mean that you would like a formula that would iterate through all the rationals number in this interval? It is possible because the set of rationals is countable. You could look at proofs of: $mathbb Q$ is countable
– Max Ft
Mar 29 at 18:45




1




1




Yeah, something like that if it is possible. I was wondering if all rationals in a particular range follow some pattern in the Stern-Brocot tree/series
– Free Radical
Mar 29 at 18:47




Yeah, something like that if it is possible. I was wondering if all rationals in a particular range follow some pattern in the Stern-Brocot tree/series
– Free Radical
Mar 29 at 18:47










1 Answer
1






active

oldest

votes

















up vote
2
down vote













Repeatedly interleaving mediants (as in the original Stern Brocot tree) should work. See https://arxiv.org/pdf/1301.6807.pdf






share|cite|improve this answer





















  • right, we have just to use $a$ and $b$ as the starting "parents" and then the mediant chain will provide the Stern-Brocot tree in between, i.e. all the rationals in the interval $[a,b]$.
    – G Cab
    Nov 23 at 23:50











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2713692%2ffinding-all-rationals-in-a-given-range-using-stern-brocot-tree%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
2
down vote













Repeatedly interleaving mediants (as in the original Stern Brocot tree) should work. See https://arxiv.org/pdf/1301.6807.pdf






share|cite|improve this answer





















  • right, we have just to use $a$ and $b$ as the starting "parents" and then the mediant chain will provide the Stern-Brocot tree in between, i.e. all the rationals in the interval $[a,b]$.
    – G Cab
    Nov 23 at 23:50















up vote
2
down vote













Repeatedly interleaving mediants (as in the original Stern Brocot tree) should work. See https://arxiv.org/pdf/1301.6807.pdf






share|cite|improve this answer





















  • right, we have just to use $a$ and $b$ as the starting "parents" and then the mediant chain will provide the Stern-Brocot tree in between, i.e. all the rationals in the interval $[a,b]$.
    – G Cab
    Nov 23 at 23:50













up vote
2
down vote










up vote
2
down vote









Repeatedly interleaving mediants (as in the original Stern Brocot tree) should work. See https://arxiv.org/pdf/1301.6807.pdf






share|cite|improve this answer












Repeatedly interleaving mediants (as in the original Stern Brocot tree) should work. See https://arxiv.org/pdf/1301.6807.pdf







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Nov 23 at 23:37









ttw

26124




26124












  • right, we have just to use $a$ and $b$ as the starting "parents" and then the mediant chain will provide the Stern-Brocot tree in between, i.e. all the rationals in the interval $[a,b]$.
    – G Cab
    Nov 23 at 23:50


















  • right, we have just to use $a$ and $b$ as the starting "parents" and then the mediant chain will provide the Stern-Brocot tree in between, i.e. all the rationals in the interval $[a,b]$.
    – G Cab
    Nov 23 at 23:50
















right, we have just to use $a$ and $b$ as the starting "parents" and then the mediant chain will provide the Stern-Brocot tree in between, i.e. all the rationals in the interval $[a,b]$.
– G Cab
Nov 23 at 23:50




right, we have just to use $a$ and $b$ as the starting "parents" and then the mediant chain will provide the Stern-Brocot tree in between, i.e. all the rationals in the interval $[a,b]$.
– G Cab
Nov 23 at 23:50


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2713692%2ffinding-all-rationals-in-a-given-range-using-stern-brocot-tree%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

To store a contact into the json file from server.js file using a class in NodeJS

Redirect URL with Chrome Remote Debugging Android Devices

Dieringhausen