相关论文: The Distribution of Self-Fibonacci Divisors

Let $f : \mathbf{N} \rightarrow \mathbf{C}$ be a bounded multiplicative function. Let $a$ be a fixed integer (say $a = 1$). Then $f$ is well-distributed on the progression $n \equiv a \pmod{q} \subset \{1,\dots, X\}$, for almost all primes…

Let $\mathcal{A}=(a_i)_{i=1}^\infty$ be a non-decreasing sequence of positive integers and let $k\in\mathbb{N}_+$ be fixed. The function $p_\mathcal{A}(n,k)$ counts the number of partitions of $n$ with parts in the multiset…

We consider certain Fibonacci-like sequences $(X_n)_{n\geq 0}$ perturbed with a random noise. Our main result is that $\frac{1}{X_n}\sum_{k=0}^{n-1}X_k$ converges in distribution, as $n$ goes to infinity, to a random variable $W$ with…

We prove some new lower bounds for the counting function $\mathcal N_{\mathcal C}(x)$ of the set of Nov\'ak-Carmichael numbers. Our estimates depend on the bounds for the number of shifted primes without large prime factors. In particular,…

Consider "lagged" Fibonacci sequences $a(n) = a(n-1)+a(\lfloor n/k\rfloor)$ for $k > 1$. We show that $\lim_{n\to\infty} a(kn)/a(n)\cdot\ln n/n = k\ln k$ and we demonstrate the slow numerical convergence to this limit and how to deal with…

We prove that $n$-bit integers may be multiplied in $O(n \log n \, 4^{\log^* n})$ bit operations. This complexity bound had been achieved previously by several authors, assuming various unproved number-theoretic hypotheses. Our proof is…

From a known result of diophantine equations of the first degree with 2 unknowns we simply find the results of the distribution function of the sequences of positive integers generated by the functions at the origin of the 3x+1 and 5x+1…

Let $d_k(n) = \sum_{n_1 \cdots n_k = n}1$ be the $k$-fold divisor function. We call a function $f:\mathbb{N} \to \mathbb{C}$ a $d_k$-bounded multiplicative function, if $f$ is multiplicative and $|f(n)| \leq d_k(n)$ for every $n \in…

Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…

We show that any distribution on {-1,1}^n that is k-wise independent fools any halfspace h with error \eps for k = O(\log^2(1/\eps) /\eps^2). Up to logarithmic factors, our result matches a lower bound by Benjamini, Gurel-Gurevich, and…

We prove a central limit theorem for the joint distribution of $s_q(A_jn)$, $1\le j \le d$, where $s_q$ denotes the sum-of-digits function in base~$q$ and the $A_j$'s are positive integers relatively prime to $q$. We do this in fact within…

We improve on previous upper bounds for the $q$th norm of the partial sums of the Riemann zeta function on the half line when $0<q\leqslant 1$. In particular, we show that the 1-norm is bounded above by $(\log N)^{1/4}(\log\log N)^{1/4}$.

We show that for any $k$-times continuously differentiable function $f:[a,\infty)\longrightarrow{\mathbb R}$, any integer $q\ge 0$ and any $\alpha>1$ the inequality $$\liminf_{x\to\infty} \frac{x^k \cdot\log x\cdot \log_2 x\cdot\dots\cdot…

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…

Let $p_n$ denote the $n$-th prime number, and let $d_n=p_{n+1}-p_{n}$. Under the Hardy--Littlewood prime-pair conjecture, we prove \begin{align*} \sum_{n\le X}\frac{\log^{\alpha}d_n}{d_n} \sim\begin{cases} \frac{X\log\log\log X}{\log…

Let $f_1=1,f_2=2$ and $f_i=f_{i-1}+f_{i-2}$ for $i>2$ be the sequence of Fibonacci numbers. Let $\Phi_h(n)$ be the quantity of partitions of natural number $n$ into $h$ different Fibonacci numbers. In terms of Zeckendorf partition of $n$ I…

We give a relatively simple proof that \[ \int _0^1\left |\sum _{n\leq x}d(n)e(n\alpha )\right |d\alpha \asymp \sqrt x.\]

Consider the Fibonacci numbers defined by setting $F_1=1=F_2$ and $F_n =F_{n-1}+F_{n-2}$ for $n \geq 3$. We let $n_F! = F_1 \cdots F_n$ and $\binom{n}{k}_F = \frac{n_F!}{k_F!(n-k)_F!}$. Let $(x)_{\downarrow_0} = (x)_{\uparrow_0} = 1$ and…

Suppose $a^2 (a^2 + 1)$ divides $b^2 (b^2 + 1)$ with $b > a$. In this paper, we improve a previous result and prove a gap principle, without any additional assumptions, namely $b \gg a (\log a)^{1/8} / (\log \log a)^{12}$. We also obtain $b…

Let $n_1,\cdots,n_r$ be any finite sequence of integers and let $S$ be the set of all natural numbers $n$ for which there exists a divisor $d(x)=1+\sum_{i=1}^{deg(d)}c_ix^i$ of $x^n-1$ such that $c_i=n_i$ for $1\leq i \leq r$. In this paper…