Skip to content

Advertisement

  • Research
  • Open Access

A remark on algebraic curves derived from convolution sums

Journal of Inequalities and Applications20132013:58

https://doi.org/10.1186/1029-242X-2013-58

  • Received: 5 December 2012
  • Accepted: 4 February 2013
  • Published:

Abstract

Hahn (Rocky Mt. J. Math. 37:1593-1622, 2007) established three differential equations according to P ( q ) , E ( q ) , and Q ( q ) , which allows us to obtain the values of the formulas for

l + m + n = N σ ˜ ( l ) σ ˜ ( m ) σ ˜ ( n ) , l + m + n = N σ ˆ ( l ) σ ˆ ( m ) σ ˜ ( n ) ,

etc. Finally, by using the above equations, we derive the algebraic curves.

MSC:11A67.

Keywords

  • convolution sums

1 Introduction

Let denote the sets of positive integers. In number theory, divisor functions are defined as
σ s ( N ) = d | N d s , σ ( N ) : = σ 1 ( N ) = d | N d , σ ˜ s ( n ) = d | n ( 1 ) d 1 d s , σ ˆ s ( n ) = d | n ( 1 ) ( n / d ) 1 d s
for N , s , d N . The convolution sum is special one of divisor functions begun by Ramanujan’s effort and expanded by many authors; e.g., see [1]. For example,
m = 1 n 1 σ ( m ) σ ( n m ) = 1 12 ( 5 σ 3 ( n ) + ( 1 6 n ) σ ( n ) )
(1)
is the result of Ramanujan and also Huard, Ou, Spearman, and Williams [[1], (3.10)]. We can see
m = 1 n 1 m σ ( m ) σ ( n m ) = n 24 ( 5 σ 3 ( n ) + ( 1 6 n ) σ ( n ) ) ,
(2)
m = 1 n 1 σ ( m ) σ 3 ( n m ) = 1 240 ( 21 σ 5 ( n ) + ( 10 30 n ) σ 3 ( n ) σ ( n ) )
(3)
in [[1], (3.11), (3.12)], respectively. Moreover, there are
m < n / 2 σ ( m ) σ ( n 2 m ) = 1 24 ( 2 σ 3 ( n ) + ( 1 3 n ) σ ( n ) + 8 σ 3 ( n 2 ) + ( 1 6 n ) σ ( n 2 ) )
(4)
in [[1], (4.4)] and
m < n / 2 σ 3 ( m ) σ ( n 2 m ) = 1 240 ( σ 5 ( n ) σ ( n ) + 20 σ 5 ( n 2 ) + ( 10 30 n ) σ 3 ( n 2 ) ) , m < n / 2 σ ( m ) σ 3 ( n 2 m ) = 1 240 ( 5 σ 5 ( n ) + ( 10 15 n ) σ 3 ( n ) + 16 σ 5 ( n 2 ) σ ( n 2 ) )
(5)
in [[1], Theorem 6]. In addition, Lahiri [2] gave the value of the sum
m 1 + + m r = n m 1 a 1 m r a r σ b 1 ( m 1 ) σ b r ( m r ) ( r 3 ) ,
where the sum is over all positive integers m 1 , , m r satisfying m 1 + + m r = n , a i N { 0 } , and b i N . In this paper we substitute σ ˆ b i ( m i ) for σ b i ( m i ) and obtain the formulas as Lahiri’s evaluation. So, we refer to Hahn’s paper [3]. Officially, we look into Hanh’s definition of three functions for | q | < 1 ,
P ( q ) : = 1 + 8 n = 1 σ ˜ ( n ) q n ,
(6)
E ( q ) : = 1 + 24 n = 1 σ ˆ ( n ) q n ,
(7)
Q ( q ) : = 1 16 n = 1 σ ˜ 3 ( n ) q n .
(8)
Three functions (6), (7), and (8) satisfy the following differential equations:
q d P ( q ) d q = P 2 ( q ) Q ( q ) 4 ,
(9)
q d E ( q ) d q = E ( q ) P ( q ) Q ( q ) 2 ,
(10)
q d Q ( q ) d q = P ( q ) Q ( q ) E ( q ) Q ( q ) .
(11)
The paper is organized as follows. In Section 2, we obtain the values of the formulas for
l + m + n = N σ ˜ ( l ) σ ˜ ( m ) σ ˜ ( n ) , l + m + n = N σ ˆ ( l ) σ ˆ ( m ) σ ˜ ( n ) ,
etc. and insist on the following. Let
f ( N ) { l + m + n = N σ ˜ ( l ) σ ˜ ( m ) σ ˜ ( n ) , m = 1 N 1 σ ˆ ( m ) σ ˆ ( N m ) , l + m + n = N σ ˆ ( l ) σ ˆ ( m ) σ ˆ ( n ) , m = 1 N 1 σ ˆ ( m ) σ ˜ 3 ( N m ) , l + m + n = N σ ˆ ( l ) σ ˆ ( m ) σ ˜ ( n ) , m = 1 N 1 m σ ˆ ( m ) σ ˆ ( N m ) } .
If N is an odd integer and n N { 0 } , then there exist u , a , b , c , d , e , g Z satisfying
f ( N ) = 1 u [ a σ 5 ( N ) + ( b N + c ) σ 3 ( N ) + ( d N 2 + e N + g ) σ ( N ) ]

with a + b + c + d + e + g = 0 (see Theorem 2.9).

In Section 2, we derive the convolution sums of the restricted divisor functions. In Section 3, we obtain the algebraic curves by using the convolution sums in Section 2.

2 Convolution sum l + m + n = N σ ˜ ( l ) σ ˜ ( m ) σ ˜ ( n )

Theorem 2.1 Let N (≥3) be any positive integer. Then we have
l + m + n = N σ ˜ ( l ) σ ˜ ( m ) σ ˜ ( n ) = 1 64 { σ ˜ 5 ( N ) + 6 ( 1 N ) σ ˜ 3 ( N ) + ( 8 N 2 12 N + 3 ) σ ˜ ( N ) } .
Proof Multiplying P ( q ) on both sides in (9), we obtain
P 3 ( q ) = 4 P ( q ) q d P ( q ) d q + P ( q ) Q ( q ) .
(12)
Employing the definition of P ( q ) and Q ( q ) , we can rewrite (12) as
( 1 + 8 n = 1 σ ˜ ( n ) q n ) 3 = 4 ( 1 + 8 n = 1 σ ˜ ( n ) q n ) q ( 8 m = 1 m σ ˜ ( m ) q m 1 ) + ( 1 + 8 n = 1 σ ˜ ( n ) q n ) ( 1 16 m = 1 σ ˜ 3 ( m ) q m ) .
Thus, we have
512 N = 3 L = 2 N 1 l = 1 L 1 σ ˜ ( N L ) σ ˜ ( L l ) σ ˜ ( l ) q N = 16 N = 1 { σ ˜ ( N ) + σ ˜ 3 ( N ) 2 N σ ˜ ( N ) } q N 192 N = 2 l = 1 N 1 σ ˜ ( l ) σ ˜ ( N l ) q N 128 N = 2 l = 1 N 1 σ ˜ ( l ) σ ˜ 3 ( N l ) q N + 256 N = 2 l = 1 N 1 l σ ˜ ( l ) σ ˜ ( N l ) q N .
Then we refer to
4 m < n σ ˜ ( m ) σ ˜ ( n m ) = σ ˜ 3 ( n ) + ( 2 n 1 ) σ ˜ ( n )
in [[3], (4.4)],
16 m < n σ ˜ ( m ) σ ˜ 3 ( n m ) = σ ˜ 5 ( n ) + 2 ( n 1 ) σ ˜ 3 ( n ) + σ ˜ ( n )
in [[3], (4.9)] and by direct calculation we get
l = 1 N 1 l σ ˜ ( l ) σ ˜ ( N l ) = N 2 l = 1 N 1 σ ˜ ( l ) σ ˜ ( N l ) .

