We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Online ordering will be unavailable from 17:00 GMT on Friday, April 25 until 17:00 GMT on Sunday, April 27 due to maintenance. We apologise for the inconvenience.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure [email protected]
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Let (a,b,c) be a primitive Pythagorean triple such that b is even. In 1956, Jeśmanowicz conjectured that the equation ax+by=cz has the unique solution (x,y,z)=(2,2,2) in the positive integers. This is one of the most famous unsolved problems on Pythagorean triples. In this paper we propose a similar problem (which we call the shuffle variant of Jeśmanowicz’ problem). Our problem states that the equation cx+by=az with x,y and z positive integers has the unique solution (x,y,z)=(1,1,2) if c=b+1and has no solutions if c>b+1 . We prove that the shuffle variant of the Jeśmanowicz problem is true if c≡1 mod b.
We study Markov measures and p-adic random walks with the use of states on the Cuntz algebras Op. Via the Gelfand–Naimark–Segal construction, these come from families of representations of Op. We prove that these representations reflect selfsimilarity especially well. In this paper, we consider a Cuntz–Krieger type algebra where the adjacency matrix depends on a parameter q ( q=1 is the case of Cuntz–Krieger algebra). This is an ongoing work generalizing a construction of certain measures associated to random walks on graphs.
A Diophantinem-tuple is a set A of m positive integers such that ab+1 is a perfect square for every pair a,b of distinct elements of A. We derive an asymptotic formula for the number of Diophantine quadruples whose elements are bounded by x. In doing so, we extend two existing tools in ways that might be of independent interest. The Erdős–Turán inequality bounds the discrepancy between the number of elements of a sequence that lie in a particular interval modulo 1 and the expected number; we establish a version of this inequality where the interval is allowed to vary. We also adapt an argument of Hooley on the equidistribution of solutions of polynomial congruences to handle reducible quadratic polynomials.
In this paper, we study how close the terms of a finite arithmetic progression can get to a perfect square. The answer depends on the initial term, the common difference and the number of terms in the arithmetic progression.
In Gun and Ramakrishnan [‘On special values of certain Dirichlet L-functions’, Ramanujan J.15 (2008), 275–280], we gave expressions for the special values of certain Dirichlet L-function in terms of finite sums involving Jacobi symbols. In this note we extend our earlier results by giving similar expressions for two more special values of Dirichlet L-functions, namely L(−1,χm) and L(−2,χ−m′), where m,m′ are square-free integers with m≡1 mod 8 and m′≡3 mod 8 and χD is the Kronecker symbol . As a consequence, using the identities of Cohen [‘Sums involving the values at negative integers of L-functions of quadratic characters’, Math. Ann.217 (1975), 271–285], we also express the finite sums with Jacobi symbols in terms of sums involving divisor functions. Finally, we observe that the proof of Theorem 1.2 in Gun and Ramakrishnan (as above) is a direct consequence of Equation (24) in Gun, Manickam and Ramakrishnan [‘A canonical subspace of modular forms of half-integral weight’, Math. Ann.347 (2010), 899–916].
We discuss the Mordell–Weil sieve as a general technique for proving results concerning rational points on a given curve. In the special case of curves of genus 2, we describe quite explicitly how the relevant local information can be obtained if one does not want to restrict to mod p information at primes of good reduction. We describe our implementation of the Mordell–Weil sieve algorithm and discuss its efficiency.
Let f∈ℚ[X] and let us consider a Diophantine equation z2=f(x)2±f(y)2. In this paper, we continue the study of the existence of integer solutions of the equation, when the degree of f is 2 and if f(x) is a triangular number or a tetrahedral number.
We generalize the main result of the paper by Bennett and Mulholland [‘On the diophantine equation xn+yn=2αpz2’, C. R. Math. Acad. Sci. Soc. R. Can.28 (2006), 6–11] concerning the solubility of the diophantine equation xn+yn=2αpz2. We also demonstrate, by way of examples, that questions about solubility of a class of diophantine equations of type (3,3,p) or (4,2,p) can be reduced, in certain cases, to studying several equations of the type (p,p,2).
We exhibit central simple algebras over the function field of a diagonal quartic surface over the complex numbers that represent the 2-torsion part of its Brauer group. We investigate whether the 2-primary part of the Brauer group of a diagonal quartic surface over a number field is algebraic and give sufficient conditions for this to be the case. In the last section we give an obstruction to weak approximation due to a transcendental class on a specific diagonal quartic surface, an obstruction which cannot be explained by the algebraic Brauer group which in this case is just the constant algebras.
When p is a prime number, and k1,…,kt are natural numbers with 1≤k1<k2<⋯<kt<p, we show that the simultaneous congruences ∑ t1xkji≡∑ t1ykjimodp (1≤j≤t) possess at most k1⋯ktpt solutions with 1≤xi,yi≤p (1≤i≤t). Analogous conclusions are provided when one or more of the exponents ki is negative.
Let X be a projective cubic hypersurface of dimension 11 or more, which is defined over ℚ. We show that X(ℚ) is non-empty provided that the cubic form defining X can be written as the sum of two forms that share no common variables.
We show that a system of r quadratic forms over a 𝔭-adic field in at least 4r+1 variables will have a non-trivial zero as soon as the cardinality of the residue field is large enough. In contrast, the Ax–Kochen theorem [J. Ax and S. Kochen, Diophantine problems over local fields. I, Amer. J. Math. 87 (1965), 605–630] requires the characteristic to be large in terms of the degree of the field over ℚp. The proofs use a 𝔭-adic minimization technique, together with counting arguments over the residue class field, based on considerations from algebraic geometry.
Let a, b, c, x and y be positive integers. In this paper we sharpen a result of Le by showing that the Diophantine equation has at most two positive integer solutions (m,n) satisfying min (m,n)>1.
Let 𝒜={as(mod ns)}ks=0 be a system of residue classes. With the help of cyclotomic fields we obtain a theorem which unifies several previously known results related to the covering multiplicity of 𝒜. In particular, we show that if every integer lies in more than m0=⌊∑ ks=11/ns⌋ members of 𝒜, then for any a=0,1,2,… there are at least subsets I of {1,…,k} with ∑ s∈I1/ns=a/n0. We also characterize when any integer lies in at most m members of 𝒜, where m is a fixed positive integer.
Let u(n)=f(gn), where g > 1 is integer and f(X) ∈ ℤ[X] is non-constant and has no multiple roots. We use the theory of -unit equations as well as bounds for character sums to obtain a lower bound on the number of distinct fields among for n ∈ . Fields of this type include the Shanks fields and their generalizations.
Let a,b,c be relatively prime positive integers such that a2+b2=c2 with b even. In 1956 Jeśmanowicz conjectured that the equation ax+by=cz has no solution other than (x,y,z)=(2,2,2) in positive integers. Most of the known results of this conjecture were proved under the assumption that 4 exactly divides b. The main results of this paper include the case where 8 divides b. One of our results treats the case where a has no prime factor congruent to 1 modulo 4, which can be regarded as a relevant analogue of results due to Deng and Cohen concerning the prime factors of b. Furthermore, we examine parities of the three variables x,y,z, and give new triples a,b,c such that the conjecture holds for the case where b is divisible by 8. In particular, to prove our results, we shall show an important result which asserts that if x,y,z are all even, then x/2,y/2,z/2 are all odd. Our methods are based on elementary congruence and several strong results on generalized Fermat equations given by Darmon and Merel.
We prove that for any positive integers x,d and k with gcd (x,d)=1 and 3<k<35, the product x(x+d)⋯(x+(k−1)d) cannot be a perfect power. This yields a considerable extension of previous results of Győry et al. and Bennett et al., which covered the cases where k≤11. We also establish more general theorems for the case where x can also be a negative integer and where the product yields an almost perfect power. As in the proofs of the earlier theorems, for fixed k we reduce the problem to systems of ternary equations. However, our results do not follow as a mere computational sharpening of the approach utilized previously; instead, they require the introduction of fundamentally new ideas. For k>11, a large number of new ternary equations arise, which we solve by combining the Frey curve and Galois representation approach with local and cyclotomic considerations. Furthermore, the number of systems of equations grows so rapidly with k that, in contrast with the previous proofs, it is practically impossible to handle the various cases in the usual manner. The main novelty of this paper lies in the development of an algorithm for our proofs, which enables us to use a computer. We apply an efficient, iterated combination of our procedure for solving the new ternary equations that arise with several sieves based on the ternary equations already solved. In this way, we are able to exclude the solvability of the enormous number of systems of equations under consideration. Our general algorithm seems to work for larger values of k as well, although there is, of course, a computational time constraint.
An integer may be represented by a quadratic form over each ring of p-adic integers and over the reals without being represented by this quadratic form over the integers. More generally, such failure of a local-global principle may occur for the representation of one integral quadratic form by another integral quadratic form. We show that many such examples may be accounted for by a Brauer–Manin obstruction for the existence of integral points on schemes defined over the integers. For several types of homogeneous spaces of linear algebraic groups, this obstruction is shown to be the only obstruction to the existence of integral points.
A problem posed in the early eighteenth century asks for right-angled triangles, each of whose sides exceeds double the area by a perfect square. We summarize known results and find such triangles with the smallest possible standard generators.