Related papers: Transcendence of the Gaussian Liouville number and…

Let $a\geq 1, b\geq 0$ and $k\geq 2$ be any given integers. It has been proven that there exist infinitely many natural numbers $m$ such that sum of divisors of $m$ is a perfect $k$th power. We try to generalize this result when the values…

We study nonnegative solutions to the following Hardy-H\'enon type equations involving higher order fractional Laplacians $$ (-\Delta)^\sigma u = |x|^{-\alpha}u^{p} ~~~~~~ \mbox{in} ~ \mathbb{R}^n \backslash \{0\} $$ with a possible…

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

For a positive integer $n$, we denote by $F(n)$ the distance from $n$ to the nearest prime number. We prove that every sufficiently large positive integer $N$ can be represented as the sum $N=n_1+n_2$, where $$ F(n_i) \geqslant (\log…

Euler gave recipes for converting alternating series of two types, I and II, into equivalent continued fractions, i.e., ones whose convergents equal the partial sums. A condition we prove for irrationality of a continued fraction then…

Mills proved that there exists a real constant $A>1$ such that for all $n\in \mathbb{N}$ the values $\lfloor A^{3^n}\rfloor$ are prime numbers. No explicit value of $A$ is known, but assuming the Riemann hypothesis one can choose $A=…

This work contributes to the theory of nth level fractional derivative, where $n$ is a positive integer. An equivalent representation of 2nd level fractional derivative in terms of Riemann-Liouville fractional derivative is presented. We…

We consider series of the form $$ \frac{p}{q} +\sum_{j=2}^\infty \frac{1}{x_j}, $$ where $x_1=q$ and the integer sequence $(x_n)$ satisfies a certain non-autonomous recurrence of second order, which entails that $x_n|x_{n+1}$ for $n\geq 1$.…

We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…

A primorial prime is a prime number of the form $p_n\# \pm 1$ where $p_n\#$ denotes the product of all primes less than or equal to $p_{n}$, the $n$-th prime. We show that the probability along the lines of Mertens' Theorem that either…

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

The Gaussian moat problem asks whether it is possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded. In this paper, we have proved that the…

The paper exploits an isomorphism between the natural numbers N and a space U of periodic sequences of the roots of unity in constructing a recursive procedure for representing and computing the prime numbers. The nth wave number ${\bf…

Wright proved that there exists a number $c$ such that if $g_0 = c$ and $g_{n+1} = 2^{g_n}$, then $\lfloor g_n \rfloor$ is prime for all $n > 0$. Wright gave $c = 1.9287800$ as an example. This value of $c$ produces three primes, $\lfloor…

Liouville theorem (LT) reveals robust incompressibility of distribution function in phase space, given arbitrary potentials. However, its quantum generalization, Wigner flow, is compressible, i.e., LT is only conditionally true (e.g., for…

In this paper, we prove the following result. Let $\alpha$ be any real number between $0$ and $2$. Assume that $u$ is a solution of $$ \left\{\begin{array}{ll} (-\Delta)^{\alpha/2} u(x) = 0 , \;\; x \in \mathbb{R}^n ,\\…

A new method for approximating fractional derivatives of the Gaussian function and Dawson's integral are presented. Unlike previous approaches, which are dominantly based on some discretization of Riemann-Liouville integral using polynomial…

If $N = {q^k}{n^2}$ is an odd perfect number, where $q$ is the Euler prime, then we show that $n < q$ is sufficient for Sorli's conjecture that $k = \nu_{q}(N) = 1$ to hold. We also prove that $q^k < 2/3{n^2}$, and that $I(q^k) < I(n)$,…

We derive an asymptotic formula for the divisor function $\tau(k)$ in an arithmetic progression $k\equiv a(\bmod \ q)$, uniformly for $q\leq X^{\Delta_{n,l}}$ with $(q,a)=1$. The parameter $\Delta_{n,l}$ is defined as $$…

We improve bounds on the degree and sparsity of Boolean functions representing the Legendre symbol as well as on the $N$th linear complexity of the Legendre sequence. We also prove similar results for both the Liouville function for…