Have You Read …?

1969 ◽  
Vol 62 (3) ◽  
pp. 220-221
Author(s):  
Philip Peak

One of the basic principles we follow in our teaching is to relate new ideas with old ideas. Dr. Forbes has done just this in his article about extending the concept of rational numbers to real numbers. He points out how this extension cannot follow the same pattern as that of extensions positive to negative integers or from integers to rationals. If we look to a definition for motivating the extension we at best can only say, “Some polynomial equations have no rational number solutions and do have some real number solutions.” We might use least-upperbound idea, or we might try motivating through nonperiodic infinite decimals. However, Dr. Forbes rejects all of these and makes the tie-in through a geometric approach.

1969 ◽  
Vol 34 (2) ◽  
pp. 207-214 ◽  
Author(s):  
N. Z. Shapiro

Let ƒ be a real number. It is well known [7] that the set of rational numbers which are less than ƒ is a recursive set if and only if ƒ is representable as the limit of a recursive, recursively convergent sequence of rational numbers. In this paper we replace the condition that the set of rational numbers less than ƒ is recursive by the condition that this set is at various points in the Kleene hierarchy, and we replace the recursive, recursively convergent limit by a variety of other recursive limiting processes.


2012 ◽  
Vol 96 (537) ◽  
pp. 408-414
Author(s):  
Daniel Shiu ◽  
Peter Shiu

Suppose that we have a computing machine that can only deal with the operations of addition, subtraction and multiplication, but not division, of integers. Can such a machine be used to find the decimal expansion of a given real number α to an arbitrary length? The answer is ‘yes’, at least in the sense that α is the limit of a sequence of rational numbers, and one can obtain the decimal expansion of a positive rational number a/b without division. For example, for any positive k, we try all non-negative c < b and d < 10ka, and see if 10ka = db + c. There will be success because all we are doing is reducing 10ka modulo b in a particularly moronic way. This guarantees the existence and uniqueness of d, and d/10k is then the desired expansion. Take, for example, = and k = 12; then, after a tedious search, we should find that, for c = 3, there is d = 230 769 230 769 because 3 × 1012 = 230769230769 × 13 + 3, so that = 0.230769230769 + × 10-12. Such a procedure of searching for c, d is hopelessly inefficient, of course, and a more efficient method is given in the next section.


2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
WonTae Hwang ◽  
Kyunghwan Song

Abstract We prove that the integer part of the reciprocal of the tail of $\zeta (s)$ ζ ( s ) at a rational number $s=\frac{1}{p}$ s = 1 p for any integer with $p \geq 5$ p ≥ 5 or $s=\frac{2}{p}$ s = 2 p for any odd integer with $p \geq 5$ p ≥ 5 can be described essentially as the integer part of an explicit quantity corresponding to it. To deal with the case when $s=\frac{2}{p}$ s = 2 p , we use a result on the finiteness of integral points of certain curves over $\mathbb{Q}$ Q .


2018 ◽  
Vol 7 (1) ◽  
pp. 77-83
Author(s):  
Rajendra Prasad Regmi

There are various methods of finding the square roots of positive real number. This paper deals with finding the principle square root of positive real numbers by using Lagrange’s and Newton’s interpolation method. The interpolation method is the process of finding the values of unknown quantity (y) between two known quantities.


2012 ◽  
Vol 18 (3) ◽  
pp. 189

This call for manuscripts is requesting articles that address how to make sense of rational numbers in their myriad forms, including as fractions, ratios, rates, percentages, and decimals.


2013 ◽  
Vol 21 (2) ◽  
pp. 115-125
Author(s):  
Yuichi Futa ◽  
Hiroyuki Okazaki ◽  
Daichi Mizushima ◽  
Yasunari Shidama

Summary Gaussian integer is one of basic algebraic integers. In this article we formalize some definitions about Gaussian integers [27]. We also formalize ring (called Gaussian integer ring), Z-module and Z-algebra generated by Gaussian integer mentioned above. Moreover, we formalize some definitions about Gaussian rational numbers and Gaussian rational number field. Then we prove that the Gaussian rational number field and a quotient field of the Gaussian integer ring are isomorphic.


2014 ◽  
Vol 11 (01) ◽  
pp. 39-49 ◽  
Author(s):  
Bin Wei

Let f be a holomorphic cusp form of weight k for SL(2, ℤ) with Fourier coefficients λf(n). We study the sum ∑n>0λf(n)ϕ(n/X)e(αn), where [Formula: see text]. It is proved that the sum is rapidly decaying for α close to a rational number a/q where q2 < X1-ε. The main techniques used in this paper include Dirichlet's rational approximation of real numbers, a Voronoi summation formula for SL(2, ℤ) and the asymptotic expansion for Bessel functions.


2009 ◽  
Vol 51 (2) ◽  
pp. 243-252
Author(s):  
ARTŪRAS DUBICKAS

AbstractLetx0<x1<x2< ⋅⋅⋅ be an increasing sequence of positive integers given by the formulaxn=⌊βxn−1+ γ⌋ forn=1, 2, 3, . . ., where β > 1 and γ are real numbers andx0is a positive integer. We describe the conditions on integersbd, . . .,b0, not all zero, and on a real number β > 1 under which the sequence of integerswn=bdxn+d+ ⋅⋅⋅ +b0xn,n=0, 1, 2, . . ., is bounded by a constant independent ofn. The conditions under which this sequence can be ultimately periodic are also described. Finally, we prove a lower bound on the complexity function of the sequenceqxn+1−pxn∈ {0, 1, . . .,q−1},n=0, 1, 2, . . ., wherex0is a positive integer,p>q> 1 are coprime integers andxn=⌈pxn−1/q⌉ forn=1, 2, 3, . . . A similar speculative result concerning the complexity of the sequence of alternatives (F:x↦x/2 orS:x↦(3x+1)/2) in the 3x+1 problem is also given.


2011 ◽  
Vol 54 (1) ◽  
pp. 127-132 ◽  
Author(s):  
TOUFIK ZAIMI

AbstractLet θ be a real number greater than 1, and let (()) be the fractional part function. Then, θ is said to be a Z-number if there is a non-zero real number λ such that ((λθn)) < for all n ∈ ℕ. Dubickas (A. Dubickas, Even and odd integral parts of powers of a real number, Glasg. Math. J., 48 (2006), 331–336) showed that strong Pisot numbers are Z-numbers. Here it is proved that θ is a strong Pisot number if and only if there exists λ ≠ 0 such that ((λα)) < for all$\alpha \in \{ \theta ^{n}\mid n\in \mathbb{N}\} \cup \{ \sum\nolimits_{n=0}^{N}\theta ^{n}\mid \mathit{\}N\in \mathbb{N}\}$. Also, the following characterisation of Pisot numbers among real numbers greater than 1 is shown: θ is a Pisot number ⇔ ∃ λ ≠ 0 such that$\Vert \lambda \alpha \Vert <\frac{1}{% 3}$for all$\alpha \in \{ \sum\nolimits_{n=0}^{N}a_{n}\theta ^{n}\mid$an ∈ {0,1}, N ∈ ℕ}, where ‖λα‖ = min{((λα)), 1 − ((λα))}.


Sign in / Sign up

Export Citation Format

Share Document