A diophantine problem in ℤ[1 + \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} \(\sqrt d\) \end{document})/2]

2009 ◽  
Vol 46 (1) ◽  
pp. 103-112 ◽  
Author(s):  
Zrinka Franušić
Keyword(s):  
Positive Integer ◽  
Diophantine Problem ◽  
Pellian Equation ◽  
Diophantine Quadruples

We characterize the existence of infinitely many Diophantine quadruples with the property D ( z ) in the ring ℤ[1 + \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\sqrt d$$ \end{document})/2], where d is a positive integer such that the Pellian equation x2 − dy2 = 4 is solvable, in terms of representability of z as a difference of two squares.

scholarly journals ON THE FAMILY OF DIOPHANTINE TRIPLES {k− 1,k+ 1, 16k3− 4k}

2007 ◽  
Vol 49 (2) ◽  
pp. 333-344 ◽  
Author(s):  
YANN BUGEAUD ◽  
ANDREJ DUJELLA ◽  
MAURICE MIGNOTTE
Keyword(s):  
Positive Integer ◽  
Recent Result ◽  
The Family ◽  
Diophantine Triples ◽  
Image Position ◽  
Diophantine Quadruples

AbstractIt is proven that ifk≥ 2 is an integer anddis a positive integer such that the product of any two distinct elements of the setincreased by 1 is a perfect square, thend= 4kord= 64k5−48k3+8k. Together with a recent result of Fujita, this shows that all Diophantine quadruples of the form {k− 1,k+ 1,c,d} are regular.

scholarly journals Reduced diophantine quadruples with the binary recurrence Gn = AGn–1 – Gn–2

2015 ◽  
Vol 23 (2) ◽  
pp. 23-31
Author(s):  
Murat Alp ◽  
Nurettin Irmak ◽  
László Szalay
Keyword(s):  
Positive Integer ◽  
Recurrence Relation ◽  
Initial Values ◽  
Diophantine Quadruples

Abstract Given a positive integer A ≠ 2. In this paper, we show that there do not exist two positive integer pairs {a,b} ≠ {c,d} such that the values of ac+1, ad+1 and bc+1, bd+1 are the terms of the sequence {Gn}n≥0 which satisfies the recurrence relation Gn = AGn-1 - Gn-2 with the initial values G0 = 0, G1 = 1.

There are no Diophantine quadruples of Pell numbers

2021 ◽  
pp. 1-19
Author(s):  
Salah Eddine Rihane ◽  
Florian Luca ◽  
Alain Togbé
Keyword(s):  
Positive Integer ◽  
Pell Numbers ◽  
Pell Number ◽  
Diophantine Quadruples ◽  
Positive Integers

In this paper, we prove that there are no positive integers [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text] such that [Formula: see text] is a Diophantine quadruple, where for a positive integer [Formula: see text], [Formula: see text] is the [Formula: see text]th Pell number.

Pellian equations of special type

2021 ◽  
Vol 71 (6) ◽  
pp. 1599-1607
Author(s):  
Mirela Jukić Bokun ◽  
Ivan Soldo
Keyword(s):  
Positive Integer ◽  
Pellian Equation ◽  
Pellian Equations ◽  
Positive Integers

Abstract In this paper, we consider the solvability of the Pellian equation x 2 − ( d 2 + 1 ) y 2 = − m , $$\begin{array}{} \displaystyle x^2-(d^2+1)y^2 = -m, \end{array} $$ in cases d = nk , m = n 2l−1, where k, l are positive integers, n is a composite positive integer and d = pq, m = pq 2, p, q are primes. We use the obtained results to prove results on the extendibility of some D(−1)-pairs to quadruples in the ring Z [ − t ] $\begin{array}{} {\mathbb{Z}}[\sqrt{-t}] \end{array} $ , with t > 0.

The Order of Monochromatic Subgraphs with a Given Minimum Degree

10.37236/1725 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Yair Caro ◽  
Raphael Yuster
Keyword(s):  
Positive Integer ◽  
Minimum Degree

Let $G$ be a graph. For a given positive integer $d$, let $f_G(d)$ denote the largest integer $t$ such that in every coloring of the edges of $G$ with two colors there is a monochromatic subgraph with minimum degree at least $d$ and order at least $t$. Let $f_G(d)=0$ in case there is a $2$-coloring of the edges of $G$ with no such monochromatic subgraph. Let $f(n,k,d)$ denote the minimum of $f_G(d)$ where $G$ ranges over all graphs with $n$ vertices and minimum degree at least $k$. In this paper we establish $f(n,k,d)$ whenever $k$ or $n-k$ are fixed, and $n$ is sufficiently large. We also consider the case where more than two colors are allowed.

