相关论文: Simultaneous inequalities among values of the Eule…

Let $F(x,y)$ be an irreducible form of degree $r\geq 3$ and having $s+1$ non-zero coefficients. Let $h\geq 1$ be an integer and consider the Thue inequality $$|F(x,y)|\leq h.$$ Following the seminal work of Thue in 1909, several papers were…

Let $\epsilon\in \{-1,1\}$. A sequence of prime numbers $p_1, p_2, p_3, ...$, such that $p_i=2p_{i-1}+\epsilon$ for all $i$, is called a {\it Cunningham chain} of the first or second kind, depending on whether $\epsilon =1$ or -1…

We obtained order estimations for the best uniform approximations by trigonometric polynomials and approximations by Fourier sums of classes of $2\pi$-periodic continuous functions, which $(\psi,\beta)$-derivatives $f_{\beta}^{\psi}$ belong…

We analyze sumsets A+B = {a+b : a in A, b in B} where A,B are sets of integers, A is infinite, and B has positive upper Banach density. For each k, we show that A+B contains at least the expected density of k-term arithmetic progressions…

In this paper we prove an asymptotic formula for the number of solutions in prime numbers to systems of simultaneous linear inequalities with algebraic coefficients. For $m$ simultaneous inequalities we require at least $m+2$ variables,…

Questions concerning small fractional parts of polynomials and pseudo-polynomials have a long history in analytic number theory. In this paper, we improve on earlier work by Madritsch and Tichy. In particular, let $f=P+\phi$ where $P$ is a…

Let $f(n)$ denote the maximum sum of the side lengths of $n$ non-overlapping squares packed inside a unit square. We prove that $f(n^2+1) = n$ for all positive integers $n$ if and only if the sum $\sum_{k\geq 1}(f(k^2+1)-k)$ converges. We…

We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…

Euler totient function $\phi(n)$ plays a central role in number theory and is applied in areas such as cryptography. In this paper, we study iterations of the totient function. We first prove that for any integer $n>2$, iteratively applying…

Let f(m,n) denote the number of relatively prime subsets of {m+1,m+2,...,n}, and let Phi(m,n) denote the number of subsets A of {m+1,m+2,...,n} such that gcd(A) is relatively prime to n. Let f_k(m,n) and Phi_k(m,n) be the analogous counting…

Let $p_n$ denote the $n$-th prime. In 2000, Panaitopol established the inequality $p_1 \cdots p_n > p_{n+1}^{n - \pi(n)}$ for all $n \geq 2$, where $\pi(x)$ is the prime counting function. In 2021, Yang and Liao refined this by introducing…

The Euler phi function on a given integer $n$ yields the number of positive integers less than $n$ that are relatively prime to $n$. Equivalently, it gives the order of the group of units in the quotient ring $\mathbb{Z}/(n)$. We generalize…

In a previous paper, the authors proved that in any system of three linear forms satisfying obvious necessary local conditions, there are at least two forms that infinitely often assume $E_2$-values; i.e., values that are products of…

We present a detailed Hausdorff dimension analysis of the set of real numbers where the product of consecutive partial quotients in their continued fraction expansion grow at a certain rate but the growth of the single partial quotient is…

Let $K$ be a field and $\phi(z)\in K[z]$ be a polynomial. Define $\Phi(z) := \frac{1}{\phi(z)} \in K(z).$ For $n \in\mathbb{N}^* $, let the $n$-th iterate of $\Phi(z)$ be defined as $\Phi^{(n)}(z) = \underbrace{\Phi \circ \Phi \circ \cdots…

We introduce the generic Lah polynomials $L_{n,k}(\phi)$, which enumerate unordered forests of increasing ordered trees with a weight $\phi_i$ for each vertex with $i$ children. We show that, if the weight sequence $\phi$ is…

We define the $k$-dimensional generalized Euler function $\varphi_k(n)$ as the number of ordered $k$-tuples $(a_1,\ldots,a_k)\in {\Bbb N}^k$ such that $1\le a_1,\ldots,a_k\le n$ and both the product $a_1\cdots a_k$ and the sum $a_1+\cdots…

Let $f_1,\dots,f_k \in \mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an $n<x$ such that $\|f_i(n)\|\ll x^{-1/10.5kd(d-1)+o(1)}$ for all $1\le i\le k$. This improves on an earlier…

We investigate the continued fraction expansion of the infinite products $g(x) = x^{-1}\prod_{t=0}^\infty P(x^{-d^t})$ where polynomials $P(x)$ satisfy $P(0)=1$ and $\deg(P)<d$. We construct relations between partial quotients of $g(x)$…

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…