scholarly journals Demonstration of a Technique to Construct a One-to-One Correspondence Between N and the infinite binary decimals in (0, 1).

2021 ◽  
Author(s):  
Ron Ragusa

In this paper we will see how by varying the initial conditions of the demonstration we can use Cantor’s method to produce a one-to-one correspondence between the set of natural numbers and the set of infinite binary decimals in the open interval (0, 1).

2020 ◽  
Author(s):  
Ron Ragusa

In 1891 Georg Cantor published his Diagonal Argument which, he asserted, proved that the real numbers cannot be put into a one-to-one correspondence with the natural numbers. In this paper we will see how by varying the initial conditions of the demonstration we can use Cantor’s method to produce a one-to-one correspondence between the set of natural numbers and the set of infinite binary decimals in the open interval (0, 1).


2020 ◽  
Author(s):  
Ron Ragusa

In 1891 Georg Cantor published his Diagonal Method which, he asserted, proved that the real numbers cannot be put into a one-to-one correspondence with the natural numbers. In this paper we will see how by varying the initial conditions of Cantor’s proof we can use the diagonal method to produce a one-to-one correspondence between the set of natural numbers and the set of infinite binary decimals in the interval (0, 1). In the appendix we demonstrate that using the diagonal method recursively will, at the limit of the process, fully account for all the infinite binary decimals in (0, 1). The proof will cement the one-to-one correspondence between the natural numbers and the infinite binary decimals in (0, 1).


Author(s):  
Susan D'Agostino

“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.


1966 ◽  
Vol 18 ◽  
pp. 616-620 ◽  
Author(s):  
Kenneth D. Magill

It is assumed that all topological spaces discussed in this paper are Hausdorff. By a compactification αX of a space X we mean a compact space containing X as a dense subspace. If, for some positive integer n, αX — X consists of n points, we refer to αX as an n-point compactification of X, in which case we use the notation αn X. If αX — X is countable, we refer to αX as a countable compactification of X. In this paper, the statement that a set is countable means that its elements are in one-to-one correspondence with the natural numbers. In particular, finite sets are not regarded as being countable. Those spaces with n-point compactifications were characterized in (3). From the results obtained there it followed that the only n-point compactifications of the real line are the well-known 1- and 2-point compactifications and the only n-point compactification of the Euclidean N-space, EN (N > 1), is the 1-point compactification.


2014 ◽  
Vol 25 (7) ◽  
pp. 1520-1545 ◽  
Author(s):  
VERÓNICA BECHER ◽  
SERGE GRIGORIEFF

We prove some results on the Wadge order on the space of sets of natural numbers endowed with Scott topology, and more generally, on omega-continuous domains. Using alternating decreasing chains we characterize the property of Wadge hardness for the classes of the Hausdorff difference hierarchy (iterated differences of open sets). A similar characterization holds for Wadge one-to-one and finite-to-one completeness. We consider the same questions for the effectivization of the Wadge relation. We also show that for the space of sets of natural numbers endowed with the Scott topology, in each class of the Hausdorff difference hierarchy there are two strictly increasing chains of Wadge degrees of sets properly in that class. The length of these chains is the rank of the considered class, and each element in one chain is incomparable with all the elements in the other chain.


1950 ◽  
Vol 1 ◽  
pp. 49-58 ◽  
Author(s):  
Kôsaku Yosida

Let q (x) be real and continuous in the infinite open interval (- ∞, ∞) and let y1(x, λ), y2(x, λ) be the solutions of(1.1) with the initial conditions(1.2) .


10.37236/3053 ◽  
2014 ◽  
Vol 21 (1) ◽  
Author(s):  
Abraham Isgur ◽  
Vitaly Kuznetsov ◽  
Mustazee Rahman ◽  
Stephen Tanny

We apply a tree-based methodology to solve new, very broadly defined families of nested recursions of the general form $R(n)=\sum_{t=1}^k R(n-a_t-\sum_{i=1}^{p}R(n-b_{ti}))$, where $a_t$ are integers, $b_{ti}$ are natural numbers, and $k,p$ are natural numbers that we use to denote "arity" and "order," respectively, and with some specified initial conditions. The key idea of the tree-based solution method is to associate such recursions with infinite labelled trees in a natural way so that the solution to the recursions solves a counting question relating to the corresponding trees. We characterize certain recursion families within $R(n)$ by introducing "simultaneous parameters" that appear both within the recursion itself and that also specify structural properties of the corresponding tree. First, we extend and unify recently discovered results concerning two families of arity $k=2$, order $p=1$ recursions. Next, we investigate the solution of nested recursion families by taking linear combinations of solution sequence frequencies for simpler nested recursions, which correspond to superpositions of the associated trees; this leads us to identify and solve two new recursion families for arity $k=2$ and general order $p$. Finally, we extend these results to general arity $k>2$. We conclude with several related open problems.


2009 ◽  
Vol 2 (4) ◽  
pp. 612-646 ◽  
Author(s):  
PAOLO MANCOSU

Cantor’s theory of cardinal numbers offers a way to generalize arithmetic from finite sets to infinite sets using the notion of one-to-one association between two sets. As is well known, all countable infinite sets have the same ‘size’ in this account, namely that of the cardinality of the natural numbers. However, throughout the history of reflections on infinity another powerful intuition has played a major role: if a collection A is properly included in a collection B then the ‘size’ of A should be less than the ‘size’ of B (part–whole principle). This second intuition was not developed mathematically in a satisfactory way until quite recently. In this article I begin by reviewing the contributions of some thinkers who argued in favor of the assignment of different sizes to infinite collections of natural numbers (Thabit ibn Qurra, Grosseteste, Maignan, Bolzano). Then, I review some recent mathematical developments that generalize the part–whole principle to infinite sets in a coherent fashion (Katz, Benci, Di Nasso, Forti). Finally, I show how these new developments are important for a proper evaluation of a number of positions in philosophy of mathematics which argue either for the inevitability of the Cantorian notion of infinite number (Gödel) or for the rational nature of the Cantorian generalization as opposed to that, based on the part–whole principle, envisaged by Bolzano (Kitcher).


Author(s):  
Iharantsoa Vero Raharinirina

In this paper we consider cryptographic applications of the arithmetic on the hyperoctahedral group. On an appropriate subgroup of the latter, we particularly propose to construct public key cryptosystems based on the discrete logarithm. The fact that the group of signed permutations has rich properties provides fast and easy implementation and makes these systems resistant to attacks like the Pohlig-Hellman algorithm. The only negative point is that storing and transmitting permutations need large memory. Using together the hyperoctahedral enumeration system and what is called subexceedant functions, we define a one-to-one correspondence between natural numbers and signed permutations with which we label the message units.


2009 ◽  
Vol 07 (supp01) ◽  
pp. 221-228 ◽  
Author(s):  
FRANCESCO A. RAFFA ◽  
MARIO RASETTI

We investigate the expression of natural numbers in any base from a quantum point of view. In particular, resorting to the one-to-one correspondence between natural numbers and Fock states, we construct a set of multiboson operators and a set of translation operators, whose action on the Fock states leads to the coefficients identifying a natural number in any base.


Sign in / Sign up

Export Citation Format

Share Document