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 identify the two local residue classes excluded by each prime $p_i$. Their possible collision is characterized exactly by $\delta_{p_i}(n)=0$. An inclusion--exclusion argument combined with the Chinese remainder theorem gives an exact formula containing at most $3^r$ terms. We prove that the associated finite correlation has cardinality $\kappa_P(n)=(1+\mathbf{1}_{\{\delta_3(n)=0\}})\prod_{i=1}^{r}(p_i-2+\mathbf{1}_{\{\delta_{p_i}(n)=0\}})$ and obtain the affine identity $g_P(2(n+6P))-g_P(2n)=\kappa_P(n)$. We also establish an exact finite-density decomposition with uniform error smaller than $3^r-1$, a half-period positivity theorem, and a product-cutoff criterion. Finally, we formulate the covering and paired-gap interpretations of the problem and identify precisely the deterministic boundary that appears when all primes not exceeding $\sqrt{2n}$ are included. No probabilistic independence assumption is used.
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$,...
For integers $m\ge 2$ and rows $N>m$ divisible by $m$, consider the restricted binomial greatest common divisor $G(N;m)=\gcd\{\binom Nk:0<k<N,\ m\mid k\}$. Fix a prime $p$ with $p\nmid m$, and let $r_p(m)$ be the least positive integer $r$ such that $m<p^r$. We prove that the largest possible value of $v_p(G(N;m))$, as...
Let $k$ be a positive integer, and consider the sequences of positive rationals with $x_0\in\N$ and $x_{n+1}=k/(x_0+x_1+\dots+x_n)$. Write $x_n=a_n/b_n$ in lowest terms. We show that there is a rational constant $c>0$ such that $c\,a_n+b_n$ is a perfect power for every such sequence and every $n\ge2$ if and only if $k=...
Mateo Matijasevick, Santiago E. Rodriguez, Gregorio Salazar· 0 citations
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}$ with Witt index $m-1$. 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|\geq p^m$, $$ |\Delta_Q(E)|\gg \frac{p}{\log\bigl(2+p^{m...
Thang Pham, Chun-Yen Shen, Dung The Tran et al.· 0 citations
Let $q=p^h>7$ be odd, put $m=(q+1)/2$, and suppose that $i=(m-2)/2$ satisfies $\gcd(i,m)=\gcd(i+2,m)=1$. For the $\mathbf{F}_{q^2}$-maximal function field $\mathcal{F}_i=\mathbf{F}_{q^2}(x,y)$ defined by $y^m=x^i(x^2+1)$, Peter Beelen, Maria Montanucci, Jonathan Niemann, and Luciane Quoos showed that the geometric auto...
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...
Zhi-Yuan Yang· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.