Classical Arithmetization

2019 ◽  
pp. 26-50
Author(s):  
John Stillwell
Keyword(s):  
Number System ◽  
Rational Numbers ◽  
Continuous Functions ◽  
Complex Numbers ◽  
Natural Numbers ◽  
Infinite Sums ◽  
Why Questions

This chapter describes how one proceeds from natural to rational numbers, then to real and complex numbers, and to continuous functions—thus arithmetizing the foundations of analysis and geometry. The definitions of integers and rational numbers show why questions about them can, in principle, be reduced to questions about natural numbers and their addition and multiplication. This is what it means to say that the natural numbers are a foundation for the integer and rational numbers. But the next steps in the arithmetization project go beyond algebra. By admitting sets of rational numbers, one can enlarge the number system to one that admits certain infinite operations, such as forming infinite sums. This is crucial to building a foundation for analysis. As such, the chapter turns to the foundations of the natural numbers themselves, the “Peano axioms,” which gives a first glimpse of the logic underlying the arithmetization project.

Not so rational: A more natural way to understand the ANS

2021 ◽  
Vol 44 ◽  
Author(s):  
Eli Hecht ◽  
Tracey Mills ◽  
Steven Shin ◽  
Jonathan Phillips
Keyword(s):  
Number System ◽  
Rational Numbers ◽  
Approximate Number System ◽  
Natural Numbers ◽  
Wide Range ◽  
Natural Way

Abstract In contrast to Clarke and Beck's claim that that the approximate number system (ANS) represents rational numbers, we argue for a more modest alternative: The ANS represents natural numbers, and there are separate, non-numeric processes that can be used to represent ratios across a wide range of domains, including natural numbers.

1. Numbers and algebra

2015 ◽  
pp. 1-10
Author(s):  
Peter M. Higgins
Keyword(s):  
Fundamental Theorem ◽  
Common Factor ◽  
Number System ◽  
Rational Numbers ◽  
Euclidean Algorithm ◽  
Greatest Common Divisor ◽  
Natural Numbers ◽  
Division Algorithm ◽  
Fundamental Theorem Of Arithmetic ◽  
And Algebra

‘Numbers and algebra’ introduces the number system and explains several terms used in algebra, including natural numbers, positive and negative integers, rational numbers, number factorization, the Fundamental Theorem of Arithmetic, Euclid’s Lemma, the Division Algorithm, and the Euclidean Algorithm. It proves that any common factor c of a and b is also a factor of any number of the form ax + by, and since the greatest common divisor (gcd) of a and b has this form, which may be found by reversing the steps of the Euclidean Algorithm, it follows that any common factor c of a and b divides their gcd d.

What's Between Q and R

1967 ◽  
Vol 60 (4) ◽  
pp. 308-314
Author(s):  
James Fey
Keyword(s):  
Mathematics Instruction ◽  
Rational Numbers ◽  
Complex Numbers ◽  
Valuable Insight ◽  
Natural Numbers ◽  
Real Numbers ◽  
The Real ◽  
Number Systems ◽  
Insight Into ◽  
Structure Properties

Among the objectives of school mathematics instruction, one of the most important is to develop understanding of the structure, properties, and evolution of the number systems. The student who knows the need for, and the technique of, each extension from the natural numbers through the complex numbers has a valuable insight into mathematics. Of the steps in the development, that from the rational numbers to the real numbers is the trickiest.

Contents of the approximate number system

2021 ◽  
Vol 44 ◽  
Author(s):  
Jack C. Lyons
Keyword(s):  
Number System ◽  
Rational Numbers ◽  
Approximate Number System ◽  
Natural Numbers

Abstract Clarke and Beck argue that the approximate number system (ANS) represents rational numbers, like 1/3 or 3.5. I think this claim is not supported by the evidence. Rather, I argue, ANS should be interpreted as representing natural numbers and ratios among them; and we should view the contents of these representations are genuinely approximate.

scholarly journals Avoiding Fractional Powers over the Natural Numbers

10.37236/6678 ◽  
2018 ◽  
Vol 25 (2) ◽  
Author(s):  
Lara Pudwell ◽  
Eric Rowland
Keyword(s):  
Fixed Point ◽  
Rational Numbers ◽  
Finite Alphabet ◽  
Its Sequence ◽  
Natural Numbers ◽  
Fractional Powers ◽  
Free Word

