Related papers: On functions without a normal order

We present a new sieve that allows us to find the prime numbers by using only regular patterns and, more importantly, avoiding any duplication of elements between them.

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…

In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.

Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…

Ramanujan investigated maximal order for the number of divisors function by introducing some notion such as (superior) highly composite numbers. He also studied maximal order for other arithmetic functions including the sum of powers of…

The well known Erdos-Turan law states that the logarithm of an order of a random permutation is asymptotically normally distributed. The aim of this work is to estimate convergence rate in this theorem and also to prove analogous result for…

We address a systematic combinatorial approach to the anti-normal ordering problem. In this way, we use the Stirling numbers and their generating function, the so-called Bell polynomials, together with the operational methods to anti-normal…

An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…

A new tool is introduced, specially tailored for the study of order 2 bases of N. It is called the Erdos-Tuan algebra since it suits well their conjecture.

In his seminal paper from 1936, Alan Turing introduced the concept of non-computable real numbers and presented examples based on the algorithmically unsolvable Halting problem. We describe a different, analytically natural mechanism for…

It is well known that the distribution of the prime numbers plays a central role in number theory. It has been known, since Riemann's memoir in 1860, that the distribution of prime numbers can be described by the zero-free region of the…

We study the average order of the divisor function, as it ranges over the values of binary quartic forms that are reducible over the rationals.

We establish an explicit inequality for the number of divisors of an integer $n$. It uses the size of $n$ and its number of distinct prime divisors.

Let $1=d_{1}<d_{2}< \cdots < d_{\tau(n)}=n$ denote the ordered sequence of the positive divisors of an integer $n$. We are interested in estimating the arithmetic function $$ V(n) := \prod_{1 \le i < j \le \tau(n)}(d_{j}-d_{i}) \quad (n \ge…

We demonstrate how a generic automated theorem prover can be applied to establish the non-orderability of groups. Our approach incorporates various tools such as positive cones, torsions, generalised torsions and cofinal elements.

In quantum field theory, physicists routinely use "normal ordering" of operators, which just amounts to shuffling all creation operators to the left. Potentially confusing, then, is the occurrence in the literature of normal-ordered…

Normally ordered forms of functions of boson operators are important in many contexts in particular concerning Quantum Field Theory and Quantum Optics. Beginning with the seminal work of Katriel [Lett. Nuovo Cimento, 10(13):565--567, 1974],…

In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…

Transformations of well partial orders induce functions on the ordinals, via the notion of maximal order type. In most examples from the literature, these functions are not normal, in marked contrast with the central role that normal…

We study an asymptotic behavior of the sum $\sum\limits_{n\le x}\frac{\D \tau(n)}{\D \tau(n+a)}$. Here $\tau(n)$ denotes the number of divisors of $n$ and $a\ge 1$ is a fixed integer.