On the Diophantine Equation ∑ n i = 1 x i /d i ≡0 (mod 1)

DOI10.2307/2048476zbMath0721.11010OpenAlexW2027834895MaRDI QIDQ5752639

Daqing Wan, Qi Sun

Publication date: 1991

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2048476

zbMATH Keywords

congruencestotal number of solutionsbound for the least solution

Mathematics Subject Classification ID

Congruences in many variables (11D79) Linear Diophantine equations (11D04)

Related Items (6)

The number of rational points on a class of hypersurfaces in quadratic extensions of finite fields ⋮ Counting points on diagonal equations over Galois rings \(\mathrm{GR}(p^2,p^{2r})\) ⋮ On the equation \(x_1^{m_1}+\cdots + x_n^{m_n} = ax_1 \cdots x_n\) over a finite field ⋮ A reduction for counting the number of zeros of general diagonal equation over finite fields ⋮ Factorization formulae on counting zeros of diagonal equations over finite fields ⋮ The number of rational points of a family of hypersurfaces over finite fields

This page was built for publication: On the Diophantine Equation ∑ n i = 1 x i /d i ≡0 (mod 1)