We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closely related to one. For example, the lexicographically least $7/4$-power-free word is a fixed point of a $50847$-uniform morphism. We identify the structure of the lexicographically least $a/b$-power-free word for three infinite families of rationals $a/b$ as well many "sporadic" rationals that do not seem to belong to general families. To accomplish this, we develop an automated procedure for proving $a/b$-power-freeness for morphisms of a certain form, both for explicit and symbolic rational numbers $a/b$. Finally, we establish a connection to words on a finite alphabet. Namely, the lexicographically least $27/23$-power-free word is in fact a word on the finite alphabet $\{0, 1, 2\}$, and its sequence of letters is $353$-automatic.

scholarly journals The Riemann Hypothesis is most likely true

2021 ◽  
Author(s):  
Frank Vega
Keyword(s):  
Zeta Function ◽  
Riemann Zeta Function ◽  
Riemann Hypothesis ◽  
Complex Numbers ◽  
Natural Numbers ◽  
Chebyshev Function ◽  
The Riemann Zeta Function ◽  
Riemann Zeta ◽  
Sum Of Divisors

In mathematics, the Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part $\frac{1}{2}$. The Riemann hypothesis belongs to the David Hilbert's list of 23 unsolved problems and it is one of the Clay Mathematics Institute's Millennium Prize Problems. The Robin criterion states that the Riemann hypothesis is true if and only if the inequality $\sigma(n)< e^{\gamma } \times n \times \log \log n$ holds for all natural numbers $n> 5040$, where $\sigma(x)$ is the sum-of-divisors function and $\gamma \approx 0.57721$ is the Euler-Mascheroni constant. The Nicolas criterion states that the Riemann hypothesis is true if and only if the inequality $\prod_{q \leq q_{n}} \frac{q}{q-1} > e^{\gamma} \times \log\theta(q_{n})$ is satisfied for all primes $q_{n}> 2$, where $\theta(x)$ is the Chebyshev function. Using both inequalities, we show that the Riemann hypothesis is most likely true.

The number sense does not represent numbers, but cardinality comparisons

2021 ◽  
Vol 44 ◽  
Author(s):  
José Luis Bermúdez
Keyword(s):  
Experimental Evidence ◽  
Number Sense ◽  
Number System ◽  
Rational Numbers ◽  
Approximate Number System

Abstract Against Clarke and Beck's proposal that the approximate number system (ANS) represents natural and rational numbers, I suggest that the experimental evidence is better accommodated by the (much weaker) thesis that the ANS represents cardinality comparisons. Cardinality comparisons do not stand in arithmetical relations and being able to apply them does not involve basic arithmetical concepts and operations.

Complex Numbers with Three Radix Expansions

1982 ◽  
Vol 34 (6) ◽  
pp. 1335-1348 ◽  
Author(s):  
William J. Gilbert
Keyword(s):  
Complex Numbers ◽  
Natural Numbers ◽  
Gaussian Integers

1. Introduction. This paper deals with the lack of uniqueness of the representations of the complex numbers in positional notation using Gaussian integers as bases.Kátai and Szabó [3] proved that all the complex numbers can be written in radix form using the base –n + i with the natural numbers 0, 1, 2, …, n2 as digits. They remarked that they did not assert the uniqueness of these representations but gave no further indications of any multiple expansions. The geometry of these complex bases [2] indicates that some numbers have two expansions in a given base, while a few numbers even have three different expansions.

scholarly journals The Riemann Hypothesis Is True

2021 ◽  
Author(s):  
Frank Vega
Keyword(s):  
Zeta Function ◽  
Riemann Zeta Function ◽  
Riemann Hypothesis ◽  
Complex Numbers ◽  
Natural Numbers ◽  
Chebyshev Function ◽  
The Riemann Zeta Function ◽  
Riemann Zeta ◽  
Sum Of Divisors

The Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part $\frac{1}{2}$. The Riemann hypothesis belongs to the David Hilbert's list of 23 unsolved problems. Besides, it is one of the Clay Mathematics Institute's Millennium Prize Problems. This problem has remained unsolved for many years. The Robin criterion states that the Riemann hypothesis is true if and only if the inequality $\sigma(n)< e^{\gamma } \times n \times \log \log n$ holds for all natural numbers $n>5040$, where $\sigma(x)$ is the sum-of-divisors function and $\gamma \approx 0.57721$ is the Euler-Mascheroni constant. The Nicolas criterion states that the Riemann hypothesis is true if and only if the inequality $\prod_{q \leq q_{n}} \frac{q}{q-1}>e^{\gamma} \times \log\theta(q_{n})$ is satisfied for all primes $q_{n}>2$, where $\theta(x)$ is the Chebyshev function. Using both inequalities, we show that the Riemann hypothesis is true.

Sign in / Sign up

Export Citation Format

Share Document