Equal Sums of Two kth Powers
โ Scribed by T.D. Browning
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 237 KB
- Volume
- 96
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
โฆ Synopsis
Let k55 be an integer, and let x51 be an arbitrary real number. We derive a bound
for the number of positive integers less than or equal to x which can be represented as a sum of two non-negative coprime kth powers, in essentially more than one way.
๐ SIMILAR VOLUMES
Let k 2 be a fixed integer. For positive integers M N, let S k (M, N) denote the set of all sets A/[0, M] such that, for all positive integers n N, n can be written as n=a+b k with a # A and b a positive integer. Define Given =>0, we prove that there exists a $>0 such that for all sufficiently larg
In this paper we give a new method for constructing sets of integers having equal th power sums. Using the method, some new results are derived concerning the Tarry-Escott Problem. i' 1995 Academic Press. Inc.
We give an explicit p-adic expansion of np j=1, ( j, p)=1 j &r as a power series in n. The coefficients are values of p-adic L-functions. 1998 Academic Press Several authors (see [2, pp. 95 103]) have studied the sums : np j=1 ( j, p)=1 k=1 \ &r k + L p (r+k, | 1&k&r )( pn) k