Extensions of Rings Having McCoy Condition

2009 ◽  
Vol 52 (2) ◽  
pp. 267-272 ◽  
Author(s):  
Muhammet Tamer Koşan
Keyword(s):  
Positive Integer ◽  
Associative Ring ◽  
Nonzero Element ◽  
Ring Extensions

AbstractLet R be an associative ring with unity. Then R is said to be a right McCoy ring when the equation f (x)g(x) = 0 (over R[x]), where 0 ≠ f (x), g(x) ∈ R[x], implies that there exists a nonzero element c ∈ R such that f (x)c = 0. In this paper, we characterize some basic ring extensions of right McCoy rings and we prove that if R is a right McCoy ring, then R[x]/(xn) is a right McCoy ring for any positive integer n ≥ 2.

EVALUATION OF CONVOLUTION SUMS AND FOR k = a · b = 21, 33, AND 35

2021 ◽  
pp. 1-20
Author(s):  
K. PUSHPA ◽  
K. R. VASUKI
Keyword(s):  
Positive Integer ◽  
Quadratic Form ◽  
Eisenstein Series ◽  
Modular Forms ◽  
Divisor Function ◽  
Convolution Sums

Abstract The article focuses on the evaluation of convolution sums $${W_k}(n): = \mathop \sum \nolimits_{_{m < {n \over k}}} \sigma (m)\sigma (n - km)$$ involving the sum of divisor function $$\sigma (n)$$ for k =21, 33, and 35. In this article, our aim is to obtain certain Eisenstein series of level 21 and use them to evaluate the convolution sums for level 21. We also make use of the existing Eisenstein series identities for level 33 and 35 in evaluating the convolution sums for level 33 and 35. Most of the convolution sums were evaluated using the theory of modular forms, whereas we have devised a technique which is free from the theory of modular forms. As an application, we determine a formula for the number of representations of a positive integer n by the octonary quadratic form $$(x_1^2 + {x_1}{x_2} + ax_2^2 + x_3^2 + {x_3}{x_4} + ax_4^2) + b(x_5^2 + {x_5}{x_6} + ax_6^2 + x_7^2 + {x_7}{x_8} + ax_8^2)$$ , for (a, b)=(1, 7), (1, 11), (2, 3), and (2, 5).

scholarly journals On the Ternary Exponential Diophantine Equation Equating a Perfect Power and Sum of Products of Consecutive Integers

Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1813
Author(s):  
S. Subburam ◽  
Lewis Nkenyereye ◽  
N. Anbazhagan ◽  
S. Amutha ◽  
M. Kameswari ◽  
...  
Keyword(s):  
Positive Integer ◽  
Diophantine Equation ◽  
Upper Bound ◽  
Exponential Diophantine Equation ◽  
Research Article ◽  
All Solutions ◽  
Sum Of Products ◽  
Consecutive Integers ◽  
Sums Of Products ◽  
Positive Integers

Consider the Diophantine equation yn=x+x(x+1)+⋯+x(x+1)⋯(x+k), where x, y, n, and k are integers. In 2016, a research article, entitled – ’power values of sums of products of consecutive integers’, primarily proved the inequality n= 19,736 to obtain all solutions (x,y,n) of the equation for the fixed positive integers k≤10. In this paper, we improve the bound as n≤ 10,000 for the same case k≤10, and for any fixed general positive integer k, we give an upper bound depending only on k for n.

scholarly journals Repdigits as products of consecutive Padovan or Perrin numbers

2021 ◽  
Author(s):  
Salah Eddine Rihane ◽  
Alain Togbé
Keyword(s):  
Positive Integer ◽  
Decimal Expansion

AbstractA repdigit is a positive integer that has only one distinct digit in its decimal expansion, i.e., a number of the form $$a(10^m-1)/9$$ a ( 10 m - 1 ) / 9 , for some $$m\ge 1$$ m ≥ 1 and $$1 \le a \le 9$$ 1 ≤ a ≤ 9 . Let $$\left( P_n\right) _{n\ge 0}$$ P n n ≥ 0 and $$\left( E_n\right) _{n\ge 0}$$ E n n ≥ 0 be the sequence of Padovan and Perrin numbers, respectively. This paper deals with repdigits that can be written as the products of consecutive Padovan or/and Perrin numbers.

Sign in / Sign up

Export Citation Format

Share Document