Fast computation of the number of solutions to x12+⋯+xk2≡λ(modn)x_1^2+\cdots+x_k^2 \equiv λ\pmod{n}

preprint2016arXivOpen access

Abstract

In this paper we study the multiplicative function ρk,λ(n)ρ_{k,λ}(n) that counts the number of incongruent solutions of the equation x12+⋯+xk2≡λ(modn)x_1^2+\cdots+x_k^2 \equiv λ\pmod{n}. In particular we give closed explicit formulas for ρk,λ(ps)ρ_{k,λ}(p^s) with a arithmetic complexity of constant order.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.