Fast computation of the number of solutions to x₁^2 + + x_k^2 n
From MaRDI portal
Publication:669241
Recommendations
- scientific article; zbMATH DE number 700544
- The Number of Solutions of a Certain Quadratic Congruence Related to the Class Number of ℚ(√p
- Counting solutions of quadratic congruences in several variables revisited
- scientific article; zbMATH DE number 123855
- scientific article; zbMATH DE number 883122
Cites work
- scientific article; zbMATH DE number 1131801 (Why is no real title available?)
- An O(M(n) logn) Algorithm for the Jacobi Symbol
- Counting invertible sums of squares modulo \(n\) and a new generalization of Euler's totient function
- Counting solutions of quadratic congruences in several variables revisited
- Counting the solutions of \(\lambda_1 x_1^{k_1} + \dots + \lambda_t x_t^{k_t} \equiv c \bmod n\)
- Fast multiplication of large numbers
- Faster integer multiplication
- On divisors of a quadratic form
Cited in
(4)
This page was built for publication: Fast computation of the number of solutions to \(x_1^2 + \cdots + x_k^2 \equiv \lambda \pmod{n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669241)