加载中…
Let be a quadratic form in four variables, let and let . We count integer solutions to with . One can compare this to the similar problem of counting solutions to without the congruence condition. It turns out that adding the congruence condition sometimes gives a very different main term than the homogeneous case. In particular, there are examples where the number of primitive solutions to the problem is , while the number of unrestricted solutions is nonzero.

生成讲解博客的中文版本

生成AI智能校验的中文版本