English
Related papers

Related papers: Linear Diophantine equations in Piatetski-Shapiro …

200 papers

In an earlier paper, Tatong and Suvarnamani explores the Diophantine equation $p^x + p^y = z^2$ for a prime number $p$. In that paper they find some solutions to the equation for $p=2, 3$. In this paper, we look at a general version of this…

Number Theory · Mathematics 2017-09-07 Dibyajyoti Deb

A set is said to be \emph{3-free} if no three elements form an arithmetic progression. Given a 3-free set $A$ of integers $0=a_0<a_1<\cdots<a_t$, the \emph{Stanley sequence} $S(A)=\{a_n\}$ is defined using the greedy algorithm: For each…

Combinatorics · Mathematics 2014-08-21 David Rolnick , Praveen S. Venkataramana

We are studying the Diophantine exponent \mu_{n,l}$ defined for integers 1 \leq l < n and a vector \alpha \in \mathbb{R}^n by letting \mu_{n,l} = \sup{\mu \geq 0: 0 < ||x \cdot \alpha|| < H(x)^{-\mu} for infinitely many x \in C_{n,l} \cap…

Number Theory · Mathematics 2009-11-13 Yann Bugeaud , Simon Kristensen

In this paper one shows if the number of natural solutions of a general linear equation is limited or not. Also, it is presented a method of solving the Diophantine equation $ax-by=c$ in the set of natural numbers, and an example of solving…

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

For a non-integral real number $c>1$, let $\mathbb{N}_{(c)}:=\{\lfloor n^c\rfloor ~|~ n\in\mathbb{N}\}$. We show that $\mathbb{N}_{(c)}$ contains thin subbases of every order $h\geq 5$ when $1<c<2$, and $h\geq (\lfloor 2c\rfloor+1)(\lfloor…

Number Theory · Mathematics 2026-05-07 Christian Táfula

Let $m\geq 3$. Suppose that $$ 1-2^{-2^{m^24^m}}<\gamma<1. $$ Then the set $$ \{p\text{ prime}:\, p=[n^{\frac1\gamma}]\text{ for some }n\in{\mathbb N}\} $$ contains infinitely many non-trivial $m$-term arithmetic progressions.

Number Theory · Mathematics 2019-01-29 Hongze Li , Hao Pan

Let $n$ be a non-negative integer and put $p_{n}(x)=\prod_{i=0}^{n}(x+i)$. In the first part of the paper, for given $n$, we study the existence of integer solutions of the Diophantine equation $$ y^m=p_{n}(x)+\sum_{i=1}^{k}p_{a_{i}}(x), $$…

Number Theory · Mathematics 2018-09-13 Szabolcs Tengely , Maciej Ulas

Given the solution $f$ of the sequential fractional differential equation $_{a}D_{t}^{\alpha}(_{a}D_{t}^{\alpha}f)+P(t)f=0$, $t\in[b,c]$, where $-\infty<a<b<c<+\infty$, $\alpha\in({1/2},1)$ and $P:[a,+\infty)\to[0,P_{\infty}]$,…

Dynamical Systems · Mathematics 2009-04-10 Octavian G. Mustafa , Thabet Abdeljawad , Dumitru Baleanu , Fahd Jarad , Juan J. Trujillo

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…

Number Theory · Mathematics 2016-12-20 N. K. Meher , S. S. Rout

Starting from degree N solutions of a time dependent Schroedinger-like equation for classical orthogonal polynomials, a linear matrix equation describing perturbations around the N zeros of the polynomial is derived. The matrix has…

Classical Analysis and ODEs · Mathematics 2015-06-23 Ryu Sasaki

A number alpha in R is diophantine if it is not well approximable by rationals, i.e. for some C, nu>0 and any relatively prime p, q in Z we have |alpha q -p|>C q^{-1-\vu}. It is well-known and easy to prove that almost every alpha in R is…

Number Theory · Mathematics 2007-05-23 Vadim Kaloshin , I. Rodnianski

In this paper, we find all the solutions of the Diophantine equation $P_\ell + P_m +P_n=2^a$, in nonnegative integer variables $(n,m,\ell, a)$ where $P_k$ is the $k$-th term of the Pell sequence $\{P_n\}_{n\ge 0}$ given by $P_0=0$, $P_1=1$…

Number Theory · Mathematics 2016-08-23 Jhon J. Bravo , Bernadette Faye , Florian Luca

These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…

Number Theory · Mathematics 2010-03-17 Michael Stoll

Let k => 1, m => 1 be small fixed integers, gcd(k, m) = 1. This note develops some techniques for proving the existence of infinitely many primes solutions x = p, and y = q of the linear Diophantine equation y = mx + k.

General Mathematics · Mathematics 2014-04-04 N. A. Carella

We prove a new bound to the exponential sum of the form $$ \sum_{h \sim H}\delta_h \mathop{\sum_{m\sim M}\sum_{n\sim N}}_{mn\sim x}a_{m}b_{n}\e\big(\alpha mn + h(mn + u)^{\gamma}\big), $$ by a new approach to the Type I sum. The sum can be…

Number Theory · Mathematics 2025-12-10 Li Lu , Lingyu Guo , Victor Z. Guo

For $0<\alpha<1$, we study the zeros of the sequence of polynomials $\left\{ P_{m}(z)\right\} _{m=0}^{\infty}$ generated by the reciprocal of $(1-t)^{\alpha}(1-2zt+t^{2})$, expanded as a power series in $t$. Equivalently, this sequence is…

Classical Analysis and ODEs · Mathematics 2020-06-23 Summer Al Hamdani , Khang Tran

In this work we develop exact formulas to the number of solutions of $ax+by+cz=n$ in some special cases. In 2020, Binner gave a formula for the number of non negative integer solutions, $N(a,b,c;n)$ in non-negative integer pairs $(x,y,z),$…

Number Theory · Mathematics 2026-04-14 Pooja Teotia

We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…

Logic in Computer Science · Computer Science 2026-05-19 Piotr Bacik , Joris Nieuwveld , Joël Ouaknine , Mihir Vahanwala , Madhavan Venkatesh , Emil Rugaard Wieser

We show that given $\alpha \in (0, 1)$ there is a constant $c=c(\alpha) > 0$ such that any planar $(\alpha, 2\alpha)$-Furstenberg set has Hausdorff dimension at least $2\alpha + c$. This improves several previous bounds, in particular…

Classical Analysis and ODEs · Mathematics 2024-08-19 Kornélia Héra , Pablo Shmerkin , Alexia Yavicoli

In this paper we obtain a sharp upper bound for the number of solutions to a certain diophantine inequality involving fractions with power denominator. This problem is motivated by a conjecture of Zhao concerning the spacing of such…

Number Theory · Mathematics 2019-04-22 Bryce Kerr
‹ Prev 1 3 4 5 6 7 10 Next ›