This completes the proof of the theorem. □

Corollary 2.2 We obtain
ln | Q ( q ) | = 8 n = 1 σ ˜ ( n ) 3 σ ˆ ( n ) n q n ,

where Q ( q ) = 1 16 n = 1 σ ˜ 3 ( n ) q n as (8).

Proof By separating the variables in (11), we can have
0 q d Q ( x ) Q ( x ) = 0 q E ( x ) P ( x ) x d x .
Thus,
ln | Q ( q ) | = 0 q 8 n = 1 ( 3 σ ˆ ( n ) σ ˜ ( n ) ) x n 1 d x .
We note that 3 σ ˆ ( n ) σ ˜ ( n ) is positive because
3 σ ˆ ( n ) σ ˜ ( n ) = 2 ( σ ( n ) σ ( n / 2 ) )
according to
σ ˜ s ( n ) = σ s ( n ) 2 s + 1 σ s ( n / 2 ) and σ ˆ s ( n ) = σ s ( n ) 2 σ s ( n / 2 )

in [[3], (1.12), (1.13)]. Therefore, we can exchange the summation and the integral. This completes the proof of the corollary. □

We introduce the following Lemma 2.3 to deduce Theorem 2.6.

Lemma 2.3 Let N (≥2) be any positive integer. Then we have
  1. (a)

    m = 1 N 1 σ ˆ ( m ) σ ˆ ( N m ) = 1 12 ( σ 3 ( N ) + 4 σ 3 ( N 2 ) σ ˆ ( N ) ) .

     
  2. (b)

    m = 1 N 1 σ ˆ ( m ) σ ˜ 3 ( N m ) = 1 48 ( σ ˜ 5 ( N ) + 2 σ ˜ 3 ( N ) 3 σ ˆ ( N ) ) .

     
  3. (c)

    m = 1 N 1 m σ ˆ ( m ) σ ˆ ( N m ) = N 24 ( σ 3 ( N ) + 4 σ 3 ( N 2 ) σ ˆ ( N ) ) .

     
