Computation of powers of multivariate polynomialsover the integers
โ Scribed by Lee E. Heindel
- Publisher
- Elsevier Science
- Year
- 1972
- Tongue
- English
- Weight
- 328 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0022-0000
No coin nor oath required. For personal study only.
โฆ Synopsis
Theoretical computing time analyses of both the iterative multiplication and binary expansion algorithms for computing pn for P E I [xt ,..., xr] show the iterative multiplication algorithm to be more efficient as r, the number of variables, increases.
๐ SIMILAR VOLUMES
For each positive integer j , let ฮฒ j (n) := p|n p j . Given a fixed positive integer k, we show that there are infinitely many positive integers n having at least two distinct prime factors and such that ฮฒ j (n) | n for each j โ {1, 2, . . . , k}.
Formulas arc obtained for the determinants of certain matrices whose entries are zero and either binomial coefficients or their negatives. A consequence is that. for all integers II ?: 2 and k ;~2, there exists an (II -I)(k -I) x (n -I)(k -1) matrix M(n, k) whose entries arc the alternating binomial
In the Frobenius problem with two variables, one is given two positive integers a and b that are relative prime, and is concerned with the set of positive numbers NR that have no representation by the linear form ax + by in nonnegative integers x and y. We give a complete characterization of the set
As an extension of the Linnik Gallagher results on the ``almost Goldbach'' problem, we prove that every large even integer is a sum of four squares of primes and 8330 powers of 2.