Related papers: On a function introduced by Erd\"{o}s and Nicolas

Let $F({\bf x})={\bf x}^tQ_{\bf x}+\mathbf{b}^t{\bf x}+c\in\mathbb{Z}[{\bf x}]$ be a quadratic polynomial in $\ell (\ge 3 )$ variables ${\bf x} =(x_{1},...,x_{\ell})$, where $F({\bf x})$ is positive when ${\bf x}\in\mathbb{R}_{\ge…

Motivated by a question of Venkataramana, we consider the greatest common divisor of $\phi(f(n))$ where $f$ is a primitive polynomial with integer coefficients, and $n$ ranges over all natural numbers. Assuming Schinzel's hypothesis, we…

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…

A cyclotomic polynomial Phi_n(x) is said to be ternary if n=pqr with p,q and r distinct odd prime factors. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of the coefficients is not completely understood. Eli…

In terms of the creative microscoping method recently introduced by Guo and Zudilin and the Chinese remainder theorem for coprime polynomials, we establish a $q$-supercongruence with two parameters modulo $[n]\Phi_n(q)^3$. Here…

We establish a congruence on sums of central $q$-binomial coefficients. From this $q$-congruence, we derive the divisibility of the $q$-trinomial coefficients introduced by Andrews and Baxter.

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

N. Minculete has introduced a concept of divisors of order $r$: integer $d=p_1^{b_1}\cdots p_k^{b_k} $ is called a divisor of order $r$ of $n=p_1^{a_1}\cdots p_k^{a_k}$ if $d \mid n$ and $b_j\in\{r, a_j\}$ for $j=1,\ldots,k$. One can…

Let $N=p_1p_2... p_n$ be a product of $n$ distinct primes. Define $P_N(x)$ to be the polynomial $(1-x^N)\prod_{1\leq i<j\leq n}(1-x^{N/(p_ip_j)})/\prod_{i=1}^n (1-x^{N/p_i})$. (When $n=2$, $P_{pq}(x)$ is the $pq$-th cyclotomic polynomial,…

We attach to normalized (non-vanishing) arithmetic functions $g$ and $h$ recursively defined polynomials. Let $P_0^{g,h}(x):=1$. Then \begin{equation} P_n^{g,h}(x) := \frac{x}{h(n)} \sum_{k=1}^{n} g(k) \, P_{n-k}^{g,h}(x). \end{equation}…

We continue to explore cyclotomic factors in the descent set polynomial $Q_{n}(t)$, which was introduced by Chebikin, Ehrenborg, Pylyavskyy and Readdy. We obtain large classes of factors of the form $\Phi_{2s}$ or $\Phi_{4s}$ where $s$ is…

Let $P(k,n)$ be the set of products of $k$ factors from the set $\{1,\ldots , n\}.$ In 1955, Erd\H{o}s posed the problem of determining the order of magnitude of $|P (2, n)|$ and proved that $|P (2, n)| = o(n^2 )$ for $n \to\infty$. In…

I solve here a question of Vladimir Reshetnikov in Mathoverflow (question 261649) about the values of Fabius function. Namely, I prove that the numbers $R_n:=2^{-\binom{n-1}{2}}(2n)! F(2^{-n})\prod_{m=1}^{\lfloor n/2\rfloor}(2^{2m}-1)$ are…

Let $\mu$ be a non-trivial probability measure on the unit circle $\partial\bbD$, $w$ the density of its absolutely continuous part, $\alpha_n$ its Verblunsky coefficients, and $\Phi_n$ its monic orthogonal polynomials. In this paper we…

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

For $2\leq s<t$, the Erd\H{o}s-Rogers function $f_{s,t}(n)$ measures how large a $K_s$-free induced subgraph there must be in a $K_t$-free graph on $n$ vertices. There has been an extensive amount of work towards estimating this function,…

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Let $s(n)=\sum_{d\mid n,~d<n} d$ denote the sum of the proper divisors of $n$. The second-named author proved that $\omega(s(n))$ has normal order $\log\log{n}$, the analogue for $s$-values of a classical result of Hardy and Ramanujan. We…

We show that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and any non-negative integers $j$ and $r$ with $j\leqslant m$, the expression $$ \frac{1}{[n_1]}{n_1+n_{m}\brack n_1}^{-1}…

In recent, H. Sun defined a new kind of refined Eulerian polynomials, namely, \begin{eqnarray*} A_n(p,q)=\sum_{\pi\in \mathfrak{S}_n}p^{{\rm odes}(\pi)}q^{{\rm edes}(\pi)} \end{eqnarray*} for $n\geq 1$, where ${odes}(\pi)$ and ${edes}(\pi)$…