Let $E_n$ denote the number of alternating permutations of $\{1,\dots,n\}$, equivalently characterized by $\sum_{n\ge0}E_nz^n/n!=\sec z+\tan z$. For every $q\ge1$, the sequence $(E_n\bmod q)_{n\ge0}$ is eventually periodic; let $d(q)$ and $s(q)$ denote its minimal eventual period and preperiod. For every odd prime $p$, Knuth and Buckholtz proved $d(p)=\operatorname{lcm}(p-1,4)$ together with \[ d(p^r)\mid p^{r-1}d(p), \qquad s(p^r)\le r, \] and Ramassamy conjectured that both bounds are attained for every $r\ge1$. In this paper, we introduce an algebraic frequency expansion for the Euler zig-zag numbers using Hurwitz series over the coefficient ring $S_r=(\mathbb Z/p^r\mathbb Z)[x]/(x^2+1)$. More precisely, the corresponding Hurwitz series is represented as a finite combination of formal exponential modes, in a manner reminiscent of Fourier analysis.Using this expansion, we prove \[ d(p^r)=p^{r-1}d(p) \qquad \text{for every odd prime $p$ and every $r\ge1$}, \] thereby establishing Ramassamy's period conjecture. We also disprove the preperiod conjecture by proving \[ s(5^5)=4<5. \] Finally, we prove that $5^5$ is the smallest odd prime power for which $s(p^r)\ne r$, and based on our findings we further conjecture \[ s(p^r)\ge r-2 \] for every odd prime $p$ and every $r\ge2$.
Let $p_1,\dots,p_r\geq 5$ be distinct primes, let $P=p_1\cdots p_r$, and put $M=6P$. For a positive integer $n$, let $g_P(2n)$ denote the number of unordered representations $2n=h+k$, with $1\leq h\leq k$, such that $\gcd(h,M)=\gcd(k,M)=1$. Using the canonical remainder operator $\delta_q(x)=x-q\lfloor x/q\rfloor$, we...
For an integer $n>1$, let $P^+(n)$ be the largest prime factor of $n$, and let $P_y^+(n)$ denote the largest prime factor of $n$ not exceeding $y$. One of Erd\H{o}s and Tur\'an's conjectures asserts that the asymptotic density of integers $n$ satisfying $P^+(n)<P^+(n+1)$ is $1/2$. Furthermore, Wang conjectures that for...
Let $p$ be an odd prime, let $m\geq1$ be an integer, and let $Q$ be a nondegenerate quadratic form on $\mathbb F_p^{2m}$. For a nonempty set $E\subseteq\mathbb F_p^{2m}$, write $\Delta_Q(E)=\{Q(x-y):x,y\in E\}$. We prove that, whenever $|E|>p^m$, \[ |\Delta_Q(E)|\gg \min\left\{\frac{p}{L_E},\, \frac{|E|}{p^{m-1}L_E^2}\...
Thang Pham, Chun-Yen Shen, Dung The Tran et al.· 0 citations
Let $\mu$ be the M\"obius function and $e(t)=e^{2\pi it}$. We prove that if $N\ge2$, $\alpha\in\mathbb{R}$, $(a,q)=1$, and $|\alpha-a/q|\le q^{-2}$, then \[\bigg|\sum_{n\le N}\mu^2(n)e(\alpha n)\bigg|\ll\left(\frac Nq+q\right)(\log 2N)^5, \] with an absolute implied constant, and we deduce the corresponding estimate on...
Nicolas Robles, Alexandru Zaharescu, Dirk Zeindler· 0 citations
Denote by $\omega(n)$ the number of distinct prime divisors of the natural number $n$. In 2007, Granville and Soundararajan gave a quite new method to compute the higher moments $\sum_{n\leq x}(\omega(n)-\log\log x)^{k}$, for a wide range of integers $k\geq 2$. In this notes, we shall apply the method for $\omega_{z}(n...
T. Minamide, Haruka Sakai, Y. Tanigawa· 1 citation
Let $d$ be the divisor function, and let $K(n)$ be the least positive integer $K$ for which $d((n + K)!) \ge 2d(n!)$. Erd\H{o}s, Graham, Ivi\'c and Pomerance proved that, for infinitely many $n$, \begin{equation*} K(n)>(1/9)(\log n)(\log_{2} n)(\log_{4} n)/(\log_{3} n)^3. \end{equation*} We improve upon this by a facto...
Tristan Freiberg· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.