ArticlePublisher preview available

The equation (w + x + y + z)(1/w + 1/x + 1/y + 1/z) = n

World Scientific
International Journal of Number Theory
Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

Bremner, Guy and Nowakowski [Which integers are representable as the product of the sum of three integers with the sum of their reciprocals? Math. Compos. 61(203) (1993) 117–130] investigated the Diophantine problem of representing integers n in the form (x + y + z)(1/x + 1/y + 1/z) for rationals x,y,z. For fixed n, the equation represents an elliptic curve, and the existence of solutions depends upon the rank of the curve being positive. They observed that the corresponding equation in four variables, the title equation here (representing a surface), has infinitely many solutions for each n, and remarked that it seemed plausible that there were always solutions with positive w,x,y,z when n ≥ 16. This is false, and the situation is quite subtle. We show that there cannot exist such positive solutions when n is of the form 4m2, 4m2 + 4, where m≢2(mod 4). Computations within our range seem to indicate that solutions exist for all other values of n.
May 16, 2018 9:18 WSPC/S1793-0421 203-IJNT 1850076
International Journal of Number Theory
Vol. 14, No. 5 (2018) 1229–1246
c
World Scientific Publishing Company
DOI: 10.1142/S1793042118500768
The equation (w+x+y+z)(1/w +1/x +1/y +1/z)=n
Andrew Bremnerand Tho Nguyen Xuan
School of Mathematical and Statistical Sciences
Arizona State University, Tempe, AZ 85287-1804, USA
bremner@asu.edu
tnguyenx@asu.edu
Received 9 May 2017
Accepted 8 September 2017
Published 25 January 2018
Bremner, Guy and Nowakowski [Which integers are representable as the product of the
sum of three integers with the sum of their reciprocals? Math. Compos. 61(203) (1993)
117–130] investigated the Diophantine problem of representing integers nin the form
(x+y+z)(1/x +1/y +1/z) for rationals x, y , z.Forxedn, the equation represents an
elliptic curve, and the existence of solutions depends upon the rank of the curve being
positive. They observed that the corresponding equation in four variables, the title equa-
tion here (representing a surface), has infinitely many solutions for each n, and remarked
that it seemed plausible that there were always solutions with po sit i ve w, x, y, z when
n16. This is false, and the situation is quite subtle. We show that there cannot exist
such positive solutions when nis of the form 4m2,4m2+4, where m≡ 2 (mod 4). Com-
putations within our range seem to indicate that solutions exist for all other values of n.
Keywords: Elliptic curve; quartic surface; Diophantine representation; Hilbert symbol.
Mathematics Subject Classification 2010: 11D25, 11G05, 11D85, 14G05
1. Introduction
In Bremner, Guy and Nowakowski [1], the authors investigate the Diophantine
problem of representing integers nin the form (x+y+z)(1/x+1/y+1/z) for rationals
x, y, z , which is equivalent to studying rational points on a parametrized family of
elliptic curves. Solutions for x, y, z depend upon the rational rank of the curve being
positive. In their concluding remarks, they observe that the corresponding equation
in four variables, representing a surface,
(w+x+y+z)(1/w +1/x +1/y +1/z)=n, (1.1)
has infinitely many solutions for each n, following from the parametrization
(w, x, y, z)=((n1)t, t2+t+1,(n1)t(t+1),(t+1)(n1)).
The minimum value of the form on the left-hand side of (1.1) as w, x, y, z take
on positive real values is equal to 16. The question arises as to whether there are
1229
... The size of positive integer solutions to (2) for small even values of n could be large, see [1, Table 2]. The goal of this paper is to extend Theorem 1.1. ...
... . Therefore E is an elliptic curve and the set E(R) has two components: the bounded component with x < 0 and the unbounded component with x ≥ 0. A remarkable property of the curve E is that it has no rational points on the bounded component x < 0. This surprising property also holds for many other curves, see [1,2,5,8,9,10]. ...
... Remark 3.7. The method in this paper allows one to study the results in [1,2,5,8,9,10] within the Brauer-Manin obstruction framework. A major part in [1,2,5,8,9,10] is to show the nonexistence of rational points on the bounded component x < 0 on certain elliptic curves E of the form y 2 = x(x 2 + Ax + B) ...
Article
Full-text available
Bremner and Macleod [An unusual cubic representation problem, Ann. Math. Inform. 43 (2014), 29-41] showed that for all odd positive integers n, the equation n = x y + z + y z + x + z x + y has no solutions in the positive integers. We extend this theorem to the equation 2na 2 b 2 c 2 − a 2 − b 2 − c 2 = a 2 x y + z + b 2 y z + x + c 2 z x + y , (1) where a, b, c ∈ Z − {0} and n, x, y, z ∈ Z +. Furthermore, we show that the insolubility (1) (under some conditions on a, b, c, n) can be explained by a Brauer-Manin obstruction for weak approximation for an elliptic curve model of the defining equation.
... So in (3)(4)(5)(6)(7)(8)(9)(10)(11)(12)(13) we have (−n, 1 + n X ) 2 = 1. ...
... Since 2 ∤ X 1 , from (3)(4)(5)(6)(7)(8)(9)(10)(11)(12)(13)(14) we have 3t − 2 + 2v 2 (Y ) = 0. Hence, 2 | t. Since t + 2s + 2 ≥ 3, taking (3-14) mod 8 gives X 1 ≡ 1 (mod 8). ...
... So in (3)(4)(5)(6)(7)(8)(9)(10)(11)(12)(13)(14), we have (−n, 1 + n X ) 2 = 1. ...
Article
Full-text available
... The following is the main idea of our method which has been applied to many different problems, see [3][4][5][6][7][8]. ...
Article
Melvyn Knight's problem asks for positive integers n that can be represented as n = (x + y + z)(1 x + 1 y + 1 z) with integers x, y, z. In this paper, we investigate integers n that can be represented as n = x + y + z a 2 b 2 c 2 (a 2 x + b 2 y + c 2 z) (1) with integers x, y, z, a, b, c. For integers n, a, b, c satisfying 4|n or 8|n − 5, a + b + c = −1, and abc is a square number, we show that the representation (1) is essentially unique if na 2 b 2 c 2 = (|a| + |b| + |c|) 2 and is impossible if na 2 b 2 c 2 = (|a| + |b| + |c|) 2 .
... This idea has been applied to different problems. For the problem on the presentation of positive integers n in the form n = (x + y + z)(a 2 /x + b 2 /y + c 2 /z), n = (x + y + z) 3 /(xyz), or n = (x + y + z + w)(1/x + 1/y + 1/z + 1/w), where x, y, z, w ∈ Z + see [4,[16][17][18]. For the problem on the presentation of positive integers n in the form n = x/y +y/z +dz/x, n = x/y +y/z +z/w+w/x, or n = x/y +py/z +z/w+pw/x, where x, y, z, w, d ∈ Z + and p is a prime, see [6,14,15]. ...
Article
Full-text available
In this paper, we study the problem on the sum of four rational numbers with a fixed product. We will show that when d in an odd positive integer, the equation xy+dyz+zw+dwx=4dnxy+dyz+zw+dwx=4dn\begin{aligned} \dfrac{x}{y}+d\dfrac{y}{z}+\dfrac{z}{w}+d\dfrac{w}{x}=4dn \end{aligned}does not have solutions in positive integers if 2|n or dn2=1+22mqdn2=1+22mqdn^2=1+2^{2m}q, where m,q∈Z+m,qZ+m,\,q\in {\mathbb {Z}}^{+}, m≥2m2m\ge 2, and 8|q+18q+18|q+1. This extends the recent results of the author and Dofs and Tho (Int J Number Theory, 18 (1): 75–87, 2022 and Tho (Vietnam J Math 50 (1):183–194, 2022).
... This idea can be applied to different problems. For the problem on the presentation of positive integers n in the form n = (x+y+z [2,11]. For the problem on the presentation of positive integers n in the form n = x/y + y/z + dz/x or n = x/y + dy/z + z/w + dw/x, where x, y, z, w, d ∈ Z + , see [4,10,12]. ...
Article
In the 1993 Western Number Theory Conference, Richard Guy proposed Problem 93:31, which asks for integers n representable by (x+y+z)3/xyz{(x+y+z)^3}/{xyz} , where x,y,zx,\,y,\,z are integers, preferably with positive integer solutions. We show that the representation n=(x+y+z)3/xyzn={(x+y+z)^3}/{xyz} is impossible in positive integers x,y,zx,\,y,\,z if n=4k(a2+b2)n=4^{k}(a^2+b^2) , where k,a,bZ+k,\,a,\,b\in \mathbb {Z}^{+} are such that k3k\geq 3 and 2a+b2\nmid a+b .
Article
Full-text available
It is a subtle question as to when the Diophantine equation of the tittle has solutions in positive integers. Here, we show that the equation in the title does not have solutions in positive integers in the case that n is of the form n = 4q, where q2 − 1 = 2hq 1, with h,q1 ∈ ℤ+, 2|h, h ≥ 4, and 8|q1 + 1. We do this by explicitly calculating a Brauer–Manin obstruction to weak approximation on the elliptic surface defined by the title equation.
Article
For a non-zero integer N, we consider the problem of finding 3 integers (a, b, c) such that (formula presented). We show that the existence of solutions is related to points of infinite order on a family of elliptic curves. We discuss strictly positive solutions and prove the surprising fact that such solutions do not exist for N odd, even though there may exist solutions with one of a, b, c negative. We also show that, where a strictly positive solution does exist, it can be of enormous size (trillions of digits, even in the range we consider).
Article
For example, the integer 564 is so representable by the three integers 122 44200 50100028778116351171 17995213613513491867, -3460 69586 84255 04865 64589 22621 88752 08971 30654 24460 and 74807 1910153025 27837945836017146464 94820 59055 28060.
Article
In the rst of two papers on Magma, a new system for computational algebra, we present the Magma language, outline the design principles and theoretical background, and indicate its scope and use. Particular attention is given to the constructors for structures, maps, and sets. c 1997 Academic Press Limited Magma is a new software system for computational algebra, the design of which is based on the twin concepts of algebraic structure and morphism. The design is intended to provide a mathematically rigorous environment for computing with algebraic struc- tures (groups, rings, elds, modules and algebras), geometric structures (varieties, special curves) and combinatorial structures (graphs, designs and codes). The philosophy underlying the design of Magma is based on concepts from Universal Algebra and Category Theory. Key ideas from these two areas provide the basis for a gen- eral scheme for the specication and representation of mathematical structures. The user language includes three important groups of constructors that realize the philosophy in syntactic terms: structure constructors, map constructors and set constructors. The util- ity of Magma as a mathematical tool derives from the combination of its language with an extensive kernel of highly ecient C implementations of the fundamental algorithms for most branches of computational algebra. In this paper we outline the philosophy of the Magma design and show how it may be used to develop an algebraic programming paradigm for language design. In a second paper we will show how our design philoso- phy allows us to realize natural computational \environments" for dierent branches of algebra. An early discussion of the design of Magma may be found in Butler and Cannon (1989, 1990). A terse overview of the language together with a discussion of some of the implementation issues may be found in Bosma et al. (1994).