Let $χ$ be a Dirichlet character modulo $q$, let $L(s, χ)$ be the attached Dirichlet $L$-function, and let $L^\prime(s, χ)$ denotes its derivative with respect to the complex variable $s$. The main purpose of this paper is to give an asymptotic formula for the $2k$-th power mean value of $\left|L^\prime/L(1, χ)\right|$ when $χ$ ranges a primitive Dirichlet character modulo $q$ for $q$ prime. We derive some consequences, in particular a bound for the number of $χ$ such that $\left|L^\prime/L(1, χ)\right|$ is large.
Let $Λ\left(n\right)$ be the von Mangoldt function and $r_{SP}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}Λ\left(m_{1}\right)Λ\left(m_{2}\right)Λ\left(m_{3}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares of primes. Let $N$ a sufficiently large integer, let $k>3/2$ and let $M_{i}\left(N,k\right),\, i=1,\dots,4$ suitable parameters depending on $Γ(s)$. We prove that $$\sum_{n\leq N}r_{SP}\left(n\right)\frac{\left(N-n\right)^{k}}{Γ\left(k+1\right)}=M_{1}\left(N,k\right)+M_{2}\left(N,k\right)+M_{3}\left(N,k\right)+M_{4}\left(N,k\right)+O…
The notion of chiral prime concatenations is studied as a recursive construction of prime numbers starting from a seed set and with appropriate blocks to define the primality growth, generation by generation, either from the right or from the left. Several basic questions are addressed like whether chiral concatenation is a symmetric process, an endless process, as well as the calculation of largest chiral prime numbers. In particular, the largest left-concatenated prime number is constructed. It is a unique prime number of 24 digits. By introducing anomalous left-concatenations of primes we c…
Let $\left( g\left( x \right),xg\left( x \right) \right)$ be a Riordan matrix from the Bell subgroup. We denote ${{\left( g\left( x \right),xg\left( x \right) \right)}^{φ}}=\left( {{g}^{\left( φ\right)}}\left( x \right),x{{g}^{\left( φ\right)}}\left( x \right) \right)$, where a matrix power is defined in the standard way. The polynomials ${{c}_{n}}\left( x \right)$ such that ${{g}^{\left( φ\right)}}\left( x \right)=\sum\nolimits_{n=0}^{\infty }{{{c}_{n}}}\left( φ\right){{x}^{n}}$ will be called composition polynomials. We consider the composition polynomials of the RNA matrix. The construction…
We consider the group of the matrices $\left( 1,g\left( x \right) \right)$ isomorphic to the group of formal power series $g\left( x \right)=x+{{g}_{2}}{{x}^{2}}+...$ under composition: $\left( 1,{{g}_{2}}\left( x \right) \right)\left( 1,{{g}_{1}}\left( x \right) \right)=\left( 1,{{g}_{1}}\left( {{g}_{2}}\left( x \right) \right) \right)$. Denote $P_{k}^{α}=\left( 1,x{{\left( 1-kα{{x}^{k}} \right)}^{{-1}/{k}\;}} \right)$. Matrix $\left( 1,g\left( x \right) \right)$is decomposed into an infinite product of the matrices $P_{k}^{α}$ with suitable exponents in two ways: to left-handed and right-han…
Each numerical sequence $\left( {{b}_{0}},{{b}_{1}},{{b}_{2}},... \right)$ with the generating function $B\left( x \right)$ defines the pseudo-involution in the Riordan group $\left( 1,xg\left( x \right) \right)$ such that $g\left( x \right)=1+xg\left( x \right)B\left( {{x}^{2}}g\left( x \right) \right)$. In the present paper we realize a simple idea: express the coefficients of the series ${{g}^{m}}\left( x \right)$ in terms of the coefficients of the series $B\left( x \right)$. Obtained expansion has a bright combinatorial character, sheds light on the connection of the pseudo-involution in …
Let $\left(a_{n}\right)_{n}$ be a strictly increasing sequence of positive integers, denote by $A_{N}=\left\{ a_{n}:\,n\leq N\right\} $ its truncations, and let $α\in\left[0,1\right]$. We prove that if the additive energy $E\left(A_{N}\right)$ of $A_{N}$ is in $Ω\left(N^{3}\right)$, then the sequence $\left(\left\langle αa_{n}\right\rangle \right)_{n}$ of fractional parts of $αa_{n}$ does not have Poissonian pair correlations (PPC) for almost every $α$ in the sense of Lebesgue measure. Conversely, it is known that $E\left(A_{N}\right)=\mathcal{O}\left(N^{3-\varepsilon}\right)$, for some fixed …
Let $Λ\left(n\right)$ be the Von Mangoldt function, let \[ r_{G}\left(n\right)=\underset{{\scriptstyle m_{1}+m_{2}=n}}{\sum_{m_{1},m_{2}\leq n}}Λ\left(m_{1}\right)Λ\left(m_{2}\right), \] \[ r_{PT}\left(N,h\right)=\sum_{n=0}^{N}Λ\left(n\right)Λ\left(n+h\right),\,h\in\mathbb{N} \] be the counting function of the Goldbach numbers and the counting function of the prime tuples, respectively. Let $N>2$ be an integer. We will find the explicit formulae for the averages of $r_{G}\left(n\right)$ and $r_{PT}\left(N,h\right)$ in terms of elementary functions, the incomplete Beta function $B_{z}\left(a,b\…
Let $Λ\left(n\right)$ be the von Mangoldt function and $r_{G}\left(n\right) := \sum_{m_1 + m_2=n} Λ\left(m_1 \right) Λ\left(m_2 \right)$ be the counting function for the numbers that can be written as sum of two primes (that we will call "Goldbach numbers", for brevity) and let $\widetilde{S }\left(z\right) := \sum_{n\geq1} Λ\left(n\right) e^{-nz}$, with $z\in\mathbb{C}$, $\mathrm{Re}\left(z\right)>0$. In this paper we will prove the identity $$\widetilde{S}\left(z\right) = \frac{e^{-2z}}{z}-\sum_ρz^{-ρ} Γ\left(ρ\right) + \sum_ρ \left(z^{-ρ} γ\left(ρ,2z\right) - \frac{2^ρe^{-z}}ρ \right) + G\l…
Riordan matrices are infinite lower triangular matrices corresponding to the certain operators in the space of formal power series. Generalized Euler polynomials ${{g}_{n}}\left( x \right)={{\left( 1-x \right)}^{n+1}}\sum\nolimits_{m=0}^{\infty }{{{p}_{n}}}\left( m \right){{x}^{m}}$, where ${{p}_{n}}\left( m \right)$ is the polynomial of degree $\le n$, are the numerator polynomials of the generating functions of diagonals of the ordinary Riordan matrices. Generalized Narayana polynomials ${{h}_{n}}\left( x \right)={{\left( 1-x \right)}^{2n+1}}\sum\nolimits_{m=0}^{\infty }{\left( m+1 \right)..…
Let $Λ$ be the von Mangoldt function and $r_{Q}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}Λ\left(m_{1}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares (that we will call Linnik numbers, for brevity). Let $N$ a sufficiently large integer, let $k>3/2$ and let $M_{i}\left(N,k\right),\, i=1,\dots,k$ suitable parameters depending on $J_{v}\left(u\right)$, where $J_{v}\left(u\right)$ denotes the Bessel function of complex order $v$ and real argument $u$. We prove that $$ \sum_{n\leq N}r_{Q}\left(n\right)\frac{\left(N-n\right)^{k}}{Γ\left(k…
Two theorems are demonstrated giving analytical expressions of the fundamental solutions of the Pell equation $X^{2}-DY^{2}=1$ found by the method of continued fractions for two squarefree polynomial expressions of radicands of Richaud-Degert type $D$ of the form $D=\left(f\left(u\right)\right)^{2}\pm2^αn$, where $D$, $n>0$, $α\geq0,\in\mathbb{Z}$, and $f\left(u\right)>0,\in\mathbb{Z}$, any polynomial function of $u\in\mathbb{Z}$ such that $f\left(u\right)\equiv0\left(mod\,\left(2^{α-1}n\right)\right)$ or $f\left(u\right)\equiv\left(2^{α-2}n\right)\left(mod\,\left(2^{α-1}n\right)\right)$.
Generalized Euler polynomials ${{α}_{n}}\left( x \right)={{\left( 1-x \right)}^{n+1}}\sum\nolimits_{m=0}^{\infty }{{{p}_{n}}}\left( m \right){{x}^{m}}$, where ${{p}_{n}}\left( x \right)$ is the polynomial of degree $n$, are the numerator polynomials of the generating functions of diagonals of the ordinary Riordan arrays. Generalized Narayana polynomials ${{φ}_{n}}\left( x \right)={{\left( 1-x \right)}^{2n+1}}\sum\nolimits_{m=0}^{\infty }{\left( m+1 \right)...\left( m+n \right){{p}_{n}}}\left( m \right){{x}^{m}}$ are the numerator polynomials of the generating functions of diagonals of the expo…
In this paper, we generalize the arithmetic functions $τ$ and $τ^{\left(e\right)}$ in algebraic number fields and we find some properties of these functions.
In this paper we study the Diophantine equation \begin{align*} b^k + \left(a+b\right)^k + &\left(2a+b\right)^k + \ldots + \left(a\left(x-1\right) + b\right)^k = \\ &y\left(y+c\right) \left(y+2c\right) \ldots \left(y+ \left(\ell-1\right)c\right), \end{align*} where $a,b,c,k,\ell$ are given integers under natural conditions. We prove some effective results for special values for $c,k$ and $\ell$ and obtain a general ineffective result based on Bilu-Tichy method.
We show the following bounds on the prime counting function $π(x)$ using principles from analytic number theory, giving an estimate: $$2 \log 2 \geq \limsup_{x \rightarrow \infty} \frac{π(x)}{x / \log x} \geq \liminf_{x \rightarrow \infty} \frac{π(x)}{x / \log x} \geq \log 2$$ for all $x$ sufficiently large. We also conjecture about the bounding of $π((x+1)^{2}) - π(x^{2})$, as is relevant to Legendre's conjecture about the number of primes in the aforementioned interval such that: $$ \left \lfloor\frac{1}{2}\left(\frac{\left(x+1\right)^{2}}{\log\left(x+1\right)}-\frac{x^{2}}{\log x}\right)-\f…
Let $φ(x_{1}, \ldots, x_{h})=c_{1} x_{1}+\cdots+c_{h} x_{h}$ be a linear form with coefficients in a field $\mathbf{F}$, and let $V$ be a vector space over $\mathbf{F}$. A nonempty subset $A$ of $V$ is a $φ$-Sidon set if $φ\left(a_{1}, \ldots, a_{h}\right)=φ\left(a_{1}^{\prime}, \ldots, a_{h}^{\prime}\right)$ implies $\left(a_{1}, \ldots, a_{h}\right)=$ $\left(a_{1}^{\prime}, \ldots, a_{h}^{\prime}\right)$ for all $h$-tuples $\left(a_{1}, \ldots, a_{h}\right) \in A^{h}$ and $\left(a_{1}^{\prime}, \ldots, a_{h}^{\prime}\right) \in A^{h}$. We call $A$ a polynomial perturbation of $B$ if for some…
Let $p$ be an odd prime, let $K=\mathbb{Q}(ε)$ where $ε$ is a primitive cubic root of unity, and let $L$ be the Kummer field $\mathbb{Q}\left(ε, \sqrt[3]α\right)$. In this paper we obtain a characterization of the splitting behavior of the symbol algebras $\left( \frac{α,p}{K,ε}\right)$ and $\left( \frac{α,p^{h_{p}}}{K,ε}\right)$, where $h_{p}$ is the order in the class group $Cl\left(L\right)$ of a prime ideal of $\mathcal{O}_L$ which divides $p\mathcal{O}_L.$
On the Gross-Prasad conjecture with its refinement for $\left(\mathrm{SO}\left(5\right),\mathrm{SO}\left(2\right)\right)$ and the generalized Böcherer conjecture
We present improved algorithms for computing the left factorial residues $!p=0!+1!+...+(p-1)! \!\mod p$. We use these algorithms for the calculation of the residues $!p\!\mod p$, for all primes $p$ up to $2^{40}$. Our results confirm that Kurepa's left factorial conjecture is still an open problem, as they show that there are no odd primes $p<2^{40}$ such that $p$ divides $!p$. Additionally, we confirm that there are no socialist primes $p$ with $5<p<2^{40}$.
In a recent work \cite{key-11}, A. Fish proved that if $E_{1}$ and $E_{2}$ are two subsets of $\mathbb{Z}$ of positive upper Banach density, then there exists $k\in\mathbb{Z}$ such that $k\cdot\mathbb{Z}\subset\left(E_{1}-E_{1}\right)\cdot\left(E_{2}-E_{2}\right).$ In this article we will show that a similar result is true for the set of primes $\mathbb{P}$ (which has density $0$). We will prove that there exists $k\in\mathbb{N}$ such that $k\cdot\mathbb{N}\subset\left(\mathbb{P}-\mathbb{P}\right)\cdot\left(\mathbb{P}-\mathbb{P}\right),$ where $\mathbb{P}-\mathbb{P}=\left\{ p-q:p>q\,\text{and}…
Given $n\in\mathbb{N}$, let $ω\left(n\right)$ denote the number of distinct prime factors of $n$, let $Z$ denote a standard normal variable, and let $P_{n}$ denote the uniform distribution on $\left\{ 1,\ldots,n\right\} $. The Erdős-Kac Theorem states that $$P_{n}\left(m\le n:ω\left(m\right)-\log\log n\le x\left(\log\log n\right)^{1/2}\right)\to\mathbb{P}\left(Z\le x\right)$$ as $n\to\infty$; i.e., if $N\left(n\right)$ is a uniformly distributed variable on $\lbrace 1,\ldots,n \rbrace$, then $ω\left(N\left(n\right)\right)$ is asymptotically normally distributed as $n\to \infty$ with both mean …
An important result of H. Weyl states that for every sequence $\left(a_{n}\right)_{n \geq 1}$ of distinct positive integers the sequence of fractional parts of $\left(a_{n} α\right)_{n\geq 1}$ is uniformly distributed modulo one for almost all $α$. However, in general it is a very hard problem to calculate the precise order of convergence of the discrepancy of $\left(\left\{a_{n} α\right\}\right)_{n \geq 1}$ for almost all $α$. In particular it is very difficult to give sharp lower bounds for the speed of convergence. Until now this was only carried out for lacunary sequences $\left(a_{n}\righ…
