Related papers: On one number-theoretic conception: towards a new …
In the present paper we generalize the Eulerian numbers (also of the second and third orders). The generalization is connected with an autonomous first-order differential equation, solutions of which are used to obtain integral…
In this note, we study a class of random subsets of positive integers induced by Bernoulli random variables. We obtain sufficient conditions such that the random set is almost surely lacunary, does not have bounded gaps and contains…
We present the model theoretic concepts that allow mathematics to be developed with the notion of the potential infinite instead of the actual infinite. The potential infinite is understood as a dynamic notion, being an indefinitely…
In the present paper and as an application of Roth's theorem concerning the rational approximation of algebraic numbers, we give a sufficient condition that will assure us that a sum, product and quotient of some series of positive rational…
Summation formulas, such as the Euler-Maclaurin expansion or Gregory's quadrature, have found many applications in mathematics, ranging from accelerating series, to evaluating fractional sums and analyzing asymptotics, among others. We show…
The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…
In intuitionistic mathematics, the Brouwer Continuity Theorem states that all total real functions are (uniformly) continuous on the unit interval. We study this theorem and related principles from the point of view of Reverse Mathematics…
As far as algebraic properties are concerned, the usual addition on the class of ordinal numbers is not really well behaved; for example, it is not commutative, nor left cancellative etc. In a few cases, the natural Hessemberg sum is a…
Schanuel has pointed out that there are mathematically interesting categories whose relationship to the ring of integers is analogous to the relationship between the category of finite sets and the semi-ring of non-negative integers. Such…
The paper introduces the notion of the size of countable sets that preserves the Part-Whole Principle and generalizes the notion of the cardinality of finite sets. The sizes of natural numbers, integers, rational numbers, and all their…
Using an application of Schmidt's Subspace Theorem, this paper gives new transcendence criteria for rapidly converging infinite products of algebraic numbers. The paper also improves existing criteria for irrationality of products and…
We present a self-contained analysis of infinity from two mathematical perspectives: set theory and algebra. We begin with cardinal and ordinal numbers, examining deep questions such as the continuum hypothesis, along with foundational…
We introduce new generalizations of the Bernoulli, Euler, and Genocchi polynomials and numbers based on the Carlitz-Tsallis degenerate exponential function and concepts of the Umbral Calculus associated with it. Also, we present…
The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…
This is a leisurely introductory account addressed to non-experts and based on previous work by the authors, on how methods borrowed from physics can be used to "count" an infinite number of points. We begin with the classical case of…
In this article we propose a general method of obtaining infinite sums of products with functions that count patterns in numbers.
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
We present several sequences of Euler sums involving odd harmonic numbers. The calculational technique is based on proper two-valued integer functions, which allow to compute these sequences explicitly in terms of zeta values only.
We put forward a new method of constructing the complete ordered field of real numbers from the ordered field of rational numbers. Our method is a generalization of that of A. Knopfmacher and J. Knopfmacher. Our result implies that there…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…