{"docId":450,"paperId":450,"url":"https:\/\/dmtcs.episciences.org\/450","doi":"10.46298\/dmtcs.450","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":86,"name":"Vol. 11 no. 1"}],"section":[{"sid":2,"title":"Analysis of Algorithms","description":[]}],"repositoryName":"Hal","repositoryIdentifier":"lirmm-00374066","repositoryVersion":1,"repositoryLink":"https:\/\/hal.science\/lirmm-00374066v1","dateSubmitted":"2015-03-26 16:20:17","dateAccepted":"2015-06-09 14:47:07","datePublished":"2009-03-01 08:00:00","titles":{"en":"Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System"},"authors":["Berthe, Valerie","Imbert, Laurent"],"abstracts":{"0":"Analysis of Algorithms","en":"A partition of $x > 0$ of the form $x = \\sum_i 2^{a_i}3^{b_i}$ with distinct parts is called a double-base expansion of $x$. Such a representation can be obtained using a greedy approach, assuming one can efficiently compute the largest \\mbox{$\\{2,3\\}$-integer}, i.e., a number of the form $2^a3^b$, less than or equal to $x$. In order to solve this problem, we propose an algorithm based on continued fractions in the vein of the Ostrowski number system, we prove its correctness and we analyse its complexity. In a second part, we present some experimental results on the length of double-base expansions when only a few iterations of our algorithm are performed."},"keywords":["[INFO.INFO-DM] Computer Science [cs]\/Discrete Mathematics [cs.DM]"]}