It is a well known result that the number of integer solutions $(x,y), x>0, y\ge 0$ to $x^2+y^2 = n$ is $\sum_{d|n}\chi(d)$, where $\chi$ is the nontrivial Dirichlet character modulo $4$ such that $\chi(d)=1$ if $d\equiv 1\pmod{4}$, $\chi(d)=-1$ if $d\equiv 3\pmod{4}$, and $\chi(2k)=0$. My question: Can we extend this to the integers of other imaginary […]

I need to describe all numbers of the form $x^2 + 2y^2$. So far I’ve reduced the problem to primes, and showed p=2 satisfies it. I’ve also shown that any primes mod 5 or 7 can’t be a written in this form. How do I proceed to show that it holds for all primes mod […]

I’m writing a code in C that returns the number of times a non negative integer can be expressed as sums of perfect squares of two non negative integers. R(n) is the number of couples (x,y) such that x² + y² = n where x, y, n are all non negative integers. How can I […]

Intereting Posts

Is it true that the Fibonacci sequence has the remainders when divided by 3 repeating?
the concept of Mathematical Induction
Is the square root of a triangular matrix necessarily triangular?
Nice way of thinking about the Laplace operator… but what's the proof?
Why are Noetherian Rings important?
What is the 90th derivative of $\cos(x^5)$ where x = 0?
Definition of the total derivative.
A question on semifinite measures
Find all integer solutions: $x^4+x^3+x^2+x=y^2$
Is complex analysis more “real” than real analysis?
What's 4 times more likely than 80%?
Given n ranging from 1 to 100, find sum of digits equal to half of arithmetic sum of 1 to 100
Holder's inequality $ \sum_{i=1}^n |u_i v_i| \leq (\sum_{i=1}^n |u_i|^p )^{\frac{1}{p}}(\sum_{i=1}^n |v_i|^q )^\frac{1}{q} $
Deciding whether two metrics are topologically equivalent in the space $C^1()$
Identity for convolution of central binomial coefficients: $\sum\limits_{k=0}^n \binom{2k}{k}\binom{2(n-k)}{n-k}=2^{2n}$