中文
相关论文

相关论文: Equal Sums of Like Powers with Minimum Number of T…

200 篇论文

Let $\{u_{n}\}_{n \geq 0}$ be a non-degenerate binary recurrence sequence with positive, square-free discriminant and $p$ be a fixed prime number. In this paper, we have shown the finiteness result for the solutions of the Diophantine…

数论 · 数学 2017-07-04 Eshita Mazumdar , S. S. Rout

Let $\bar{X}_{n}=(x_{1},\ldots,x_{n})$ and $\sigma_{i}(\bar{X}_{n})=\sum x_{k_{1}}\ldots x_{k_{i}}$ be $i$-th elementary symmetric polynomial. In this note we prove that there are infinitely many triples of integers $a, b, c$ such that for…

数论 · 数学 2013-05-28 Maciej Ulas

In this paper we consider the Diophantine equation \begin{align*}b^k +\left(a+b\right)^k &+ \cdots + \left(a\left(x-1\right) + b\right)^k=\\ &=d^l + \left(c+d\right)^l + \cdots + \left(c\left(y-1\right) + d\right)^l, \end{align*} where…

数论 · 数学 2013-12-13 A. Bazsó , D. Kreso , F. Luca , Á. Pintér

Let $S := \{p_1,\ldots ,p_{\ell}\}$ be a finite set of primes and denote by $\mathcal{U}_S$ the set of all rational integers whose prime factors are all in $S$. Let $(U_n)_{n\geq 0}$ be a non-degenerate linear recurrence sequence with order…

数论 · 数学 2023-02-28 P. K. Bhoi , S. S. Rout , G. K. Panda

Let $s(n)$ be the number of nonzero bits in the binary digital expansion of the integer $n$. We study, for fixed $k,\ell,m$, the Diophantine system $$ s(ab)=k, \quad s(a)=\ell,\quad \mbox{and }\quad s(b)=m, $$ in odd integer variables…

数论 · 数学 2021-12-07 Hajime Kaneko , Thomas Stoll

In this paper, we give all the solutions of the Diophantine equation x^2+7^{alpha}.11^{beta}=y^n, in nonnegative integers x, y, n>=3 with x and y coprime, except for the case when alpha.x is odd and beta is even.

数论 · 数学 2012-01-05 Gokhan Soydan

Let $\alpha$ and $\beta$ be real numbers such that $1$, $\alpha$ and $\beta$ are linearly independent over $\mathbb{Q}$. A classical result of Dirichlet asserts that there are infinitely many triples of integers $(x_0,x_1,x_2)$ such that…

数论 · 数学 2016-07-05 Damien Roy

We obtain asymptotics for sums of the form $$ \sum_{n=1}^P e(\alpha_kn^k + \alpha_1n), $$ involving lower order main terms. As an application, we show that for almost all $\alpha_2 \in [0,1)$ one has $$ \sup_{\alpha_1 \in [0,1)} \Big|…

Let $\mathcal{A}$ be a sequence of $rk$ terms which is made up of $k$ distinct integers each appearing exactly $r$ times in $\mathcal{A}$. The sum of all terms of a subsequence of $\mathcal{A}$ is called a subsequence sum of $\mathcal{A}$.…

数论 · 数学 2022-11-24 Jagannath Bhanja , Ram Krishna Pandey

Let $\{ {U_{n}\}_{n \geq 0} }$ be a non-degenerate binary recurrence sequence with positive discriminant. Let $\{p_1,\ldots, p_s\}$ be fixed prime numbers and $\{b_1,\ldots ,b_s\}$ be fixed non-negative integers. In this paper, we obtain…

数论 · 数学 2016-12-20 N. K. Meher , S. S. Rout

The inequalities concern the sum of s powers of primes with non-integer exponent c>1. Here s =2,3,4,or 5. The equations are similar, taking integer part before summing; here s = 3 or 5. New ranges of c are found in all cases for which many…

数论 · 数学 2020-08-31 Roger Baker

In this paper we completely solve the Diophantine equation $F_n+F_m=2^{a_1}+2^{a_2}+2^{a_3}+2^{a_4}+2^{a_5}$, where $F_k$ denotes the $k$-th Fibonacci number. In addition to complex linear forms in logarithms and the Baker-Davenport…

数论 · 数学 2021-04-27 Ingrid Vukusic , Volker Ziegler

This paper provides asymptotics with a sharp error term for the Dirichlet summatory function of a certain class of arithmetic functions. The result applies, e.g., to the sums over r^2(n) and r(n^3), where r(m) denotes the number of ways to…

数论 · 数学 2007-05-23 Manfred K"\uhleitner , Werner Georg Nowak

The aim of this paper is to prove the possibility of linearization of such equations by means of introduction of new variables. For $n=2$ such a procedure is well known, when new variables are components of spinors and they are widely used…

数论 · 数学 2007-05-23 Michael A. Ivanov

Let $\sigma_{i}(x_{1},\ldots, x_{n})=\sum_{1\leq k_{1}<k_{2}<\ldots <k_{i}\leq n}x_{k_{1}}\ldots x_{k_{i}}$ be the $i$-th elementary symmetric polynomial. In this note we generalize and extend the results obtained in a recent work of Zhang…

数论 · 数学 2013-05-28 Maciej Ulas

We present structural results on solutions to the Diophantine system $A{\boldsymbol y} = {\boldsymbol b}$, ${\boldsymbol y} \in \mathbb Z^t_{\ge 0}$ with the smallest number of non-zero entries. Our tools are algebraic and number theoretic…

最优化与控制 · 数学 2018-08-15 Iskander Aliev , Jesus A. De Loera , Timm Oertel , Christopher O'Neill

For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n}$ be the $k-$Fibonacci sequence which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for powers of 2 which are…

数论 · 数学 2014-10-01 Jhon J. Bravo , Carlos A. Gómez , Florian Luca

In this paper we obtain new parametric ideal solutions of the Tarry-Escott problem of degrees 2, 3 and 5, that is, of the diophantine systems $\sum_{i=1}^{k+1}x_i^j=\sum_{i=1}^{k+1}y_i^j,\;j=1,\,2,\,\dots,\,k$, when $k$ is 2, 3 or 5. When…

数论 · 数学 2021-06-29 Ajai Choudhry

The Diophantine sums $\sum_{n=1}^N \| n \alpha \|^{-1}$ and $\sum_{n=1}^N n^{-1} \| n \alpha \|^{-1}$ appear in many different areas including the ergodic theory of circle rotations, lattice point counting and random walks, often in…

数论 · 数学 2024-07-09 Bence Borda

Let E_n={x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}. There is an algorithm that for every computable function f:N->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any integer…

逻辑 · 数学 2014-10-21 Apoloniusz Tyszka
‹ 上一页 1 2 3 10 下一页 ›