Related papers: On functions without a normal order

A method of determining two factors of an odd integer without need of multiplication or division operation in iterative portion of computation is presented. It is feasible for an implementing algorithm to use only integer addition and…

We describe a method for calculating the roots of special functions satisfying second order linear ordinary differential equations. It exploits the recent observation that the solutions of a large class of such equations can be represented…

In this paper we deduce some tight Tur\'an type inequalities for Tricomi confluent hypergeometric functions of the second kind, which in some cases improve the existing results in the literature. We also give alternative proofs for some…

Given a prime number \(p\) and a natural number \(m\) not divided by \(p\), we propose the problem of finding the smallest number \(r_{0}\) such that for \(r\geq r_{0}\), every group \(G\) of order \(p^{r}m\) has a non-trivial normal…

We consider the problem of characterizing all functions $f$ defined on the set of integers modulo $n$ with the property that an average of some $n$th roots of unity determined by $f$ is always an algebraic integer. Examples of such…

We present a natural extension of the process of taking a group quotient to arbitrary subgroups. We first review basic concepts from group theory. This will allow us to see the relationship between our new, more general quotient operation…

Turan's method, as expressed in his books, is a careful study of trigonometric polynomials from different points of view. The present article starts from a problem asked by Turan: how to construct a sequence of real numbers x(j) (j=…

Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…

We define the notion of Mumford divisors, argue that they are the natural divisors to study on reduced but non-normal varieties and prove a structure theorem for the Mumford class group. v.2: references added

This paper is devoted to the proof Gauss' divergence theorem in the framework of "ultrafunctions". They are a new kind of generalized functions, which have been introduced recently [2] and developed in [4], [5] and [6]. Their peculiarity is…

The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…

We give a construction of an absolutely normal real number $x$ such that for every integer $b $ greater than or equal to $2$, the discrepancy of the first $N$ terms of the sequence $(b^n x \mod 1)_{n\geq 0}$ is of asymptotic order…

This analysis which uses new mathematical methods aims at proving the Riemann hypothesis and figuring out an approximate base for imaginary non-trivial zeros of zeta function at very large numbers, in order to determine the path that those…

We found a regularity of the behavior of primes that allows to represent both prime and natural numbers as infinite matrices with a common formation rule of their rows. This regularity determines a new class of infinite cyclic groups that…

While the prime numbers have been subject to mathematical inquiry since the ancient Greeks, the accumulated effort of understanding these numbers has - as Marcus du Sautoy recently phrased it - 'not revealed the origins of what makes the…

We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.

We consider numbers formed by concatenating some of the base b digits from additive functions f(n) that closely resemble the prime counting function \Omega(n). If we concatenate the last \lceil y \frac{\log \log \log n}{\log b} \rceil…

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

We consider the higher order Tur\'an inequality and higher order log-concavity for sequences $\{a_n\}_{n \ge 0}$ such that \[ \frac{a_{n-1}a_{n+1}}{a_n^2} = 1 + \sum_{i=1}^m \frac{r_i(\log n)}{n^{\alpha_i}} + o\left( \frac{1}{n^{\beta}}…

Tur\'an type inequalities for modified Bessel functions of the first kind are used to deduce some sharp lower and upper bounds for the asymptotic order parameter of the stochastic Kuramoto model. Moreover, approximation from the Lagrange…