Related papers: Permutations with orders coprime to a given intege…
Let q be an odd positive integer and P \in F2[z] be of order q and such that P(0) = 1. We denote by A = A(P) the unique set of positive integers satisfying \sum_{n=0}^\infty p(A, n) z^n \equiv P(z) (mod 2), where p(A,n) is the number of…
Let $m\ge 2$ be a fixed positive integer. Suppose that $m^j \leq n< m^{j+1}$ is a positive integer for some $j\ge 0$. Denote $b_{m}(n)$ the number of $m$-ary partitions of $n$, where each part of the partition is a power of $m$. In this…
For any $m = 3 \left( 2n + 1 \right) with \ n \in \mathbb{N^*} ,$ the prime counting function $\pi(m) = 4 + \left \vert A_4(m) \right \vert + 2 \left \vert A_6(m) \right \vert $ where $A_6(m) $ and $ A_4(m) $ are the sets of Twin Primes and…
In $1963$ Graham proved that every positive integer $n \ge 78$ can be written as a sum of distinct positive integers $a_1, a_2, \ldots, a_r$ for which $\frac{1}{a_1} + \frac{1}{a_2} + \ldots + \frac{1}{a_r}$ is equal to $1$. In the same…
We study several aspects of the M\"{o}bius function, $\mu[\sigma,\pi]$, on the poset of permutations under the pattern containment order. First, we consider cases where the lower bound of the poset is indecomposable. We show that…
We propose a lower estimation for computing quantity of the inverses of Euler's function. We answer the question about the multiplicity of $m$ in the equation $\varphi(x) = m$ \cite{Ford}. An analytic expression for exact multiplicity of $m…
Let $n$ be a positive integer and $f(x) := x^{2^n}+1$. In this paper, we study orders of primes dividing products of the form $P_{m,n}:=f(1)f(2)\cdots f(m)$. We prove that if $m > \max\{10^{12},4^{n+1}\}$, then there exists a prime divisor…
A composite number $n$ is called Lehmer when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. In 1932, D.~H.~Lehmer conjectured that there are no composite Lehmer numbers and showed that Lehmer numbers must be odd and…
The notion of a descent polynomial, a function in enumerative combinatorics that counts permutations with specific properties, enjoys a revived recent research interest due to its connection with other important notions in combinatorics,…
Let \tau(.) be the Ramanujan \tau-function, and let k be a positive integer such that \tau(n) is not 0 for n=1,...,[k/2]. (This is known to be true for k < 10^{23}, and, conjecturally, for all k.) Further, let s be a permutation of the set…
We show that the proportion of permutations of length $n$ with principal M\"{o}bius function equal to zero, $Z(n)$, is asymptotically bounded below by 0.3995. If a permutation $\pi$ contains two intervals of length 2, where one interval is…
For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…
Let $\Omega$ be the set of odd positive integers and let $S:\Omega \rightarrow \Omega$ be the Syracuse function. It is proved that, for every permutation $\sigma$ of $(1,2,3)$, the set of triples of the form $(m,S(m),S^2(m))$ with…
We prove that there is an absolute constant $c>0$ with the following property: if $Z/pZ$ denotes the group of prime order $p$, and a subset $A\subset Z/pZ$ satisfies $1<|A|<p/2$, then for any positive integer…
Permutation invariant polynomial functions of matrices have previously been studied as the observables in matrix models invariant under $S_N$, the symmetric group of all permutations of $N$ objects. In this paper, the permutation invariant…
Let $m$ be any positive integer and let $\delta_1,\delta_2\in\{1,-1\}$. We show that for some constanst $C_m>0$ there are infinitely many integers $n>1$ with $p_{n+m}-p_n\le C_m$ such that $$\left(\frac{p_{n+i}}{p_{n+j}}\right)=\delta_1\…
In this paper, we show that if $(U_n)_{n\ge 1}$ is any nondegenerate linearly recurrent sequence of integers whose general term is up to sign not a polynomial in $n$, then the inequality $\phi(|U_n|)\ge |U_{\phi(n)}|$ holds on a set of…
We denote by $c_t^{(m)}(n)$ the coefficient of $q^n$ in the series expansion of $(q;q)_\infty^m(q^t;q^t)_\infty^{-m}$, which is the $m$-th power of the infinite Borwein product. Let $t$ and $m$ be positive integers with $m(t-1)\leq 24$. We…
In this paper, we study some properties of a certain kind of permutation $\sigma$ over $\mathbb{F}_{2}^{n}$, where $n$ is a positive integer. The desired properties for $\sigma$ are: (1) the algebraic degree of each component function is…
Let $S_{\rm lcm}(n)$ denote the set of permutations $\pi$ of $[n]=\{1,2,\dots,n\}$ such that ${\rm lcm}[j,\pi(j)]\le n$ for each $j\in[n]$. Further, let $S_{\rm div}(n)$ denote the number of permutations $\pi$ of $[n]$ such that…