scholarly journals Teoretyczne podstawy dzielenia z resztą liczb naturalnych wraz z uwagami o dzieleniu z resztą liczb całkowitych, wymiernych i rzeczywistych

2020 ◽  
Vol 11 ◽  
pp. 63-72
Author(s):  
Antoni Chronowski
Keyword(s):  
School Mathematics ◽  
Natural Numbers ◽  
Real Numbers ◽  
Theoretical Foundations ◽  
Division With Remainder

In this article, I analyze the theoretical foundations of the division with remainder in the arithmetic of natural numbers. As a result of this analysis I justify that the notation a:b=c r s, where a, b, c, s are natural numbers and r denotes, is correct at school mathematics level and does not lead to a contrediction suggested by the author of the article (Semadeni, 1978). As a generalization of the division with remainder of natural numbers, I consider the division with remainder of integers, rational and real numbers.

Proceed with care, because some infinities are larger than others

2020 ◽  
pp. 281-292
Author(s):  
Susan D'Agostino
Keyword(s):  
Number Line ◽  
Mathematics Students ◽  
Natural Numbers ◽  
Real Numbers ◽  
Countable Infinity ◽  
One To One ◽  
Infinite Set

“Proceed with care, because some infinities are larger than others” explains in detail why the infinite set of real numbers—all of the numbers on the number line—represents a far larger infinity than the infinite set of natural numbers—the counting numbers. Readers learn to distinguish between countable infinity and uncountable infinity by way of a method known as a “one-to-one correspondence.” Mathematics students and enthusiasts are encouraged to proceed with care in both mathematics and life, lest they confuse countable infinity with uncountable infinity, large with unfathomably large, or order with disorder. At the chapter’s end, readers may check their understanding by working on a problem. A solution is provided.

An Editor Recalls Some Hopeless Papers

1998 ◽  
Vol 4 (1) ◽  
pp. 1-16 ◽  
Author(s):  
Wilfrid Hodges
Keyword(s):  
Natural Numbers ◽  
Real Numbers ◽  
Diagonal Argument ◽  
The One ◽  
Academy Of Sciences ◽  
Main Message

§1. Introduction. I dedicate this essay to the two-dozen-odd people whose refutations of Cantor's diagonal argument (I mean the one proving that the set of real numbers and the set of natural numbers have different cardinalities) have come to me either as referee or as editor in the last twenty years or so. Sadly these submissions were all quite unpublishable; I sent them back with what I hope were helpful comments. A few years ago it occurred to me to wonder why so many people devote so much energy to refuting this harmless little argument—what had it done to make them angry with it? So I started to keep notes of these papers, in the hope that some pattern would emerge.These pages report the results. They might be useful for editors faced with similar problem papers, or even for the authors of the papers themselves. But the main message to reach me is that there are several points of basic elementary logic that we usually teach and explain very badly, or not at all.In 1995 an engineer named William Dilworth, who had published a refutation of Cantor's argument in the Transactions of the Wisconsin Academy of Sciences, Arts and Letters, sued for libel a mathematician named Underwood Dudley who had called him a crank ([9] pp. 44f, 354).

Inconsistency of uncountable infinite sets under ZFC framework

Kybernetes ◽  
2008 ◽  
Vol 37 (3/4) ◽  
pp. 453-457 ◽  
Author(s):  
Wujia Zhu ◽  
Yi Lin ◽  
Guoping Du ◽  
Ningsheng Gong
Keyword(s):  
Natural Number ◽  
Set Theory ◽  
Design Methodology ◽  
Natural Numbers ◽  
Real Numbers ◽  
Conceptual Approach ◽  
Content Type ◽  
Infinite Sets ◽  
Axiomatic Set Theory ◽  
First Time

PurposeThe purpose is to show that all uncountable infinite sets are self‐contradictory non‐sets.Design/methodology/approachA conceptual approach is taken in the paper.FindingsGiven the fact that the set N={x|n(x)} of all natural numbers, where n(x)=df “x is a natural number” is a self‐contradicting non‐set in this paper, the authors prove that in the framework of modern axiomatic set theory ZFC, various uncountable infinite sets are either non‐existent or self‐contradicting non‐sets. Therefore, it can be astonishingly concluded that in both the naive set theory or the modern axiomatic set theory, if any of the actual infinite sets exists, it must be a self‐contradicting non‐set.Originality/valueThe first time in history, it is shown that such convenient notion as the set of all real numbers needs to be reconsidered.

scholarly journals 0-Sum and 1-Sum Flows in Regular Graphs

10.37236/4986 ◽  
2016 ◽  
Vol 23 (2) ◽  
Author(s):  
S. Akbari ◽  
M. Kano ◽  
S. Zare
Keyword(s):  
Regular Graph ◽  
Regular Graphs ◽  
Natural Numbers ◽  
Real Numbers ◽  
Even Order

Let $G$ be a graph. Assume that $l$ and $k$ are two natural numbers. An $l$-sum flow on a graph $G$ is an assignment of non-zero real numbers to the edges of $G$ such that for every vertex $v$ of $G$ the sum of values of all edges incidence with $v$ equals $l$. An $l$-sum $k$-flow is an $l$-sum flow with values from the set $\{\pm 1,\ldots ,\pm(k-1)\}$. Recently, it was proved that for every $r, r\geq 3$, $r\neq 5$, every $r$-regular graph admits a $0$-sum $5$-flow. In this paper we settle a conjecture by showing that every $5$-regular graph admits a $0$-sum $5$-flow. Moreover, we prove that every $r$-regular graph of even order admits a $1$-sum $5$-flow.

scholarly journals Canonical Set Theory for Classic Mathematics: A Linear Order on Finite Groups and Structures, with A Natural Extension To Infinite Structures

