The largest possible number of representations of an integer in the k-fold sumset kA=A+ } } } +A is maximal for A being an arithmetic progression. More generally, consider the number of solutions of the linear equation where c i {0 and \* are fixed integer coefficients, and where the variables a i
Invariance theorems for the behavior in the limit of the number of solutions of a system of random linear equations over a finite ring
โ Scribed by A. A. Levitskaya
- Publisher
- Springer US
- Year
- 1978
- Tongue
- English
- Weight
- 186 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we give a reduction theorem for the number of solutions of any diagonal equation over a finite field. Using this reduction theorem and the theory of quadratic equations over a finite field, we also get an explicit formula for the number of solutions of a diagonal equation over a finit
We count the number of solutions with height less than or equal to \(B\) to a system of linear equations over a number field. We give explicit asymptotic estimates for the number of such solutions as \(B\) goes to infinity, where the constants involved depend on the classical invariants of the numbe