WorksMathematics
Pointwise representation counts for Eisenstein restricted sums
Abstract
Let consist of the positive integers supported on primes , including . We count distinct ordered representations for and for , with . In either family prescribe an interval of length centered at for one actual summand. Put . For every fixed , if and , the count has order for every sufficiently large admissible . Here is the product of over the odd primes dividing . In particular, central windows of width are allowed for , and windows at a prescribed small summand of size comparable to their width are allowed for . The lower bound combines angular Hecke estimates with a sieve that prescribes small split factors in both summands.
The pointwise count
Let , where always denotes a prime. Write . We count ordered pairs of positive integers summing to , with
In the second line one orientation is prescribed in advance. For let count these pairs with . In particular, if the first summand is , it is that lies in the interval.
Theorem 1.1. Fix and put . Uniformly for every sufficiently large admissible and every real with
one has, in each of the prescribed families,
The constants in the two bounds and the threshold for depend only on .
The product has a direct interpretation. At , for example, the two conditions and forbid two residues when , and one when . The ratio of the allowed proportions is . The same calculation explains every factor of and yields an upper bound by an ordinary sieve on integers.
The lower bound begins with a larger family that can be counted spectrally. Write for the Eisenstein norm on , with . The equation is a quaternion norm equation. At an inert prime , forces . It is therefore possible to remove the large inert primes by a lattice count within the prescribed window. A separate issue is that many coordinate pairs can give the same two norm values. Sifting out small split primes bounds this multiplicity, with a baseline coordinate count of size before the target factors. To gain a factor of we allow small split primes to occur to exponent one in one summand, or in both summands when they divide the target. For instance, permits placing in either summand. If , its use as a common factor reduces the target to . The split-prime local factors for these two situations supply the same logarithmic gain. The prescribed factors can be read off the resulting values, and each pair then has bounded weighted coordinate multiplicity.
The angular estimate costs in the Hecke remainder. Multiplying by the square-root error from the norm shell gives . Comparing this with the main-term width explains . The proof below treats the finite level and the angular variable together, which lets us prescribe the mixed orientation at any center.
Proof overview. Section estimates the angularly weighted shell with finite congruence tests. Section handles primes dividing the target, with a worked example at . Section sums over the small split factors to recover the logarithm. Section removes the remaining inert primes, bounds the weight of each distinct pair, and gives the matching integer-sieve upper bound.
Relation to earlier work. Dietmann and Elsholtz [2] prove eventual binary existence for the Gaussian prime restriction and obtain pairs for every without restricting the summand sizes. Howe, Huffman, Kohlmeyer and Kruer [1 Theorem 1.1] prove existence for every positive target , using quaternionic norm counts and a sieve on the representing vectors. The prime sets used here and in the Gaussian problem are incomparable, as and show. We use the same norm-counting principle for the Eisenstein ring. The new estimates needed here are angular localization with prescribed residue conditions, the densities when a sieving prime divides the target, and a lower bound that counts distinct value pairs at the integer-sieve scale. Ramaré and Viswanadham [4 Introduction and Theorem 1.6] discuss the split-prime Eisenstein set in their sieve framework and prove a ternary additive theorem for primitive Gaussian values.
The Frobenian correlation theorem of Loughran and Matthiesen [9 Theorem 1.9] requires pairwise independent linear parts. Fixing the total gives the one-variable forms , with proportional linear parts. In the mixed case, restricting to the necessary residue class and dividing one form by leaves the same dependence. Freeing the total gives a two-variable sum, which averages over the slices that our theorem estimates individually.
Iwaniec’s half-dimensional sieve [10 Theorem 1] uses a half-dimensional local product and a remainder from counts in residue classes. Sieving both summands directly excludes two residues per inert prime away from the target divisors. As the inert primes have density , this gives sieve dimension one. A half-dimensional sieve on one summand with the other already restricted would require progression estimates for that restricted sequence in translated windows, uniformly in the target. Greaves [11 main theorem] obtains a bound of order at least for prime pairs whose complementary value is a sum of two squares. The cutoff in that Gaussian input leaves the split of the complementary sum of two squares free. Here the angular Hecke estimate supplies the window-dependent distribution, and the split-factor sum reaches the scale of distinct values.
Corollary 1.2. The count in every fixed interval of positive length for inside is of order . In particular the unrestricted count has this order. At any fixed interior share, windows of width have count of order for . For and fixed , the same count holds with .
The results give two-sided order bounds. A leading constant and a numerical onset are open here, as are the central and small-summand endpoint exponents and .
An angular estimate on a quaternion shell
Fix , , as in Theorem 1.1. We first count coordinate representations with an angular weight and prescribed local conditions.
The norm shell
Let and . The Eisenstein lattice is norm Euclidean, since every complex number is within squared distance of a lattice point. Write , where and , and put . Its reduced norm is . The trace pairing on has determinant , so the order has reduced discriminant . The algebra is definite and the number of ramified places is even, so it is ramified at and infinity. Thus is maximal.
Rounding both complex coordinates gives a remainder of reduced norm at most . In any nonzero integral right ideal, take a least positive norm element and divide on the left by . The remainder in that ideal has norm smaller than unless it vanishes. Every right ideal is therefore principal, as are the fractional ideals by scaling. The unit group consists of the twelve elements of . For , let . At each , integral right ideals correspond locally to index- sublattices of , of which there are . Each ideal has twelve generators of norm , giving
We use this all-ideal convention throughout [3 Propositions 41.3.1 and 41.3.6]. The number of coordinates of a positive norm is , where is multiplicative. Its local values are at split primes , at , and at inert primes . Indeed a split prime has two conjugate factors in , and a choice of their exponents gives each possibility up to a unit. The ramified prime in above is generated by and has norm . In particular, , where is the divisor function. At an inert prime, is a field, so norm divisibility by is equivalent to coordinate divisibility by . For even , both component norms have the same parity. Both are even precisely on the shell scaled by from . The odd-component shell therefore has size
where if .
Finite tests and the Hecke bound
Use the finite group obtained by multiplying the fixed factor and any factors at , with or . The Hecke index in this subsection is coprime to the level. Write for the image of in . The kernel on is , as is seen at . Each group has a norm squareclass map, using determinant at split quaternion places. Both squareclasses occur. At , for example, the norms of and give the two classes. They are detected modulo at every odd level prime.
For , let denote the unitary representation of on that space. For a real quaternion of nonzero norm use , under the usual identification of unit quaternions with . The action on order units descends to . Use the space of functions satisfying , with squared norm summed once per left coset. The all-ideal Hecke operator is
where is projective reduction in . Let be the product of the projective order-unit groups at the finite places, and the kernel of reduction to . At we use order units, with reduction modulo . A residue unit lifts to an order unit since its reduced norm is a -adic unit. At each in the level, the corresponding reduction of is surjective modulo . Thus .
Class number one gives , where denotes the finite adeles. A rational element stabilizing has a representative locally equal to a scalar times an order unit. A single rational scalar cancels the valuations of the local scalars, giving an element of . Consequently the finite adelic quotient is . The projective rational stabilizer at any level coset is trivial. Indeed, is normal in and only the units lie in the kernel of reduction. With coefficients, rational left equivariance gives the stated action of [8 Section 2, (4)–(6) and Proposition 2.5]. Each orbit has elements and hence the same finite measure. At infinity Schur orthogonality for a unit test vector gives the factor . The resulting automorphic norm differs from the counting norm by a common scalar.
To see the direction and normalization in (4), lift to supported at level primes. A right-ideal representative in the correspondence of norm can be chosen supported at primes of , so . If the ideal is , write with projectively. At level primes reduces to . Hence the summand is . Changing by a right order unit cancels by equivariance. Averaging over all twelve generators implements the sum once per ideal. Replacing by gives (4). Conjugation also proves self-adjointness.
We use the bound
on the whole space for , and on the complement of the joint norm-squareclass characters for . Here are the relevant hypotheses for cuspidal transfer. A finite-dimensional smooth irreducible local factor at a split place is trivial on the norm-one group, since its open normal kernel contains the elementary unipotents by diagonal conjugation. Such a factor cannot occur at positive weight. In fact has dense real image in . Equation (2) gives infinitely many norm-one elements of exact denominator by taking and omitting . There are at most single-component points of that norm, so these elements extend outside the Eisenstein torus normalizer. A proper infinite closed subgroup of normalizes its one-dimensional identity component. It contains the order-three unit , which must then lie in that torus and determines it as the Eisenstein torus. This contradicts the points outside its normalizer. For a finite adelic representative , impose the congruences belonging to the level away from . They cut out a finite-index subgroup of , still dense by connectedness. At the discrepancy is absorbed by invariance under the local norm-one group. Rational left invariance then forces the coefficient at to be fixed by that dense subgroup, which is impossible in the nontrivial irreducible representation.
For , suppose the factor at is finite-dimensional and let be a finite adelic norm-one element. Strong approximation for away from lets us choose a rational norm-one element approximating outside [3, Main Theorem 28.5.3]. In , the final factor can be taken in the right stabilizer of the vector away from . At it has norm one and acts trivially. Thus the exceptional constituents are invariant under the entire finite adelic norm-one group. On they depend only on the joint norm squareclasses in . Indeed, at the odd level primes a square norm can be scaled to one, and outside the level the order units already act trivially. Conversely, each product of local signs comes from a quadratic Dirichlet character composed with reduced norm. This is projectively well-defined since scalar norms are squares, and it has trivial real type since real reduced norms are positive. By (4) its eigenvalue is times its value on the norm class of . These sign functions span the scalar exceptional space.
The remaining constituents have infinite-dimensional factors at split places. Jacquet–Langlands gives cuspidal representations of holomorphic weight and trivial central character, unramified at every [5 Theorem 14.4 and Proposition 5.20]. Let be their unitary Satake parameters. Their product is one. The classical Hecke roots are , so Deligne’s bound gives [6 Theorems 4.9 and 5.1] [7 Theorem 1.6].
For the operator at the all-ideal right cosets are represented by upper triangular matrices with diagonal and upper right entry modulo , for . In normalized unramified induction [5 Section 3], the spherical vector has value there. Summing the choices of the upper right entry gives the eigenvalue
This includes imprimitive ideals and equals the classical coefficient at divided by . In particular, the recurrence is for . The eigenvalue has modulus at most . Multiplicativity now gives (5) with the same bound at every weight and level.
A finite test with a prescribed direction
For a test and a unit vector in degree , define
This is the orthogonal projection of onto equivariant functions in the full counting norm on . Its coset norm is at most . For another unit vector , reindexing the shell by the left unit lift of each gives
Here the inner product is linear in its second variable. The averaging factor cancels because for a lift the substitution cancels against the archimedean multiplier. This formula allows to distinguish the two components.
Writing , put . For the unit vector proportional to , the matrix coefficient in (6) equals , where is the degree- Legendre polynomial with . Indeed, the polynomial action gives the binomial formula
Passing to leaves the coefficient unchanged.
In degree zero, projecting onto the sign characters replaces by its average conditioned on the joint norm squareclasses of . Indeed these characters form an orthogonal basis for functions of the squareclasses, and the eigenvalue signs evaluate them at . The averaging defining preserves these means. For a product of local tests the conditional mean is the product of their conditional means. At each positive degree, evaluation at one coset has norm at most one, so (6) is bounded in absolute value by . The same error bound applies to the scalar cuspidal part.
The cost of a translated window
Choose a fixed smooth of compact support in and integral . Put , , and . We use the bump
As , on its support , and the support has length at most . The constant Legendre coefficient of is .
Lemma 2.1. The Legendre expansion converges uniformly and absolutely, with .
Proof. We use for . For a short proof, let on . The Legendre equation gives with . The derivative of is up to . At this energy is , by , and . Reflection gives the bound on both halves.
Write . In the rescaled coordinate , the operator is times a differential operator of order two with coefficients and derivatives bounded on the support of . Indeed its two coefficients in that scale are and . Integrating by parts twice using , and also using the direct integral, gives
The factor includes the coefficient normalization . Summing below and above gives . Since on , the series converges uniformly. Its Legendre coefficients identify the sum with by polynomial density.
Combining this lemma with (6), a finite product test of modulus at most one has weighted shell count
The same is used when the target is divided by a common factor. Both component norms scale together and is unchanged.
Local densities at all target valuations
On a shell at , put and . The bump restricts both norms to be positive. At a variable prime write for the density of the bad test . For this is the conditional mean in (7). At we derive its analogue by reducing to coprime Hecke indices.
Coprime target and level
At the ordinary family requires no test, since forces both norms to be units modulo . In the mixed family , and we require the prescribed component to have -adic valuation exactly one. Among the nine elements of there are six units, two nonzero nonunits, and zero. The nonzero nonunits have norm valuation one, since has norm and its square is associated to . Norm one modulo requires one unit and one nonunit, giving raw quaternion residues. Exactly have a unit in one prescribed component and a nonzero nonunit in the other. Passing to projective classes preserves the ratio, so either mixed orientation has mean .
At an inert , by anisotropy a bad point has one component zero modulo . Its image in lies in the normalizer of the nonsplit torus . This is the union of that torus and its translate by , with elements out of . The norms of the torus elements cover the squareclasses equally, so in either class.
At a split , the two factors of the Eisenstein subalgebra occupy the diagonal of . The other Eisenstein component occupies the off-diagonal. Their norms are the products of the respective entries, up to sign. For a fixed nonzero determinant, the first row is uniform on nonzero rows, each with completions. Thus a given entry is zero with probability . Two zero entries are possible only when they form an opposite pair. For either such pair there are matrices of the given determinant, giving probability . Inclusion-exclusion gives
For the exact condition at either one prescribed component, exactly one of its two entries is zero modulo , and this entry must be nonzero modulo . All matrix lifts of an invertible residue are invertible, and determinant squareclasses are determined modulo . The conditional probability of the last lift condition is . Therefore the mean of at level is
These means hold on projective groups as well, since all tests are unchanged by a unit scalar.
Primes dividing the target
For inert , divisibility of one norm by forces the other to be divisible by as well, so both components are in . The bad set is empty if . Otherwise it is obtained by multiplying both coordinates by from the shell at . This preserves and the other prime tests. Hence for the scalar density is
Now let be split in , and fix prime to . At target , let be the weighted count with no restriction at , and the count with both norms units at . Carry along and the other prime tests. At target , let count with the additional test
It has mean by the single-entry calculation. If one norm has valuation , the allocations of its two prime factors are equally frequent. The average of the test at that pair of norms is . The conditions at other primes are unchanged on reallocating these factors. Indeed, dividing out or inserting factors above acts by units at every other prime, preserving all the norm valuations and the individual split-prime divisibilities used in the tests.
Classify a pair of norms on the shell by the minimum of its two -adic valuations. If , both valuations are ; removing from each norm gives a pair with allocation multiplier . If , the residual target is . When both residual norms are units the multiplier is ; if one has valuation , the ratio of allocation counts is . In either reduction the normalized norm coordinate stays fixed. This proves
The generating series for is , and that for is . Thus
The coefficients of have absolute value at most eight, and those of at most two. The bad count is therefore a combination of unrestricted counts at lower -exponents and the count at the unit target, with coefficient absolute sum at most . Applying the same identity to the scalar prediction from (7) uses , , and after factoring out the other local factors. Substitution gives for those scalar values. In particular
Example at a split square. Take with . The first two cases of (11) give
The term at is unrestricted at , and the only remaining -level test is at . For the main term, factor out the other primes and insert , , , . The resulting main term for is , giving . Including the shell factor gives . This is , since at a unit target. In the cofactor sum of § 4.2 this gives weight without a common factor , and with that common factor, since the residual target still has positive valuation at . In general (12) gives at every positive valuation.
The joint estimate
Fix squarefree coprime , made of split primes coprime to . Place the condition at and at . Give each coordinate pair weight . Here and below is even and prime to . Keep the odd-component condition and the prescribed condition at . For any squarefree coprime to , let be the weighted count additionally bad at every prime dividing , and put
Extend multiplicatively on squarefree products.
Lemma 3.1. For as above and any fixed ,
Proof. First omit oddness. If the level is coprime to , apply (7). A factor at has size and a factor at has size less than . Thus the norm cost is , the fixed factor at being bounded.
For , eliminate the test by inert scaling or (11). Each time, the remaining test at the eliminated prime is present only at a reduced target coprime to it. The allocation calculation works with any of the other tests still imposed. In particular the test at a split prime produced by an earlier elimination is an average of individual divisibilities, all invariant under changes of allocation at another prime. The coprime conditional means are independent of the nonzero determinant class at those other primes. Extracting split powers and inert squares does not change the target class modulo , and the prescribed orientation is preserved. Hence the scalar terms factor, with local factors (10) and (12). The total coefficient variation in the elimination is at most , because . Each resulting target divides , and the remaining level divides the original level. The product of these losses with the divisor factor in (7) is absorbed by .
Finally subtract the shell at if it exists. Rescaling its coordinates by preserves the normalized angle, the odd-prime tests and the orientation at . The valuations at all odd primes agree with those for , so the scalar is replaced by . This gives (13). ∎
The lower sieve and the split factors
Fix with . We use a divisor level and prime bounds and , with chosen below. Consider triples of pairwise coprime squarefree integers , supported on split primes at most , satisfying
On the shell use the prescriptions of Lemma 3.1 at , and require at every other prime , including the primes of . Since , the target belongs to the same family. The weight on the shell is , so after rescaling the norm values by the original window is enforced.
Finite inclusion-exclusion
We give the sieve weights together with the level they require. Partition the sieving primes into blocks for . For the main-term probabilities , the sum in each block is bounded by an absolute and is bounded below by an absolute . In fact the formulas in Section 3 lie uniformly below one and are . Prime harmonic Mertens gives a bounded sum of in each block. Omitting primes, including the primes of , preserves these bounds. We also use the progression version of Mertens modulo 3, for ; see [9 Lemma 2.4].
In block truncate inclusion-exclusion at consecutive orders and , where is a fixed large integer. Denote the resulting polynomials in the bad-prime indicators by . Bonferroni gives and , where indicates avoidance in the block. Telescoping gives the lower polynomial
Under independent bad events with probabilities ,
Choose so that the sum over of is at most . The expectation of the lower polynomial is at least . Also , so the expectation of the upper polynomial is . We will use this upper estimate later with integer-sieve probabilities.
Put and . Every divisor in either polynomial is at most . The upper coefficients have absolute value at most one, and the lower coefficients at most one plus the number of nonempty blocks, which is . Apply (13) to the lower polynomial with the nonnegative shell weights. For each triple the main contribution is at least
Here accounts for replacing the ordinary sieve factor at a prime of by the exact-valuation factor. Summing the remainders over all divisors uses . There are at most triples because a fixed product has at most decompositions. The total absolute remainder, for any , is
The equality uses and the strict choice of , with small enough. All of these estimates are uniform in .
The logarithm gained from small factors
The target-independent product
satisfies , since and the inert factors have a convergent positive product. To compare this with , include the shell factor from (3). For split and ,
For inert and the combined factor is , by (10), including . The inert primes dividing and are the same. For the inert primes dividing beyond , the shell factor is at least , and the product of the extra factors is bounded below. All split enhancements are at least one. Using , we get
Temporarily drop the product bound in (14). The sum of the cofactor weights in (16) and (17) factors over split . For the three options of absence, inclusion in , or inclusion in have weights , , . If , the two options of absence or inclusion in have weights , , where for and for . The compensation at target divisors is the identity
Thus the full cofactor sum is at least , since . Normalize the local weights to independent probabilities. At the probability of is , and at it is at most . Hence , uniformly in , by . Take . Markov’s inequality then retains at least half the weight on . Inserting (17) into (16) and subtracting the aggregate remainder proves that the total retained weight is
From coordinates to distinct pairs
For each fix of norm , obtained by multiplying one factor above each split prime of . Embed the residual shell at in the original shell by . This preserves the fractional norm coordinate, the prescribed orientation at , and inert divisibility above .
Each original value pair recovers its triple . At split primes up to , the only possible positive valuation is one, occurring in both norms at the primes of , only in the first at , and only in the second at . The images for distinct triples are consequently disjoint. This makes it possible to bound the remaining losses on the original shell without summing an error over the triples.
Large inert primes
If an inert prime divides the first component norm, that component is . The norm of belongs to . For the other component use in place of . Each resulting annulus has squared-radius width and outer radius at most . Covering each lattice point by a translated fundamental cell, of fixed area and bounded radius, gives possible . Indeed the cells lie in the annulus obtained by moving the two boundaries by a fixed distance, truncating the inner radius at zero. The complementary positive norm has at most coordinate choices.
Since all weights are at most one, summing on the original shell over the two components and bounds the lost weight by
Here is a fixed power of , and the hypothesis with gives . Thus (18) persists after removing every inert prime. Oddness and the condition at 3 now give the required norm values.
The weight of one value pair
On the residual shell write and . All split prime factors of exceed . Each of these two numbers has at most split factors counted with multiplicity, and the possible single factor 3 has no effect on coordinate multiplicity. The split primes in occur to valuation one. By the multiplicity formula in § 2, the weighted coordinate multiplicity, after division by , is at most
Each original pair determines its triple and residual pair. Dividing the surviving weight by this constant proves the lower bound of Theorem 1.1.
The upper bound on integers
For the upper bound, write in the interval of length . At every inert we must exclude the residues . Let be their number, namely one if and two otherwise, and extend multiplicatively to squarefree products of these primes. The Chinese remainder theorem and the count in a residue class give integers in all the excluded sets for , uniformly in the interval location and endpoint convention.
Use the upper polynomials of § 4 with probabilities , sieving to for a sufficiently small fixed . The block probability bounds hold as before. Choose so that the corresponding divisor level is . The total error is , since and . The upper main term is at most a constant times times
This proves the upper bound and completes Theorem 1.1. The argument for this upper bound in fact works in any interval whose length is at least a fixed positive multiple of .
Proof of Corollary 1.2. In a fixed interval of shares, take a smaller fixed interval of length at most the distance of its center from the nearest endpoint of . This satisfies the hypotheses with for large , giving the lower bound. Use the upper sieve on the full interval and on for the unrestricted count. At with , a width satisfies the condition for any fixed . Finally, inside take a subinterval of width comparable to and at most its midpoint. Its distance to the nearer endpoint of is comparable to , so one can use . The upper sieve on the full interval gives the matching bound, also for .
AI assistance and review. ChatGPT (OpenAI) assisted with mathematical arguments, literature checks, exposition, proof review and verification code.
References
- [1]W. Howe, G. Huffman, J. Kohlmeyer, and L. Kruer, Euler’s 1747 conjecture on sums of integers with restricted prime factors, Hexagon 2611.00370v1, 12 November 2026. https://hexagonomath.org/2611.00370v1.hub.valency.io/works/W_p3mybhqd
- [2]R. Dietmann and C. Elsholtz, Sums of two numbers having only prime factors congruent to one modulo four, Banach Center Publ. 118 (2019), 177–179. https://doi.org/10.4064/bc118-11.
- [3]J. Voight, Quaternion Algebras, Graduate Texts in Mathematics 288, Springer, 2021, Chapters 28 and 41. https://doi.org/10.1007/978-3-030-56694-4.
- [4]O. Ramaré and G. K. Viswanadham, The trigonometric polynomial on sums of two squares, an additive problem and generalisation, arXiv:2509.23260v1, 2025. https://arxiv.org/abs/2509.23260v1.
- [5]H. Jacquet and R. P. Langlands, Automorphic Forms on GL(2), Lecture Notes in Mathematics 114, Springer, 1970, Theorem 14.4 and Section 5. https://publications.ias.edu/sites/default/files/automorphic-forms-on-gl2_rpl_9.pdf.
- [6]P. Deligne, Formes modulaires et représentations ℓ-adiques, Séminaire Bourbaki, exposé 355 (1968/69), published 1971, 139–172. https://www.numdam.org/item/SB_1968-1969__11__139_0.pdf.
- [7]P. Deligne, La conjecture de Weil. I, Publications Mathématiques de l’IHÉS 43 (1974), 273–307. https://www.numdam.org/item/PMIHES_1974__43__273_0.pdf.DOI
- [8]M. Greenberg and J. Voight, Lattice methods for algebraic modular forms on classical groups, in Computations with Modular Forms, Contrib. Math. Comput. Sci. 6, Springer, 2014, 147–179. https://jvoight.github.io/articles/orthohecke-240123.pdf.arxiv.org/abs/1209.2460
- [9]D. Loughran and L. Matthiesen, Frobenian multiplicative functions and rational points in fibrations, J. Eur. Math. Soc. 26 (2024), 4779–4830. https://doi.org/10.4171/jems/1374.
- [10]H. Iwaniec, The half dimensional sieve, Acta Arith. 29 (1976), 69–95. https://doi.org/10.4064/aa-29-1-69-95.
- [11]G. Greaves, On the representation of a number in the form x² + y² + p² + q² where p, q are odd primes, Acta Arith. 29 (1976), 257–274. https://doi.org/10.4064/aa-29-3-257-274.