2021 ◽  
Author(s):  
Juan Pablo Ramírez
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Linear Order ◽  
Natural Extension ◽  
Natural Numbers ◽  
Real Numbers ◽  
Tree Structures ◽  
Mathematical Objects ◽  
Finite Group Theory ◽  
Block Form

We provide an axiomatic base for the set of natural numbers, that has been proposed as a canonical construction, and use this definition of $\mathbb N$ to find several results on finite group theory. Every finite group $G$, is well represented with a natural number $N_G$; if $N_G=N_H$ then $H,G$ are in the same isomorphism class. We have a linear order on all finite groups, that is well behaved with respect to cardinality. In fact, if $H,G$ are two finite groups such that $|H|=m<n=|G|$, then $H<\mathbb Z_n\leq G$. Internally, there is also a canonical order for the elements of any finite group $G$, and we find equivalent objects. This allows us to find the automorphisms of $G$. The Cayley table of $G$ takes canonical block form, and a minimal set of independent equations that define the group is obtained. Examples are given, using all groups with less than ten elements, to illustrate the procedure for finding all groups of $n$ elements, and we order them externally and internally. The canonical block form of the symmetry group $\Delta_4$ is given and we find its automorphisms. These results are extended to the infinite case. A real number is an infinite set of natural numbers. A real function is a set of real numbers, and a sequence of real functions $f_1,f_2,\ldots$ is well represented by a set of real numbers, also. We make brief mention on the calculus of real numbers. In general, we are able to represent mathematical objects using the smallest possible data-type. In the last section, mathematical objects of all types are well assigned to tree structures. We conclude with comments on type theory and future work on computational and physical aspects of these representations.

Real Numbers and Natural Numbers

2004 ◽  
pp. 1-30
Author(s):  
Mariano Giaquinta ◽  
Giuseppe Modica
Keyword(s):  
Natural Numbers ◽  
Real Numbers

TOWARDS THEORETICAL FOUNDATIONS OF SOFT COMPUTING APPLICATIONS

1995 ◽  
Vol 03 (03) ◽  
pp. 341-373 ◽  
Author(s):  
HUNG T. NGUYEN ◽  
VLADIK KREINOVICH
Keyword(s):  
Fuzzy Logic ◽  
Soft Computing ◽  
Degrees Of Belief ◽  
Real Numbers ◽  
Computing Methodologies ◽  
Original Idea ◽  
Theoretical Foundations

The original idea of fuzzy logic and other soft computing methodologies was to handle the situations in which our knowledge is not precise. Usually, real numbers are used to describe degrees of belief. In practice, only approximate values of the degrees of belief are known, while the existing soft computing formalisms are usually based on the assumption that we know the exact values of these degrees. This difference creates a gap between the theory and applications. In this paper, we outline the theoretical foundations aimed at bridging this gap.

On virtual classes and real numbers

1950 ◽  
Vol 15 (2) ◽  
pp. 131-134
Author(s):  
R. M. Martin
Keyword(s):  
Standard Procedure ◽  
Homogeneous System ◽  
Alternative Methods ◽  
Natural Numbers ◽  
Real Numbers ◽  
The Real ◽  
Virtual Class ◽  
Virtual Classes ◽  
Main Ideas

In a simple, applied functional calculus of first order (i.e., one admitting no functional variables but at least one functional constant), abstracts or schematic expressions may be introduced to play the role of variables over designatable sets or classes. The entities or quasi-entities designated or quasi-designated by such abstracts may be called, following Quine, virtual classes and relations. The notion of virtual class is always relative to a given formalism and depends upon what functional constants are taken as primitive. The first explicit introduction of a general notation for virtual classes (relative to a given formalism) appears to be D4.1 of the author's A homogeneous system for formal logic. That paper develops a system admitting only individuals as values for variables and is adequate for the theory of general recursive functions of natural numbers. Numbers and functions are in fact identified with certain kinds of virtual classes and relations.In the present paper it will be shown how certain portions of the theory of real numbers can be constructed upon the basis of the theory of virtual classes and relations of H.L.The method of building up the real numbers to be employed is essentially an adaptation of standard procedure. Although the main ideas underlying this method are well known, the mirroring of these ideas within the framework of the restricted concepts admitted here presents possibly some novelty. In particular, a basis for the real numbers is provided which in no way admits classes or relations or other "abstract" objects as values for variables. Presupposing the natural numbers, the essential steps are to construct the simple rationals as virtual dyadic relations between natural numbers, to construct the generalized or signed rationals as virtual tetradic relations among natural numbers, and then to formulate a notation for real numbers as virtual classes (of a certain kind) of generalized rationals. Of course, there are several alternative methods. This procedure, however, appears to correspond more to the usual one.

scholarly journals On the metric theory of the optimal continued fraction expansion

1997 ◽  
Vol 56 (1) ◽  
pp. 69-79
Author(s):  
R. Nair
Keyword(s):  
Lebesgue Measure ◽  
Continued Fraction ◽  
Natural Numbers ◽  
Real Numbers ◽  
Continued Fraction Expansion ◽  
Image Position ◽  
Special Case

Suppose kn denotes either φ(n) or φ(rn) (n = 1, 2, …) where the polynomial φ maps the natural numbers to themselves and rk denotes the kth rational prime. Let denote the sequence of convergents to a real numbers x for the optimal continued fraction expansion. Define the sequence of approximation constants byIn this paper we study the behaviour of the sequence for all most all x with respect to Lebesgue measure. In the special case where kn = n (n = 1, 2, …) these results are due to Bosma and Kraaikamp.

Sign in / Sign up

Export Citation Format

Share Document