English
Related papers

Related papers: Repdigits in k-generalized Pell sequence

200 papers

Let $d$ be a square-free integer and $\mathbb{Z}[\sqrt{d}]$ a quadratic ring of integers. For a given $n\in\mathbb{Z}[\sqrt{d}]$, a set of $m$ non-zero distinct elements in $\mathbb{Z}[\sqrt{d}]$ is called a Diophantine $D(n)$-$m$-tuple (or…

Number Theory · Mathematics 2024-06-27 Kalyan Chakraborty , Shubham Gupta , Azizul Hoque

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

Number Theory · Mathematics 2017-04-21 Zhi-Wei Sun

We have primarily obtained three results on numbers of the form $p + 2^k$. Firstly, we have constructed many arithmetic progressions, each of which does not contain numbers of the form $p + 2^k$, disproving a conjecture by Erd\H{o}s as Chen…

Number Theory · Mathematics 2024-02-13 Yuda Chen , Xiangjun Dai , Huixi Li

In this paper we raise a variant of a classic problem in extremal graph theory, which is motivated by a design of fractional repetition codes, a model in distributed storage systems. For any feasible positive integers $d\geq 3$, $n \geq 3$,…

Combinatorics · Mathematics 2016-08-15 Tuvi Etzion

Let $p$ be a prime number with $p>3$, $p\equiv 3\pmod{4}$ and let $n$ be a positive integer. In this paper, we prove that the Diophantine equation $(5pn^{2}-1)^{x}+(p(p-5)n^{2}+1)^{y}=(pn)^{z}$ has only the positive integer solution…

Number Theory · Mathematics 2020-02-27 Elif Kızıldere , Gökhan Soydan

Using Pascal triangle, we give a simple generalization to the so-called STRAND Puzzle solved by Srinivasa Ramanujan. Thus we are interested in computing the median, first and third quartiles of some integer valued distributions, arising…

Number Theory · Mathematics 2022-02-08 Daniel Gandolfo , Michel Rouleux

In this paper, we consider the equation $(a^n-2^{m})(b^n-2^{m})=x^2$. By assuming the abc conjecture is true, in [8], Luca and Walsh gave a theorem, which implies that the above equation has only finitely many solutions $n,x$ if a and b are…

Number Theory · Mathematics 2018-01-16 Zafer Şiar , Refik Keskin

In this paper, we examine the Diophantine problem given by the equation $F_n = F_l^k (F_l^m - 1)$, where $n, l, m \geq 1$ and $k \geq 3$. Here, $\{ F_t \}_{t=0}^{\infty} $ denotes the Fibonacci numbers, defined by the recurrence relation…

Number Theory · Mathematics 2024-12-18 Seyran S. Ibrahimov , Nazim I. Mahmudov

We study the distribution of the values of the form $\lambda_1 p_1 + \lambda_2 p_2 + \lambda_3 p_3^k$, where $\lambda_1$, $\lambda_2$ and $\lambda_3$ are non-zero real number not all of the same sign, with $\lambda_1 / \lambda_2$…

Number Theory · Mathematics 2016-06-15 Alessandro Languasco , Alessandro Zaccagnini

Let $1<c<\frac{1787}{1502}$ and $N$ be a sufficiently large real number. In this paper, it is proved that for any arbitrarily large number $E>0$ and for almost all real $R \in (N,2N]$, the Diophantine inequality…

Number Theory · Mathematics 2023-12-15 Yuhui Liu

A Wagstaff prime is a prime number of the form $(2^{\mathfrak{p}}+1)/3$, where $\mathfrak{p}$ is an odd prime. Let $(L_n^{(k)})_{n\geq 2-k}$ be the $k$-Lucas number sequence defined by the recurrence relation $ L_n^{(k)} = L_{n-1}^{(k)} +…

Number Theory · Mathematics 2026-02-25 Herbert Batte

In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…

Number Theory · Mathematics 2026-04-22 Takafumi Miyazaki , Reese Scott , Robert Styer

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…

Number Theory · Mathematics 2023-02-28 P. K. Bhoi , S. S. Rout , G. K. Panda

Two permutations of $[n]=\{1,2 \ldots n\}$ are \textit{$k$-neighbor separated} if there are two elements that are neighbors in one of the permutations and that are separated by exactly $k-2$ other elements in the other permutation. Let the…

Combinatorics · Mathematics 2017-11-22 István Kovács , Daniel Soltész

For all $k\geq 2$, we provide almost-sharp quantitative results for the $k$-dimensional Duffin-Schaeffer conjecture, analogous to recent developments in the 1-D case of Koukoulopoulos-Maynard-Yang. In particular, for…

Number Theory · Mathematics 2026-02-24 Connor O'Reilly

In this paper, we solve the simultaneous Diophantine equations m.(x_1^k+....+x_{t_1}^k)=n.(y_1^k+....+y_{t_2}^k); k=1,3, where t_1, t_2>3, and m, n are fixed arbitrary and relatively prime positive integers. This is done by choosing two…

Number Theory · Mathematics 2017-05-04 Farzali Izadi , Mehdi Baghalaghdam

We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many…

Number Theory · Mathematics 2026-01-21 Sándor Z. Kiss , Csaba Sándor , Maciej Zakarczemny

We study the set $\mathcal{S}$ of odd positive integers $n$ with the property ${2n}/{\sigma(n)} - 1 = 1/x$, for positive integer $x$, i.e., the set that relates to odd perfect and odd "spoof perfect" numbers. As a consequence, we find that…

Number Theory · Mathematics 2021-11-29 László Tóth

In this paper we extend a result of Hirata-Kohno, Laishram, Shorey and Tijdeman on the Diophantine equation $n(n+d)...(n+(k-1)d)=by^2,$ where $n,d,k\geq 2$ and $y$ are positive integers such that $\gcd(n,d)=1.$

Number Theory · Mathematics 2015-05-13 Szabolcs Tengely

Inspired by a question asked on the list {\tt mathfun}, we revisit {\em Kempner-like series}, i.e., harmonic sums $\sum' 1/n$ where the integers $n$ in the summation have ``restricted'' digits. First we give a short proof that $\lim_{k \to…

Number Theory · Mathematics 2024-03-25 Jean-Paul Allouche , Claude Morin
‹ Prev 1 4 5 6 7 8 10 Next ›