Add to ORKGFor positive Integers 11 and k, we * let ~ ( n) denote the number of representations of rt as the sum of k squares. I n 1987 Ewell used modular functions to give a formula for q6(n). In 1996 Milne used elliptic functions to glve a different formula for q6(n). In this paper, we Dve elementary arithmehc proofs of both of these formulae. 1
AbstractLet rs(n) denote the number of representations of n as the sum of s squares of integers. In ...
We investigate the number of representations of an integer as the sum of various powers. In particul...
We investigate the number of representations of an integer as the sum of various powers. In particul...
Let k and n be positive integers. Let sk(n) denote the number of representations of n as the sum of ...
Let k and n be positive integers. Let sk(n) denote the number of representations ofn as the sum of k...
We give a new proof of Milne\u27s formulas for the number of representations of an integer as a sum ...
We give a new proof of Milne's formulas for the number of representations of an integer as a sum of ...
AbstractWe give a variety of results involving s(n), the number of representation of n as a sum of t...
of all integers, and Q the set of all rational numbers. For n 2 N [ f0g and k 2 N we let rk(n) denot...
Let rk(n) denote the number of representations of n as a sum of k squares and tk(n) the number of re...
Let rk(n) and tk(n) denote the number of representations of n as a sum of k squares, and as a sum of...
If s is a positive integer, then let r(s;n) denote the number of representations of a non-negative i...
Knowledge about number theory and representations of numbersLagrange proved that every positive inte...
Knowledge about number theory and representations of numbersLagrange proved that every positive inte...
Let r(k) (n) denote the number of representations of the positive integer n as the sum of k squares....
AbstractLet rs(n) denote the number of representations of n as the sum of s squares of integers. In ...
We investigate the number of representations of an integer as the sum of various powers. In particul...
We investigate the number of representations of an integer as the sum of various powers. In particul...
Let k and n be positive integers. Let sk(n) denote the number of representations of n as the sum of ...
Let k and n be positive integers. Let sk(n) denote the number of representations ofn as the sum of k...
We give a new proof of Milne\u27s formulas for the number of representations of an integer as a sum ...
We give a new proof of Milne's formulas for the number of representations of an integer as a sum of ...
AbstractWe give a variety of results involving s(n), the number of representation of n as a sum of t...
of all integers, and Q the set of all rational numbers. For n 2 N [ f0g and k 2 N we let rk(n) denot...
Let rk(n) denote the number of representations of n as a sum of k squares and tk(n) the number of re...
Let rk(n) and tk(n) denote the number of representations of n as a sum of k squares, and as a sum of...
If s is a positive integer, then let r(s;n) denote the number of representations of a non-negative i...
Knowledge about number theory and representations of numbersLagrange proved that every positive inte...
Knowledge about number theory and representations of numbersLagrange proved that every positive inte...
Let r(k) (n) denote the number of representations of the positive integer n as the sum of k squares....
AbstractLet rs(n) denote the number of representations of n as the sum of s squares of integers. In ...
We investigate the number of representations of an integer as the sum of various powers. In particul...
We investigate the number of representations of an integer as the sum of various powers. In particul...