Proof (a) The proof is the same as Remark in [[3], p.13]. Also, Hahn showed that
36 m < n σ ˆ ( m ) σ ˆ ( n m ) = { 3 σ ˆ ( n ) + 3 σ ˜ 3 ( n ) , if  n  is odd , 3 σ ˆ ( n ) 5 σ ˜ 3 ( n ) + 4 σ ˜ 3 ( n / 2 ) , if  n  is even
in [[3], Theorem 4.2] derived by the identity E 2 ( q ) = z 4 ( 1 + x ) 2 , which is the same result (a).
  1. (b)
    The convolution sum can be written as
    m = 1 N 1 σ ˆ ( m ) σ ˜ 3 ( N m ) = m = 1 N 1 { σ ( m ) 2 σ ( m 2 ) } { σ 3 ( N m ) 16 σ 3 ( N m 2 ) } = m = 1 N 1 σ ( m ) σ 3 ( N m ) 16 m = 1 N 1 σ ( m ) σ 3 ( N m 2 ) 2 m = 1 N 1 σ ( m 2 ) σ 3 ( N m ) + 32 m = 1 N 1 σ ( m 2 ) σ 3 ( N m 2 ) .
     
Then we obtain
m = 1 N 1 σ ( m ) σ 3 ( N m 2 ) = t < N / 2 σ ( N 2 t ) σ 3 ( t ) , m = 1 N 1 σ ( m 2 ) σ 3 ( N m ) = t < N / 2 σ ( t ) σ 3 ( N 2 t ) , m = 1 N 1 σ ( m 2 ) σ 3 ( N m 2 ) = t < N / 2 σ ( t ) σ 3 ( N 2 t ) .
Therefore, we have proved (b) by using (3) and (5).
  1. (c)

    We obtain the proof by direct calculation of the index m. □

     
Corollary 2.4 Let N = 2 q + 1 be an odd prime in Lemma  2.3 and let T i ( n ) = k = 1 n k i ( i 1 ). Then we have
  1. (a)

    m = 1 2 q σ ˆ ( m ) σ ˆ ( 2 q + 1 m ) = 2 T 2 ( q ) .

     
  2. (b)

    m = 1 2 q σ ˆ ( m ) σ ˜ 3 ( 2 q + 1 m ) = 2 ( q 2 + q + 1 ) T 2 ( q ) .

     
  3. (c)

    m = 1 2 q m σ ˆ ( m ) σ ˆ ( 2 q + 1 m ) = N T 2 ( q ) .

     

Proof

From Lemma 2.3(a), (b), and (c), we obtain
m = 1 2 q σ ˆ ( m ) σ ˆ ( 2 q + 1 m ) = 1 12 { ( 2 q + 1 ) 3 ( 2 q + 1 ) } , m = 1 2 q σ ˆ ( m ) σ ˜ 3 ( 2 q + 1 m ) = 1 48 { ( 2 q + 1 ) 5 + 2 ( 2 q + 1 ) 3 3 ( 2 q + 1 ) } , m = 1 2 q m σ ˆ ( m ) σ ˆ ( 2 q + 1 m ) = 2 q + 1 24 { ( 2 q + 1 ) 3 ( 2 q + 1 ) } .

This completes the proof of the corollary. □

Example 2.5 The first eleven values of m = 1 2 q σ ˆ ( m ) σ ˆ ( 2 q + 1 m ) and 2 T 2 ( q ) are listed in Table 1.
Table 1

Examples for m = 1 2 q σ ˆ ( m ) σ ˆ ( 2 q + 1 m ) and 2 T 2 ( q ) ( 1 q 11 )

q

1

2

3

4

5

6

7

8

9

10

11

m = 1 2 q σ ˆ ( m ) σ ˆ ( 2 q + 1 m )

2

10

28

62

110

182

292

408

570

800

1 , 012

2 T 2 ( q )

2

10

28

60

110

182

280

408

570

770

1 , 012

Theorem 2.6 Let N (≥3) be any positive integer. Then we have
l + m + n = N σ ˆ ( l ) σ ˆ ( m ) σ ˜ ( n ) = 1 576 { σ ˜ 5 ( N ) + 4 σ ˜ 3 ( N ) + σ ˜ ( N ) 6 ( 2 N 1 ) σ ˆ ( N ) + 6 ( N 1 ) ( σ 3 ( N ) + 4 σ 3 ( N 2 ) ) } .
Proof Multiplying E ( q ) in (10), we obtain
E 2 ( q ) P ( q ) = E ( q ) Q ( q ) + 2 E ( q ) q d E ( q ) d q .
So, we have
( 1 + 24 n = 1 σ ˆ ( n ) q n ) 2 ( 1 + 8 m = 1 σ ˜ ( m ) q m ) = ( 1 + 24 n = 1 σ ˆ ( n ) q n ) ( 1 16 m = 1 σ ˜ 3 ( m ) q m ) + 2 ( 1 + 24 n = 1 σ ˆ ( n ) q n ) q ( 24 m = 1 m σ ˆ ( m ) q m 1 ) .
Therefore
4 , 608 N = 3 L = 2 N 1 l = 1 L 1 σ ˆ ( N L ) σ ˆ ( L l ) σ ˜ ( l ) q N = 8 N = 1 { σ ˜ ( N ) + 2 σ ˜ 3 ( N ) + 3 σ ˆ ( N ) 6 N σ ˆ ( N ) } q N 384 N = 2 l = 1 N 1 σ ˆ ( l ) σ ˜ ( N l ) q N 384 N = 2 l = 1 N 1 σ ˆ ( l ) σ ˜ 3 ( N l ) q N 576 N = 2 l = 1 N 1 σ ˆ ( l ) σ ˆ ( N l ) q N + 1 , 152 N = 2 l = 1 N 1 l σ ˆ ( l ) σ ˆ ( N l ) q N .

Lastly, we use Lemma 2.3. □

Theorem 2.7 Let N (≥3) be any positive integer. Then we have
l + m + n = N σ ˆ ( l ) σ ˆ ( m ) σ ˆ ( n ) = 1 192 { σ 5 ( N ) 8 σ 5 ( N 2 ) 2 σ 3 ( N ) 8 σ 3 ( N 2 ) + σ ˆ ( N ) } .

Proof

Let us consider
l + m + n = N σ ˆ ( l ) σ ˆ ( m ) σ ˆ ( n ) = l = 1 N 2 σ ˆ ( l ) m + n = N l σ ˆ ( m ) σ ˆ ( n ) = l = 1 N 2 σ ˆ ( l ) 1 12 { σ 3 ( N l ) + 4 σ 3 ( N l 2 ) σ ˆ ( N l ) } = l = 1 N 1 σ ˆ ( l ) 1 12 { σ 3 ( N l ) + 4 σ 3 ( N l 2 ) σ ˆ ( N l ) }
(13)
by Lemma 2.3(a). Then (13) becomes
l + m + n = N σ ˆ ( l ) σ ˆ ( m ) σ ˆ ( n ) = 1 12 { l = 1 N 1 σ ( l ) σ 3 ( N l ) 2 l < N / 2 σ ( l ) σ 3 ( N 2 l ) + 4 t < N / 2 σ 3 ( t ) σ ( N 2 t ) 8 t < N / 2 σ ( t ) σ 3 ( N 2 t ) l = 1 N 1 σ ˆ ( l ) σ ˆ ( N l ) }

by σ ˆ ( n ) = σ ( n ) 2 σ ( n 2 ) . □

Remark 2.8 Let N = 2 q + 1 be an odd prime in Theorem 2.7. Then we have
l + m + n = 2 q + 1 σ ˆ ( l ) σ ˆ ( m ) σ ˆ ( n ) = T 1 ( q ) T 2 ( q ) .

Proof It is obvious. □

Importantly, we propose the following theorem.

Theorem 2.9 Let
f { l + m + n = N σ ˜ ( l ) σ ˜ ( m ) σ ˜ ( n ) , m = 1 N 1 σ ˆ ( m ) σ ˆ ( N m ) , l + m + n = N σ ˆ ( l ) σ ˆ ( m ) σ ˆ ( n ) , m = 1 N 1 σ ˆ ( m ) σ ˜ 3 ( N m ) , l + m + n = N σ ˆ ( l ) σ ˆ ( m ) σ ˜ ( n ) , m = 1 N 1 m σ ˆ ( m ) σ ˆ ( N m ) } .
If N is an odd integer and n N { 0 } , then there exist u , a , b , c , d , e , g Z satisfying
f ( N ) = 1 u [ a σ 5 ( N ) + ( b N + c ) σ 3 ( N ) + ( d N 2 + e N + g ) σ ( N ) ]

with a + b + c + d + e + g = 0 .

Proof It is satisfied by Theorem 2.1, Lemma 2.3, Theorem 2.6, and Theorem 2.7. □

The expressions are shown in Table 2.
Table 2

Formulas for f ( N ) with odd N

 

f(N)

l + m + n = N σ ˜ ( l ) σ ˜ ( m ) σ ˜ ( n )

1 64 ( σ 5 ( N ) + 6 ( 1 N ) σ 3 ( N ) + ( 8 N 2 12 N + 3 ) σ ( N ) )

m = 1 N 1 σ ˆ ( m ) σ ˆ ( N m )

1 12 ( σ 3 ( N ) σ ( N ) )

m = 1 N 1 σ ˆ ( m ) σ ˜ 3 ( N m )

1 48 ( σ 5 ( N ) + 2 σ 3 ( N ) 3 σ ( N ) )

m = 1 N 1 m σ ˆ ( m ) σ ˆ ( N m )

N 24 ( σ 3 ( N ) σ ( N ) )

l + m + n = N σ ˆ ( l ) σ ˆ ( m ) σ ˜ ( n )

1 576 ( σ 5 ( N ) + ( 6 N 2 ) σ 3 ( N ) + ( 7 12 N ) σ ( N ) )

l + m + n = N σ ˆ ( l ) σ ˆ ( m ) σ ˆ ( n )

1 192 ( σ 5 ( N ) 2 σ 3 ( N ) + σ ( N ) )

3 Algebraic curves derived from convolution sums

To obtain the result of this section, we need a general theory and it is this that we describe. Suppose that the two polynomials
f 1 ( x ) = c 0 x n + + c n 1 x + c n , f 2 ( x ) = d 0 x m + + d m 1 x + d m
have common zero, say x 0 . Then each of the equations
f 1 ( x ) = x f 1 ( x ) = = x m 1 f 1 ( x ) = 0 = f 2 ( x ) = x f 2 ( x ) = = x n 1 f 2 ( x )
is of the form p ( x ) = 0 , where p is a polynomial of degree at most m + n 1 , and as each of these equations is satisfied when x = x 0 , the determinant of the coefficients must vanish. This ( m + n ) × ( m + n ) determinant is the resultant R ( f 1 , f 2 ) of f 1 and g 1 and
R ( f 1 , f 2 ) = | c 0 c n c 0 c n d 0 d m d 0 d m | ,
where the omitted elements are zero, and the diagonal of R ( f 1 , f 2 ) contains m occurrences of c 0 and n of d m [[4], p.206]. We can obtain Table 3 from the results of Section 2.
Table 3

Formulas for a 1 a 12

 

x = n

x = p

m = 1 x 1 σ ( m ) σ ( x m )

1 12 ( 5 σ 3 ( n ) + ( 1 6 n ) σ ( n ) )

1 12 ( p 1 ) ( p + 1 ) ( 5 p 6 )

m = 1 x 1 m σ ( m ) σ ( x m )

n 24 ( 5 σ 3 ( n ) + ( 1 6 n ) σ ( n ) )

1 24 p ( p 1 ) ( p + 1 ) ( 5 p 6 )

m = 1 x 1 σ ( m ) σ 3 ( n m )

1 240 ( 21 σ 5 ( n ) + ( 10 30 n ) σ 3 ( n ) σ ( n ) )

1 240 ( p 1 ) ( p + 1 ) × ( 21 p 3 30 p 2 + 31 p 30 )

m < x / 2 σ ( m ) σ ( x 2 m )

1 24 ( 2 σ 3 ( n ) + ( 1 3 n ) σ ( n ) + 8 σ 3 ( n / 2 ) + ( 1 6 n ) σ ( n / 2 ) )

1 24 ( p 1 ) ( p + 1 ) ( 2 p 3 )

m < x / 2 σ 3 ( m ) σ ( x 2 m )

1 240 ( σ 5 ( n ) σ ( n ) + 20 σ 5 ( n / 2 ) + ( 10 30 n ) σ 3 ( n / 2 ) )

1 240 ( p 1 ) p ( p + 1 ) ( p 2 + 1 )

m < x / 2 σ ( m ) σ 3 ( x 2 m )

1 240 ( 5 σ 5 ( n ) + ( 10 15 n ) σ 3 ( n ) + 16 σ 5 ( n / 2 ) σ ( n / 2 ) )

1 48 ( p 1 ) ( p + 1 ) ( p 3 3 p 2 + 3 p 3 )

l + m + s = x σ ˜ ( l ) σ ˜ ( m ) σ ˜ ( s )

1 64 { σ ˜ 5 ( n ) + 6 ( 1 n ) σ ˜ 3 ( n ) + ( 8 n 2 12 n + 3 ) σ ˜ ( n ) }

1 64 ( p + 1 ) ( p 1 ) 2 ( p 2 5 p + 10 )

m = 1 x 1 σ ˆ ( m ) σ ˆ ( x m )

1 12 ( σ 3 ( n ) + 4 σ 3 ( n 2 ) σ ˆ ( n ) )

1 12 ( p 1 ) p ( p + 1 )

m = 1 x 1 σ ˆ ( m ) σ ˜ 3 ( x m )

1 48 ( σ ˜ 5 ( n ) + 2 σ ˜ 3 ( n ) 3 σ ˆ ( n ) )

1 48 ( p 1 ) p ( p + 1 ) ( p 2 + 3 )

m = 1 x 1 m σ ˆ ( m ) σ ˆ ( x m )

n 24 ( σ 3 ( n ) + 4 σ 3 ( n 2 ) σ ˆ ( n ) )

1 24 ( p 1 ) p 2 ( p + 1 )

l + m + s = x σ ˆ ( l ) σ ˆ ( m ) σ ˜ ( s )

1 576 { σ ˜ 5 ( n ) + 4 σ ˜ 3 ( n ) + σ ˜ ( n ) 6 ( 2 n 1 ) σ ˆ ( n ) + 6 ( n 1 ) ( σ 3 ( n ) + 4 σ 3 ( n 2 ) ) }

1 576 ( p 1 ) 2 ( p + 1 ) 2 ( p + 6 )

l + m + s = x σ ˆ ( l ) σ ˆ ( m ) σ ˆ ( s )

1 192 ( σ 5 ( n ) 8 σ 5 ( n 2 ) 2 σ 3 ( n ) 8 σ 3 ( n 2 ) + σ ˆ ( n ) )

1 192 ( p 1 ) 2 p ( p + 1 ) 2

Corollary 3.1 Let
a 1 ( n ) : = m = 1 n 1 σ ( m ) σ ( n m ) , a 2 ( n ) : = m = 1 n 1 m σ ( m ) σ ( n m ) , a 3 ( n ) : = m = 1 n 1 σ ( m ) σ 3 ( n m ) , a 4 ( n ) : = m < n / 2 σ ( m ) σ ( n 2 m ) , a 5 ( n ) : = m < n / 2 σ 3 ( m ) σ ( n 2 m ) , a 6 ( n ) : = m < n / 2 σ ( m ) σ 3 ( n 2 m ) , a 7 ( n ) : = l + m + s = n σ ˜ ( l ) σ ˜ ( m ) σ ˜ ( s ) , a 8 ( n ) : = m = 1 n 1 σ ˆ ( m ) σ ˆ ( n m ) , a 9 ( n ) : = m = 1 n 1 σ ˆ ( m ) σ ˜ 3 ( n m ) , a 10 ( n ) : = m = 1 n 1 m σ ˆ ( m ) σ ˆ ( n m ) , a 11 ( n ) : = l + m + s = n σ ˆ ( l ) σ ˆ ( m ) σ ˜ ( s ) , a 12 ( n ) : = l + m + s = n σ ˆ ( l ) σ ˆ ( m ) σ ˆ ( s ) .
There exists a polynomial T ( x , y ) Z [ x , y ] such that T ( a i ( p ) , a j ( p ) ) = 0 with i , j { 1 , 2 , , 12 } where p is an odd prime. We abbreviate a 1 ( n ) to a 1 and it is also applied to the other values. Then we get Table 4.
Table 4

Formulas of T ( x ( p ) , y ( p ) ) = 0

(x,y)

T(x,y)

( a 1 , a 2 )

3 a 1 3 + 6 a 1 4 + 5 a 1 2 a 2 + 12 a 1 a 2 2 20 a 2 3

( a 1 , a 3 )

168 a 1 2 + 162 , 358 a 1 3 143 , 775 a 1 4 + 83 , 349 a 1 5 750 a 1 a 3 1 , 045 , 050 a 1 2 a 3 + 283 , 500 a 1 3 a 3 + 825 a 3 2 + 2 , 221 , 875 a 1 a 3 2 1 , 562 , 500 a 3 3

( a 1 , a 4 )

5 a 1 2 + 32 a 1 3 + 32 a 1 a 4 480 a 1 2 a 4 44 a 4 2 + 2 , 400 a 1 a 4 2 4 , 000 a 4 3

( a 1 , a 5 )

61 a 1 2 + 194 a 1 3 180 a 1 4 + 72 a 1 5 + 6 , 100 a 1 a 5 28 , 000 a 1 2 a 5 + 18 , 000 a 1 3 a 5 + 67 , 100 a 5 2 + 1 , 525 , 000 a 1 a 5 2 12 , 500 , 000 a 5 3

( a 1 , a 6 )

415 a 1 2 + 408 a 1 3 360 a 1 4 + 144 a 1 5 + 2 , 656 a 1 a 6 + 304 a 1 2 a 6 3 , 600 a 1 3 a 6 3 , 652 a 6 2 + 38 , 000 a 1 a 6 2 200 , 000 a 6 3

( a 1 , a 7 )

22 , 032 a 1 3 + 3 , 402 a 1 4 + 243 a 1 5 3 , 264 a 1 a 7 217 , 152 a 1 2 a 7 32 , 400 a 1 3 a 7 + 5 , 984 a 7 2 + 762 , 000 a 1 a 7 2 800 , 000 a 7 3

( a 1 , a 8 )

a 1 2 + 2 a 1 3 + 10 a 1 a 8 30 a 1 2 a 8 + 11 a 8 2 + 150 a 1 a 8 2 250 a 8 3

( a 1 , a 9 )

111 a 1 2 + 258 a 1 3 81 a 1 4 + 18 a 1 5 1 , 110 a 1 a 9 + 3 , 940 a 1 2 a 9 900 a 1 3 a 9 + 1 , 221 a 9 2 + 22 , 750 a 1 a 9 2 + 25 , 000 a 9 3

( a 1 , a 10 )

3 a 1 2 12 a 1 3 + 12 a 1 4 + 72 a 1 a 10 94 a 1 2 a 10 + 132 a 10 2 + 2 , 400 a 1 a 10 2 5 , 000 a 10 3

( a 1 , a 11 )

105 a 1 4 + a 1 5 10 , 224 a 1 2 a 11 + 2 , 400 a 1 3 a 11 + 5 , 808 a 11 2 + 350 , 000 a 1 a 11 2 2 , 400 , 000 a 11 3

( a 1 , a 12 )

9 a 1 4 + 18 a 1 5 1 , 440 a 1 2 a 12 + 3 , 600 a 1 3 a 12 + 1 , 936 a 12 2 + 124 , 000 a 1 a 12 2 1 , 600 , 000 a 12 3

( a 2 , a 3 )

10 , 080 a 2 2 + 16 , 307 , 536 a 2 3 36 , 244 , 800 a 2 4 + 28 , 005 , 264 a 2 5 2 , 700 a 2 a 3 23 , 500 , 980 a 2 2 a 3 37 , 184 , 400 a 2 3 a 3 12 , 375 a 3 2 14 , 849 , 125 a 2 a 3 2 + 208 , 935 , 000 a 2 2 a 3 2 + 23 , 536 , 500 a 3 3 + 22 , 500 , 000 a 2 a 3 3 187 , 500 , 000 a 3 4

( a 2 , a 4 )

15 a 2 2 + 128 a 2 3 18 a 2 a 4 768 a 2 2 a 4 + 33 a 4 2 944 a 2 a 4 2 + 2 , 736 a 4 3 24 , 000 a 4 4

( a 2 , a 5 )

61 a 2 3 120 a 2 4 + 144 a 2 5 + 7 , 320 a 2 2 a 5 18 , 000 a 2 3 a 5 + 236 , 375 a 2 a 5 2 165 , 000 a 2 2 a 5 2 + 1 , 006 , 500 a 5 3 + 22 , 500 , 000 a 2 a 5 3 187 , 500 , 000 a 5 4

( a 2 , a 6 )

415 a 2 2 + 1 , 344 a 2 3 1 , 344 a 2 4 + 384 a 2 5 498 a 2 a 6 + 5 , 192 a 2 2 a 6 6 , 528 a 2 3 a 6 + 913 a 6 2 + 21 , 816 a 2 a 6 2 68 , 800 a 2 2 a 6 2 + 35 , 392 a 6 3 480 , 000 a 2 a 6 3 800 , 000 a 6 4

( a 2 , a 7 )

55 , 080 a 2 3 + 7 , 290 a 2 4 + 243 a 2 5 2 , 040 a 2 a 7 121 , 140 a 2 2 a 7 16 , 956 a 2 3 a 7 1 , 870 a 7 2 + 127 , 401 a 2 a 7 2 747 , 000 a 2 2 a 7 2 + 261 , 968 a 7 3 2 , 160 , 000 a 2 a 7 3 1 , 600 , 000 a 7 4

( a 2 , a 8 )

4 a 2 3 + 36 a 2 2 a 8 + 83 a 2 a 8 2 + 33 a 8 3 750 a 8 4

( a 2 , a 9 )

444 a 2 3 240 a 2 4 + 48 a 2 5 4 , 440 a 2 2 a 9 + 2 , 880 a 2 3 a 9 + 11 , 877 a 2 a 9 2 + 5 , 800 a 2 2 a 9 2 4 , 884 a 9 3 60 , 000 a 2 a 9 3 100 , 000 a 9 4

( a 2 , a 10 )

2 a 2 4 + 3 a 2 2 a 10 40 a 2 3 a 10 30 a 2 a 10 2 + 300 a 2 2 a 10 2 33 a 10 3 1 , 000 a 2 a 10 3 + 1 , 250 a 10 4

( a 2 , a 11 )

315 a 2 4 + a 2 5 + 7 , 668 a 2 2 a 11 + 30 , 228 a 2 3 a 11 1 , 089 a 11 2 110 , 101 a 2 a 11 2 916 , 200 a 2 2 a 11 2 + 554 , 544 a 11 3 + 10 , 800 , 000 a 2 a 11 3 43 , 200 , 000 a 11 4

( a 2 , a 12 )

9 a 2 5 + 360 a 2 3 a 12 121 a 2 a 12 2 30 , 600 a 2 2 a 12 2 + 5 , 808 a 12 3 + 720 , 000 a 2 a 12 3 4 , 800 , 000 a 12 4

( a 3 , a 4 )

6 , 625 a 3 2 + 64 , 000 a 3 3 + 20 , 140 a 3 a 4 612 , 000 a 3 2 a 4 11 , 872 a 4 2 + 1 , 492 , 080 a 3 a 4 2 1 , 040 , 816 a 4 3 2 , 721 , 600 a 3 a 4 3 + 4 , 723 , 920 a 4 4 10 , 668 , 672 a 4 5

( a 3 , a 5 )

a 3 2 + 8 a 3 3 144 a 3 4 + 1 , 152 a 3 5 + 52 a 3 a 5 + 56 a 3 2 a 5 + 4 , 896 a 3 3 a 5 120 , 960 a 3 4 a 5 + 224 a 5 2 22 , 736 a 3 a 5 2 + 144 , 576 a 3 2 a 5 2 + 5 , 080 , 320 a 3 3 a 5 2 181 , 328 a 5 3 735 , 264 a 3 a 5 3 106 , 686 , 720 a 3 2 a 5 3 + 50 , 985 , 936 a 5 4 + 1 , 120 , 210 , 560 a 3 a 5 4 4 , 704 , 884 , 352 a 5 5

( a 3 , a 6 )

341 , 375 a 3 2 + 4 , 749 , 000 a 3 3 18 , 000 , 000 a 3 4 + 7 , 200 , 000 a 3 5 + 1 , 037 , 780 a 3 a 6 21 , 435 , 400 a 3 2 a 6 + 133 , 848 , 000 a 3 3 a 6 151 , 200 , 000 a 3 4 a 6 611 , 744 a 6 2 + 43 , 392 , 400 a 3 a 6 2 587 , 858 , 400 a 3 2 a 6 2 + 1 , 270 , 080 , 000 a 3 3 a 6 2 43 , 483 , 216 a 6 3 + 1 , 153 , 638 , 720 a 3 a 6 3 5 , 334 , 336 , 000 a 3 2 a 6 3 669 , 437 , 136 a 6 4 + 11 , 202 , 105 , 600 a 3 a 6 4 9 , 409 , 768 , 704 a 6 5

( a 3 , a 7 )

1 , 155 , 060 , 000 a 3 3 + 104 , 034 , 375 a 3 4 + 3 , 037 , 500 a 3 5 27 , 379 , 200 a 3 a 7 4 , 160 , 682 , 000 a 3 2 a 7 566 , 676 , 000 a 3 3 a 7 85 , 050 , 000 a 3 4 a 7 + 25 , 553 , 920 a 7 2 + 6 , 748 , 222 , 080 a 3 a 7 2 20 , 313 , 741 , 600 a 3 2 a 7 2 + 952 , 560 , 000 a 3 3 a 7 2 3 , 624 , 210 , 688 a 7 3 + 20 , 040 , 791 , 040 a 3 a 7 3 5 , 334 , 336 , 000 a 3 2 a 7 3 + 176 , 788 , 224 a 7 4 + 14 , 936 , 140 , 800 a 3 a 7 4 16 , 728 , 477 , 696 a 7 5

( a 3 , a 8 )

125 a 3 2 + 1 , 000 a 3 3 + 650 a 3 a 8 6 , 750 a 3 2 a 8 + 280 a 8 2 + 5 , 820 a 3 a 8 2 5 , 978 a 8 3 + 56 , 700 a 3 a 8 3 7 , 695 a 8 4 166 , 698 a 8 5

( a 3 , a 9 )

52 , 125 a 3 2 + 360 , 750 a 3 3 + 421 , 875 a 3 4 + 225 , 000 a 3 5 271 , 050 a 3 a 9 + 2 , 621 , 450 a 3 2 a 9 + 3 , 667 , 500 a 3 3 a 9 + 4 , 725 , 000 a 3 4 a 9 + 116 , 760 a 9 2 + 4 , 007 , 030 a 3 a 9 2 780 , 750 a 3 2 a 9 2 + 39 , 690 , 000 a 3 3 a 9 3 + 2 , 270 , 618 a 9 3 43 , 218 , 900 a 3 a 9 3 + 166 , 698 , 000 a 3 2 a 9 3 + 9 , 146 , 115 a 9 4 + 350 , 065 , 800 a 3 a 9 4 + 294 , 055 , 272 a 9 5

( a 3 , a 10 )

1 , 875 a 3 2 30 , 000 a 3 3 + 120 , 000 a 3 4 + 22 , 500 a 3 a 10 311 , 950 a 3 2 a 10 + 1 , 440 , 000 a 3 3 a 10 + 16 , 800 a 10 2 + 37 , 800 a 3 a 10 2 + 2 , 826 , 000 a 3 2 a 10 2 955 , 472 a 10 3 2 , 613 , 600 a 3 a 10 3 + 12 , 946 , 608 a 10 4 56 , 010 , 528 a 10 5

( a 3 , a 11 )

5 , 315 , 625 a 3 4 + 6 , 250 a 3 5 133 , 844 , 400 a 3 2 a 11 + 358 , 344 , 000 a 3 3 a 11 1 , 575 , 000 a 3 4 a 11 + 12 , 192 , 768 a 11 2 + 1 , 542 , 181 , 760 a 3 a 11 2 + 607 , 773 , 600 a 3 2 a 11 2 + 158 , 760 , 000 a 3 3 a 11 2 5 , 851 , 104 , 000 a 11 3 41 , 822 , 645 , 760 a 3 a 11 3 8 , 001 , 504 , 000 a 3 2 a 11 3 + 213 , 353 , 968 , 896 a 11 4 + 201 , 637 , 900 , 800 a 3 a 11 4 2 , 032 , 510 , 040 , 064 a 11 5

( a 3 , a 12 )

28 , 125 a 3 4 + 225 , 000 a 3 5 1 , 170 , 000 a 3 2 a 12 + 12 , 420 , 000 a 3 3 a 12 18 , 900 , 000 a 3 4 a 12 + 250 , 880 a 12 2 + 33 , 272 , 960 a 3 a 12 2 205 , 380 , 000 a 3 2 a 12 2 + 635 , 040 , 000 a 3 3 a 12 2 228 , 392 , 192 a 12 3 + 287 , 539 , 200 a 3 a 12 3 10 , 668 , 672 , 000 a 3 2 a 12 3 + 5 , 816 , 344 , 320 a 12 4 + 89 , 616 , 844 , 800 a 3 a 12 4 301 , 112 , 598 , 528 a 12 5

( a 4 , a 5 )

13 a 4 2 + 176 a 4 3 720 a 4 4 + 1 , 152 a 4 5 + 260 a 4 a 5 4 , 880 a 4 2 a 5 + 14 , 400 a 4 3 a 5 + 1 , 625 a 5 2 + 52 , 000 a 4 a 5 2 64 , 000 a 5 3

( a 4 , a 6 )

25 a 4 2 + 168 a 4 3 576 a 4 4 + 1 , 152 a 4 5 + 50 a 4 a 6 200 a 4 2 a 6 576 a 4 3 a 6 25 a 6 2 + 544 a 4 a 6 2 512 a 6 3

( a 4 , a 7 )

6 , 156 a 4 3 + 5 , 589 a 4 4 + 1 , 944 a 4 5 228 a 4 a 7 10 , 980 a 4 2 a 7 9 , 072 a 4 3 a 7 + 95 a 7 2 + 8 , 544 a 4 a 7 2 2 , 048 a 7 3

( a 4 , a 8 )

4 a 4 2 + 32 a 4 3 + 8 a 4 a 8 96 a 4 2 a 8 + 5 a 8 2 + 96 a 4 a 8 2 32 a 8 3

( a 4 , a 9 )

84 a 4 2 + 816 a 4 3 1 , 296 a 4 4 + 1 , 152 a 4 5 168 a 4 a 9 + 2 , 432 a 4 2 a 9 2 , 880 a 4 3 a 9 + 105 a 9 2 + 2 , 848 a 4 a 9 2 + 512 a 9 3

( a 4 , a 10 )

3 a 4 2 48 a 4 3 + 192 a 4 4 + 18 a 4 a 10 112 a 4 2 a 10 + 15 a 10 2 + 384 a 4 a 10 2 128 a 10 3

( a 4 , a 11 )

175 a 4 4 + 8 a 4 5 900 a 4 2 a 11 + 816 a 4 3 a 11 + 125 a 11 2 + 5 , 920 a 4 a 11 2 6 , 144 a 11 3

( a 4 , a 12 )

9 a 4 4 + 72 a 4 5 72 a 4 2 a 12 + 720 a 4 3 a 12 + 25 a 12 2 + 1 , 312 a 4 a 12 2 2 , 048 a 12 3

( a 5 , a 6 )

125 a 5 2 + 24 , 000 a 5 3 1 , 800 , 000 a 5 4 + 7 , 200 , 000 a 5 5 20 a 5 a 6 + 2 , 600 a 5 2 a 6 432 , 000 a 5 3 a 6 7 , 200 , 000 a 5 4 a 6 + a 6 2 + 200 a 5 a 6 2 158 , 400 a 5 2 a 6 2 + 2 , 880 , 000 a 5 3 a 6 2 16 a 6 3 + 4 , 320 a 5 a 6 3 576 , 000 a 5 2 a 6 3 + 144 a 6 4 + 57 , 600 a 5 a 6 4 2 , 304 a 6 5

( a 5 , a 7 )

10 , 732 , 500 a 5 3 + 15 , 946 , 875 a 5 4 + 6 , 075 , 000 a 5 5 15 , 900 a 5 a 7 4 , 972 , 500 a 5 2 a 7 10 , 827 , 000 a 5 3 a 7 8 , 100 , 000 a 5 4 a 7 + 265 a 7 2 + 183 , 960 a 5 a 7 2 12 , 355 , 200 a 5 2 a 7 2 + 4 , 320 , 000 a 5 3 a 7 2 2 , 016 a 7 3 + 17 , 280 a 5 a 7 3 1 , 152 , 000 a 5 2 a 7 3 + 3 , 328 a 7 4 + 153 , 600 a 5 a 7 4 8 , 192 a 7 5

( a 5 , a 8 )

2 , 000 a 5 3 500 a 5 2 a 8 + 40 a 5 a 8 2 a 8 3 36 a 8 5

( a 5 , a 9 )

1 , 500 a 5 3 + 450 , 000 a 5 5 + 400 a 5 2 a 9 + 450 , 000 a 5 4 a 9 + 35 a 5 a 9 2 + 180 , 000 a 5 3 a 9 2 + a 9 3 + 36 , 000 a 5 2 a 9 3 + 3 , 600 a 5 a 9 4 + 144 a 9 5

( a 5 , a 10 )

60 , 000 a 5 4 + 25 a 5 2 a 10 3 , 000 a 5 2 a 10 2 a 10 3 + 24 a 10 4 144 a 10 5

( a 5 , a 11 )

809 , 375 a 5 4 + 25 , 000 a 5 5 11 , 100 a 5 2 a 11 + 561 , 000 a 5 3 a 11 300 , 000 a 5 4 a 11 + 37 a 11 2 760 a 5 a 11 2 1 , 353 , 600 a 5 2 a 11 2 + 1 , 440 , 000 a 5 3 a 11 2 5 , 280 a 11 3 51 , 840 a 5 a 11 3 3 , 456 , 000 a 5 2 a 11 3 + 186 , 624 a 11 4 + 4 , 147 , 200 a 5 a 11 4 1 , 990 , 656 a 11 5

( a 5 , a 12 )

28 , 125 a 5 5 112 , 500 a 5 4 a 12 5 a 5 a 12 2 + 180 , 000 a 5 3 a 12 2 4 a 12 3 144 , 000 a 5 2 a 12 3 + 57 , 600 a 5 a 12 4 9 , 216 a 12 5

( a 6 , a 7 )

44 , 388 a 6 3 + 12 , 879 a 6 4 + 3 , 888 a 6 5 1 , 644 a 6 a 7 + 756 a 6 2 a 7 + 7 , 776 a 6 3 a 7 25 , 920 a 6 4 a 7 + 685 a 7 2 6 , 840 a 6 a 7 2 101 , 088 a 6 2 a 7 2 + 69 , 120 a 6 3 a 7 2 672 a 7 3 + 43 , 776 a 6 a 7 3 92 , 160 a 6 2 a 7 3 + 61 , 440 a 6 a 7 4 16 , 384 a 7 5

( a 6 , a 8 )

4 a 6 2 + 64 a 6 3 + 8 a 6 a 8 176 a 6 2 a 8 + 5 a 8 2 + 16 a 6 a 8 2 + 24 a 8 3 + 432 a 6 a 8 3 + 72 a 8 4 144 a 8 5

( a 6 , a 9 )

4 a 6 2 + 48 a 6 3 + 240 a 6 4 + 256 a 6 5 8 a 6 a 9 + 144 a 6 2 a 9 + 960 a 6 3 a 9 + 1 , 280 a 6 4 a 9 + 5 a 9 2 + 72 a 6 a 9 2 + 288 a 6 2 a 9 2 + 2 , 560 a 6 3 a 9 2 24 a 9 3 1 , 344 a 6 a 9 3 + 2 , 560 a 6 2 a 9 3 + 384 a 9 4 + 1 , 280 a 6 a 9 4 + 256 a 9 5

( a 6 , a 10 )

a 6 2 32 a 6 3 + 256 a 6 4 + 6 a 6 a 10 168 a 6 2 a 10 + 1 , 536 a 6 3 a 10 + 5 a 10 2 88 a 6 a 10 2 + 2 , 624 a 6 2 a 10 2 48 a 10 3 + 1 , 344 a 6 a 10 3 + 384 a 10 4 384 a 10 5

( a 6 , a 11 )

4 , 025 a 6 4 + 16 a 6 5 20 , 700 a 6 2 a 11 + 124 , 512 a 6 3 a 11 960 a 6 4 a 11 + 2 , 875 a 11 2 13 , 000 a 6 a 11 2 + 705 , 888 a 6 2 a 11 2 + 23 , 040 a 6 3 a 11 2 99 , 936 a 11 3 + 546 , 048 a 6 a 11 3 276 , 480 a 6 2 a 11 3 + 1 , 327 , 104 a 11 4 + 1 , 658 , 880 a 6 a 11 4 3 , 981 , 312 a 11 5

( a 6 , a 12 )

9 a 6 4 + 144 a 6 5 72 a 6 2 a 12 + 1 , 440 a 6 3 a 12 2 , 880 a 6 4 a 12 + 25 a 12 2 184 a 6 a 12 2 + 5 , 472 a 6 2 a 12 2 + 23 , 040 a 6 3 a 12 2 1 , 632 a 12 3 6 , 912 a 6 a 12 3 92 , 160 a 6 2 a 12 3 + 36 , 864 a 12 4 + 184 , 320 a 6 a 12 4 147 , 456 a 12 5

( a 7 , a 8 )

80 a 7 2 + 512 a 7 3 + 480 a 7 a 8 4 , 512 a 7 2 a 8 + 9 , 360 a 7 a 8 2 3 , 240 a 8 3 + 3 , 888 a 7 a 8 3 1 , 215 a 8 4 486 a 8 5

( a 7 , a 9 )

2 , 480 a 7 2 + 14 , 592 a 7 3 + 6 , 912 a 7 4 + 8 , 192 a 7 5 14 , 880 a 7 a 9 + 139 , 392 a 7 2 a 9 + 129 , 024 a 7 3 a 9 + 30 , 720 a 7 4 a 9 + 378 , 000 a 7 a 9 2 + 505 , 440 a 7 2 a 9 2 + 46 , 080 a 7 3 a 9 2 + 100 , 440 a 9 3 147 , 744 a 7 a 9 3 + 34 , 560 a 7 2 a 9 3 27 , 945 a 9 4 + 12 , 960 a 7 a 9 4 + 1 , 944 a 9 5

( a 7 , a 10 )

25 a 7 2 320 a 7 3 + 1 , 024 a 7 4 + 300 a 7 a 10 2 , 010 a 7 2 a 10 + 9 , 216 a 7 3 a 10 + 17 , 460 a 7 a 10 2 + 22 , 320 a 7 2 a 10 2 8 , 100 a 10 3 + 9 , 288 a 7 a 10 3 3 , 645 a 10 4 486 a 10 5

( a 7 , a 11 )

4 , 655 a 7 4 + 16 a 7 5 134 , 064 a 7 2 a 11 + 241 , 812 a 7 3 a 11 720 a 7 4 a 11 + 1 , 034 , 208 a 7 a 11 2 + 2 , 320 , 650 a 7 2 a 11 2 + 12 , 960 a 7 3 a 11 2 1 , 994 , 544 a 11 3 + 1 , 787 , 508 a 7 a 11 3 116 , 640 a 7 2 a 11 3 2 , 735 , 937 a 11 4 + 524 , 880 a 7 a 11 4 944 , 784 a 11 5

( a 7 , a 12 )

5 a 7 4 + 32 a 7 5 240 a 7 2 a 12 + 1 , 836 a 7 3 a 12 480 a 7 4 a 12 + 4 , 320 a 7 a 12 2 + 29 , 322 a 7 2 a 12 2 + 2 , 880 a 7 3 a 12 2 19 , 440 a 12 3 + 8 , 316 a 7 a 12 3 8 , 640 a 7 2 a 12 3 23 , 085 a 12 4 + 12 , 960 a 7 a 12 4 7 , 776 a 12 5

( a 8 , a 9 )

3 a 8 3 + 9 a 8 5 + 10 a 8 2 a 9 + 11 a 8 a 9 2 + 4 a 9 3

( a 8 , a 10 )

6 a 8 4 + a 8 2 a 10 4 a 10 3

( a 8 , a 11 )

35 a 8 4 + 2 a 8 5 48 a 8 2 a 11 + 144 a 8 3 a 11 + 16 a 11 2 32 a 8 a 11 2 1 , 536 a 11 3

( a 8 , a 12 )

9 a 8 5 16 a 8 a 12 2 256 a 12 3

( a 9 , a 10 )

32 a 9 4 + 3 a 9 2 a 10 104 a 9 2 a 10 2 12 a 10 3 + 48 a 10 4 48 a 10 5

( a 9 , a 11 )

1 , 365 a 9 4 + 8 a 9 5 + 1 , 872 a 9 2 a 11 + 7 , 584 a 9 3 a 11 + 480 a 9 4 a 11 624 a 11 2 1 , 280 a 9 a 11 2 + 103 , 392 a 9 2 a 11 2 + 11 , 520 a 9 3 a 11 2 + 66 , 816 a 11 3 27 , 648 a 9 a 11 3 + 138 , 240 a 9 2 a 11 3 684 , 288 a 11 4 + 829 , 440 a 9 a 11 4 + 1 , 990 , 656 a 11 5

( a 9 , a 12 )

9 a 9 5 + 180 a 9 4 a 12 16 a 9 a 12 2 + 1 , 440 a 9 3 a 12 2 + 192 a 12 3 + 5 , 760 a 9 2 a 12 3 + 11 , 520 a 9 a 12 4 + 9 , 216 a 12 5

( a 10 , a 11 )

105 a 10 4 + 2 a 10 5 + 36 a 10 2 a 11 + 1 , 752 a 10 3 a 11 3 a 11 2 290 a 10 a 11 2 10 , 512 a 10 2 a 11 2 + 576 a 11 3 + 27 , 648 a 10 a 11 3 27 , 648 a 11 4

( a 10 , a 12 )

9 a 10 5 a 10 a 12 2 72 a 10 2 a 12 2 1 , 536 a 12 4

( a 11 , a 12 )

81 a 11 4 + 7 , 776 a 11 5 + 108 a 11 3 a 12 12 , 960 a 11 4 a 12 + 594 a 11 2 a 12 2 + 8 , 640 a 11 3 a 12 2 420 a 11 a 12 3 2 , 880 a 11 2 a 12 3 1 , 225 a 12 4 + 480 a 11 a 12 4 32 a 12 5

Proof We illustrate the proof for the first T ( x ( p ) , y ( p ) ) = 0 in Table 4. In Table 3 we consider m = 1 x 1 σ ( m ) σ ( x m ) and m = 1 x 1 m σ ( m ) σ ( x m ) with an odd prime x put by 2 q + 1 . As
m = 1 2 q σ ( m ) σ ( 2 q + 1 m ) = 1 3 ( 10 q 3 + 9 q 2 q ) , m = 1 2 q m σ ( m ) σ ( 2 q + 1 m ) = 1 6 ( 20 q 4 + 28 q 3 + 7 q 2 q ) ,
the polynomials
f 1 ( X ) = 10 X 3 + 9 X 2 X 3 a 1 ( 2 q + 1 ) , f 2 ( X ) = 20 X 4 + 28 X 3 + 7 X 2 X 6 a 2 ( 2 q + 1 )
have common zero, namely, X = q . We deduce that for each odd prime p ( = 2 q + 1 ),
| 10 9 1 3 a 1 0 0 0 0 10 9 1 3 a 1 0 0 0 0 10 9 1 3 a 1 0 0 0 0 10 9 1 3 a 1 20 28 7 1 6 a 2 0 0 0 20 28 7 1 6 a 2 0 0 0 20 28 7 1 6 a 2 | = 0

and this simplifies to give R ( f 1 , f 2 ) = 108 , 000 ( 3 a 1 3 + 6 a 1 4 + 5 a 1 2 a 2 + 12 a 1 a 2 2 20 a 2 3 ) = 0 , so we can find the irreducible polynomial T ( a 1 , a 2 ) = 3 a 1 3 + 6 a 1 4 + 5 a 1 2 a 2 + 12 a 1 a 2 2 20 a 2 3 = 0 . Other results in Table 4 can also be obtained by using the resultant. □

Remark 3.2 The plane curves T ( x , y ) = 0 in Corollary 3.1 all have zero-genus since x, y are polynomials of p, which leads to a morphism from the projective line P 1 to plane curves T ( x , y ) = 0 . Then it follows easily from the Riemann-Hurwitz theorem (e.g., see Corollary 1 on page 91 of [5]).

Example 3.3 We suggest Figure 1, Figure 2 and Figure 3 for results of Z i , j = T ( a i , a j ) and T ( a i , a j ) = 0 .
Figure 1
Figure 1

Z 1 , 2 and T ( a 1 , a 2 ) = 0 .

Figure 2
Figure 2

Z 1 , 3 and T ( a 1 , a 3 ) = 0 .

Figure 3
Figure 3

Z 1 , 4 and T ( a 1 , a 4 ) = 0 .

Declarations

Acknowledgements

Dedicated to Professor Hari M Srivastava.

This work was supported by the Kyungnam University Foundation Grant, 2013.

Authors’ Affiliations

(1)
National Institute for Mathematical Sciences, Doryong-dong, Yuseong-gu, Daejeon, 305-340, Republic of Korea
(2)
Department of Mathematics and Institute of Pure and Applied Mathematics, Chonbuk National University, Chonju, Chonbuk, 561-756, Republic of Korea
(3)
Division of Cultural Education, Kyungnam University, 7(Woryeong-dong) kyungnamdaehak-ro, Masanhappo-gu, Changwon-si, Gyeongsangnam-do, 631-701, Republic of Korea

References

  1. Huard JG, Ou ZM, Spearman BK, Williams KS: Elementary evaluation of certain convolution sums involving divisor functions. II. Number Theory for the Millennium 2002, 229–274.Google Scholar
  2. Lahiri DB:On Ramanujan’s function τ ( n ) and the divisor function σ ( n ) , I. Bull. Calcutta Math. Soc. 1946, 38: 193–206.MathSciNetGoogle Scholar
  3. Hahn H: Convolution sums of some functions on divisors. Rocky Mt. J. Math. 2007, 37: 1593–1622. 10.1216/rmjm/1194275937View ArticleGoogle Scholar
  4. Beardon AF: Sums of powers of integers. Am. Math. Mon. 1996, 103: 201–213. 10.2307/2975368MathSciNetView ArticleGoogle Scholar
  5. Rosen M Graduate Texts in Mathematics 210. In Number Theory in Function Fields. Springer, Berlin; 2002.View ArticleGoogle Scholar

Copyright

© Kim et al.; licensee Springer 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Advertisement