Statically Checking Conventionality of Array Objects in JavaScript

For h ge 2 and an infinite set of positive integers A, let R_{A,h}(n) denote the number of representations of the positive integer n as the sum of h distinct terms from A. A set of positive integers A is called a B_h[g] set if every positive integer can be written as the sum of h not necessarily distinct terms from A at most g different ways. We say a set A is a basis of order h if every positive integer can be represented as the sum of h terms from A. Recently, Vu [17] proved the existence of a thin basis of order h formed by perfect powers. In this paper, we study weak B_{h}[g] sets formed by perfect powers. In particular, we prove the existence of a set A formed by perfect powers with almost possible maximal density such that R_{A,h}(n) is bounded by using probabilistic methods.

Representations of integers by linear forms in nonnegative integers

By the problem, called a representation of the integers, is meant the encoding of the positive integers without a known upper bound, for which unique decoding can be provided. From the viewpoint of information theory, this problem has been discussed theoretically in its relation to the universality, asymptotic optimality, and computation theory. The result in those approaches has been applied to the data compression scheme for the type of data referring to the past as well as the URR and other floating-pointnumber representations with variable exponential length. This paper discusses representation of the integers problem from the viewpoint of the codeword-length function, which is the function to represent the length of the codeword. As a result, a general construction method is presented which has the desirable property and can uniquely encode all representations. Several methods are given from this approach, which can construct not only the traditional representations of the integers but also the first representations of the integers which has not been considered. It is noted first that two construction methods of codeword length, which are independent of the encoding, are considered. One is based on the combination of the codeword-length functions, and the other is based on the codeword-length distribution. More precisely, it is shown that not only are the traditional representations derived, but also the representations that have not been considered in the past. Using detailed examples, it is shown that the computational complexity of the encoding and decoding depends on the codeword-length function.

It is clear that, for k ≥ 4, every nonnegative integer is representable as a sum of k squares. Indeed, one can always write \( n = \sum\nolimits_{{i = 1}}^4 {x_i^2} + {0^2} + \cdot \cdot \cdot + {0^2} \), with an arbitrary number of zeros. On the other hand, the number of representations r k (n) increases very rapidly with n (see Chapter 12), and besides the representations with k — 4 zeros, one usually finds others with fewer zeros or none at all. For example, if k = 5, then 5 = 22 + 12 + 02 + 02 + 02 = 12 + 12 + 12 + 12 + 12.

Motivated by the Elementary Problem B-416 in the Fibonacci Quarterly, we show that, given any integers n and r with n≥2, every positive integer can be expressed as a sum of Fibonacci numbers whose indices are distinct integers not congruent to r modulo n. Similar expressions are also dealt with for the case of Lucas numbers. Symmetric and anti-symmetric properties of Fibonacci and Lucas numbers are used in the proofs.

Positive definite binary hermitian forms with finitely many exceptions

In the paper entitled ‘Asymptotic formula in a generalized Waring's problem’, I established an asymptotic formula for the number of representations of a large natural number N in the formwhere x1, x2, …, x7 and k are natural numbers with k ≥ 4 (see (2) Theorem 2).

This is the first part of a two-part paper. Our paper was motivated by two classical papers: A paper of Sir Charles Wheatstone published in 1844 on representing certain powers of an integer as sums of arithmetic progressions and a paper of J. J. Sylvester published in 1882 for determining the number of ways a positive integer can be represented as the sum of a sequence of consecutive integers. There have been many attempts to extend Sylvester Theorem to the number of representations for an integer as the sums of different types of sequences, including sums of certain arithmetic progressions. In this part of the paper, we will make yet one more extension: We will describe a procedure for computing the number of ways a positive integer can be represented as the sums of all possible arithmetic progressions, together with an example to illustrate how this procedure can be carried out. In the process of doing this, we will also give an extension of Wheatstone’s work. In the second part of the paper, we will continue on the problems initiated by Wheatstone by studying certain relationships among the representations for different powers of an integer as sums of arithmetic progressions.

In this paper, we consider representations of positive integers as sums of generalized m-gonal numbers, which extend the formula for the number of dots needed to make up a regular m-gon. We mainly restrict to the case where the sums contain at most four distinct generalized m-gonal numbers, with the second m-gonal number repeated twice, the third repeated four times, and the last is repeated eight times. For a number of small choices of m, Sun conjectured that every positive integer may be written in this form. By obtaining explicit quantitative bounds for Fourier coefficients related to theta functions which encode the number of such representations, we verify that Sun’s conjecture is true for sufficiently large positive integers. Since there are only finitely many choices of m appearing in Sun’s conjecture, this reduces Sun’s conjecture to a verification of finitely many cases. Moreover, the bound beyond which we prove that Sun’s conjecture holds is explicit.

It is known that every positive integer n can be represented as a finite sum of the form $n={\textstyle\sum} a_i 2^{i}$, where $a_i\in \{0,1,-1\}$ for all i, and no two consecutive ai's are nonzero. Such sums are called nonadjacent representations. Nonadjacent representations are useful in efficiently implementing elliptic curve arithmetic for cryptographic applications. In this paper, we investigate if other digit sets of the form {0,1,x}, where x is an integer, provide each positive integer with a nonadjacent representation. If a digit set has this property, we call it a nonadjacent digit set (NADS). We present an algorithm to determine if {0,1,x} is an NADS and, if it is, we present an algorithm to efficiently determine the nonadjacent representation of any positive integer. We also present some necessary and sufficient conditions for {0,1,x} to be an NADS. These conditions are used to exhibit infinite families of integers x such that {0,1,x} is an NADS, as well as infinite families of x such that {0,1,x} is not an NADS.

It is well known that the number Ak(m) of representations of a positive integer m as the sum of k squares of integers can be expressed in the formwhere Pk(m) is a divisor function, and Rk(m) is a remainder term of smaller order. (1) is a consequence of the fact thatis a modular form for a certain congruence subgroup of the modular group, andwithwhere Ek(z) is an Eisenstein series and is a cusp form (as was first pointed out by Mordell [9]). The result (1) remains true if m is taken to be a totally positive integer from a totally real number field K and Ak(m) is the number of representations of m as the sum of k squares of integers from K (at least for 2|k, k>2, and for those cases with 2+k which have been investigated). then are replaced by modular forms for a subgroup of the Hilbert modular group with Fourier expansions of the form (10) (see section 2).

The generating functions of divisor functions are quasimodular forms of weight 2 and the product of them is a quasimodular form of higher weight. In this work, we evaluate the convolution sums [Formula: see text] for the positive integers [Formula: see text], and [Formula: see text] with lcm[Formula: see text]. We reprove the known formulas for the number of representations of a positive integer [Formula: see text] by each of the quadratic forms [Formula: see text] as an application of the new identities proved in this paper.

Lagrange's equation with one prime and three almost-primes

We use recurrence equations (alias difference equations) to enumerate the number of formula representations of positive integers using only addition and multiplication, and using addition, multiplication and exponentiation, where all the inputs are ones. We also describe efficient algorithms for the random generation of such representations, and use dynamical programming to find a shortest possible formula representing any given positive integer.

The theory of quasimodular forms is used to evaluate the convolution sums [Formula: see text] for all positive integers n. As a consequence, the number of representations of a positive integer n by the octonary quadratic form [Formula: see text] is determined.