Models for Rational Number Bases

1975 ◽  
Vol 68 (2) ◽  
pp. 113-123
Author(s):  
Jean J. Pedersen ◽  
Frank O. Armbruster

We think it’s important that you have some background on how this article came to be written. One of the authors sometimes plays a game he invented, called “hats,” in which he puts on a funny hat and converts base-ten numerals into another base representation. For example, he puts on a beanie and calls for anyone to say a favorite number. Someone says “six.” He goes to the chalkboard and writes “110,” The object of the game is for the students to figure out what he is doing, Someone who figures it out says, “Gotcha!” And then that person gets to wear the hat until someone else says, “Gotcha!” (In case you haven’t “got it” yet, the beanie hat converts numbers to the binary representation.) Several hats are used in the course of play, and each represents a different number base, but it’s always a natural number base greater than one. Recently we began to wonder if perhaps you can have a negative number base system in which the base is not an integer. And if you can, what will the numerals look like?

2004 ◽  
Vol 10 (3) ◽  
pp. 390-418 ◽  
Author(s):  
Lou Van Den Dries ◽  
Yiannis N. Moschovakis

The Euclidean algorithm on the natural numbers ℕ = {0,1,…} can be specified succinctly by the recursive programwhere rem(a, b) is the remainder in the division of a by b, the unique natural number r such that for some natural number q,It is an algorithm from (relative to) the remainder function rem, meaning that in computing its time complexity function cε (a, b), we assume that the values rem(x, y) are provided on demand by some “oracle” in one “time unit”. It is easy to prove thatMuch more is known about cε(a, b), but this simple-to-prove upper bound suggests the proper formulation of the Euclidean's (worst case) optimality among its peers—algorithms from rem:Conjecture. If an algorithm α computes gcd (x,y) from rem with time complexity cα (x,y), then there is a rational number r > 0 such that for infinitely many pairs a > b > 1, cα (a,b) > r log2a.


1990 ◽  
Vol 41 (1) ◽  
pp. 151-158 ◽  
Author(s):  
Peter Hagis ◽  
Graeme L. Cohen

The infinitary divisors of a natural number n are the products of its divisors of the , where py is an exact prime-power divisor of n and (where yα = 0 or 1) is the binary representation of y. Infinitary harmonic numbers are those for which the infinitary divisors have integer harmonic mean. One of the results in this paper is that the number of infinitary harmonic numbers not exceeding x is less than 2.2 x1/2 2(1+ε)log x/log log x for any ε > 0 and x > n0(ε). A corollary is that the set of infinitary perfect numbers (numbers n whose proper infinitary divisors sum to n) has density zero.


1981 ◽  
Vol 10 (130) ◽  
Author(s):  
David W. Matula ◽  
Peter Kornerup

We develop the concept of minimum weight binary continued fraction representation of a rational number as an extension of minimum weight binary radix representation of an integer. The relation of these representations to the attainment of optimum efficiency in the shift and add or subtract model of binary computer arithmetic is discussed.


2020 ◽  
Vol 3 (1) ◽  
pp. 8
Author(s):  
Boris Tsirelson

Contrary to popular misconception, the question in the title is far from simple. It involves sets of numbers on the first level, sets of sets of numbers on the second level, and so on, endlessly. The infinite hierarchy of the levels involved distinguishes the concept of "definable number" from such notions as "natural number", "rational number", "algebraic number", "computable number" etc.


Algorithms ◽  
2019 ◽  
Vol 12 (8) ◽  
pp. 159 ◽  
Author(s):  
Isamu Furuya ◽  
Takuya Kida

In this study, we address the problem of compaction of Church numerals. Church numerals are unary representations of natural numbers on the scheme of lambda terms. We propose a novel decomposition scheme from a given natural number into an arithmetic expression using tetration, which enables us to obtain a compact representation of lambda terms that leads to the Church numeral of the natural number. For natural number n, we prove that the size of the lambda term obtained by the proposed method is O ( ( slog 2 n ) ( log n / log log n ) ) . Moreover, we experimentally confirmed that the proposed method outperforms binary representation of Church numerals on average, when n is less than approximately 10,000 .


1993 ◽  
Vol 16 (2) ◽  
pp. 373-383 ◽  
Author(s):  
Graeme L. Cohen ◽  
Peter Hagis

The infinitary divisors of a natural numbernare the products of its divisors of the formpyα2α, wherepyis a prime-power component ofnand∑αyα2α(whereyα=0or1) is the binary representation ofy. In this paper, we investigate the infinitary analogues of such familiar number theoretic functions as the divisor sum function, Euler's phi function and the Möbius function.


Author(s):  
SHAMIK DAS ◽  
ANUPAM SAIKIA

The notion of $\theta $ -congruent numbers is a generalisation of congruent numbers where one considers triangles with an angle $\theta $ such that $\cos \theta $ is a rational number. In this paper we discuss a criterion for a natural number to be $\theta $ -congruent over certain real number fields.


2015 ◽  
Vol 107 (3) ◽  
pp. 537-555 ◽  
Author(s):  
Andreas Obersteiner ◽  
Jo Van Hoof ◽  
Lieven Verschaffel ◽  
Wim Van Dooren

Sign in / Sign up

Export Citation Format

Share Document