Pell's equation without irrational numbers

We solve Pell's equation in a simple way without continued fractions or irrational numbers, and relate the algorithm to the Stern Brocot tree.Comment: 10 pages, 3 figures added some references, fixed typos, added remarks on Speeding up the algorith

Revisiting Digital Straight Segment Recognition

This paper presents new results about digital straight segments, their recognition and related properties. They come from the study of the arithmetically based recognition algorithm proposed by I. Debled-Rennesson and J.-P. Reveill\`es in 1995 [Debled95]. We indeed exhibit the relations describing the possible changes in the parameters of the digital straight segment under investigation. This description is achieved by considering new parameters on digital segments: instead of their arithmetic description, we examine the parameters related to their combinatoric description. As a result we have a better understanding of their evolution during recognition and analytical formulas to compute them. We also show how this evolution can be projected onto the Stern-Brocot tree. These new relations have interesting consequences on the geometry of digital curves. We show how they can for instance be used to bound the slope difference between consecutive maximal segments

Child’s addition in the Stern–Brocot tree

AbstractWe use child’s addition and cross-differencing to discover significant relationships for diagonals, paths and branches within the Stern–Brocot tree and the Stern–Brocot sequence. This allows us to develop results for continued fraction summation under child’s addition

Monotone and Consistent discretization of the Monge-Ampere operator

We introduce a novel discretization of the Monge-Ampere operator, simultaneously consistent and degenerate elliptic, hence accurate and robust in applications. These properties are achieved by exploiting the arithmetic structure of the discrete domain, assumed to be a two dimensional cartesian grid. The construction of our scheme is simple, but its analysis relies on original tools seldom encountered in numerical analysis, such as the geometry of two dimensional lattices, and an arithmetic structure called the Stern-Brocot tree. Numerical experiments illustrate the method's efficiency

Exact arithmetic on the Stern–Brocot tree

AbstractIn this paper we present the Stern–Brocot tree as a basis for performing exact arithmetic on rational numbers. There exists an elegant binary representation for positive rational numbers based on this tree [Graham et al., Concrete Mathematics, 1994]. We will study this representation by investigating various algorithms to perform exact rational arithmetic using an adaptation of the homographic and the quadratic algorithms that were first proposed by Gosper for computing with continued fractions. We will show generalisations of homographic and quadratic algorithms to multilinear forms in n variables. Finally, we show an application of the algorithms for evaluating polynomials