Related papers: The iterated Carmichael lambda function

In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number $x_0$ so that some inequality involving Chebyshev's $\vartheta$-function holds for every $x…

It is known that for any smooth periodic function $f$ the sequence $(f(2^kx))_{k\ge 1}$ behaves like a sequence of i.i.d.\ random variables, for example, it satisfies the central limit theorem and the law of the iterated logarithm. Recently…

We study the uniform distribution of the polynomial sequence $\lambda(P)=(\lfloor P(k) \rfloor )_{k\geq 1}$ modulo integers, where $P(x)$ is a polynomial with real coefficients. In the nonlinear case, we show that $\lambda(P)$ is uniformly…

It is proved that among the rational iterations locally converging with order s>1 to the sign function, the Pad\'e iterations and their reciprocals are the unique rationals with the lowest sum of the degrees of numerator and denominator.

A random $n$-permutation may be generated by sequentially removing random cards $C_1,...,C_n$ from an $n$-card deck $D = \{1,...,n\}$. The permutation $\sigma$ is simply the sequence of cards in the order they are removed. This permutation…

We consider filtered or graded algebras $A$ over a field $K$. Assume that there is a discrete valuation $O_v$ of $K$ with $m_v$ its maximal ideal and $k_v:=O_v/m_v$ its residue field. Let $\Lambda$ be $O_v$-order such that $\Lambda K=A$ and…

Let $s$ be a fixed positive integer constant, $\varepsilon$ be a fixed small positive number. Then, provided that a prime $p$ is large enough, we prove that for any set $\{{\mathcal M}\subseteq \mathbb F_p^*$ of size $|{\mathcal M}|=…

For a fixed positive integer $k$, let $C(k,n)$ denote the number of two-color partitions of $n$ with odd smallest part and restrictions on even parts, and let $C_k(q)$ be its generating function. We show that $C(1,n)\equiv d(2n-1)\pmod{4}$…

Let $q$ be a prime power and, for each positive integer $n\ge 1$, let $\mathbb F_{q^n}$ be the finite field with $q^n$ elements. Motivated by the well known concept of normal elements over finite fields, Huczynska et al (2013) introduced…

We determine the asymptotic proportion of minimal automata, within n-state accessible deterministic complete automata over a k-letter alphabet, with the uniform distribution over the possible transition structures, and a binomial…

A unitary divisor $c$ of a positive integer $n$ is a positive divisor of $n$ that is relatively prime to $\displaystyle{\frac{n}{c}}$. For any integer $k$, the function $\sigma_k^*$ is a multiplicative arithmetic function defined so that…

The minimal excludant statistic, which denotes the smallest positive integer that is not a part of an integer partition, has received great interest in recent years. In this paper, we move on to the smallest positive integer whose frequency…

As a well-known enumerative problem, the number of solutions of the equation $m=m_1+...+m_k$ with $m_1\leqslant...\leqslant m_k$ in positive integers is $\Pi(m,k)=\sum_{i=0}^k\Pi(m-k,i)$ and $\Pi$ is called the additive partition function.…

Let $$\lambda(s)=\sum_{n=0}^\infty\frac1{(2n+1)^s},$$ $$\beta(s)=\sum_{n=0}^\infty\frac{(-1)^{n}}{(2n+1)^s},$$ and $$\eta(s)=\sum_{n=1}^\infty\frac{(-1)^{n-1}}{n^s}$$ be the Dirichlet lambda function, its alternating form, and the Dirichlet…

Let $k\geq2$. Then the $k$-th order Fibonacci cube $\Gamma^{(k)}_{n}$ is the subgraph of the hypercube $Q_{n}$ induced by vertices without $k$ consecutive $1$s. The case $k=2$ corresponds to the classic Fibonacci cube $\Gamma_{n}$. There…

Let $m$ be a positive integer and let $\rho(m,n)$ be the proportion of permutations of the symmetric group ${\rm Sym}(n)$ whose order is coprime to $m$. In 2002, Pouyanne proved that $\rho(n,m)n^{1-\frac{\phi(m)}{m}}\sim \kappa_m$ where…

In this note, we represent integers in a type of factoradic notation. Rather than use the corresponding Lehmer code, we will view integers as permutations. Given a pair of integers n and k, we give a formula for n mod k in terms of the…

A length $n$ cosine sum is an expression of the form $\cos a_1\theta + \cdots + \cos a_n\theta$ where $a_1 < \cdots < a_n$ are positive integers, and a length $n$ Newman polynomial is an expression of the form $z^{a_1} + \cdots + z^{a_n}$…

In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent…

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…