HaertelRaymondD1967 Redacted

AN ABSTRACT OF THE THESIS OF
RAYMOND DELBERT HAERTEL for the M.S. in Mathematics

(Name) (Degree) (Major)
Date thesis is presented August 11, 1966
Title SUMMATION FORMULAS FOR THE GREATEST INTEGER
PART FUNCTION
Redacted for Privacy
Abstract approved
(Major-professor)
This thesis contains a collection of summation formulas for
the greatest integer part function. Proofs are supplied for original
results and for those formulas which are stated without proof in the
literature. References are given for formulas and proofs which
appear in the literature.
SUMMATION FORMULAS FOR THE GREATEST INTEGER
PART FUNCTION
by
RAYMOND DELBERT HAERTEL
A THESIS
submitted to
OREGON STATE UNIVERSITY
in partial fulfillment of
the requirements for the
degree of
MASTER OF SCIENCE
June 1967
APPROVED:
Associate Professor /of Mathematics

In Charge of Major
Chai roan of'Department of Mathematics

Dean of Graduate School
Date thesis is presented August 11, 1966

Typed by Carol Baker and Muriel Davis
ACKNOWLEDGEMENT
The author wishes to express his appreciation to Professor
Stalley for his assistance and encouragement.

TABLE OF CONTENTS
Chapter Page
I. INTRODUCTION 1
II. BASIC PROPERTIES 7
III. TABLE OF SUMMATION FORMULAS 12
IV. COMMENTS 45
V. PROOFS 64
BIBLIOGRAPHY 120
SUMMATION FORMULAS FOR THE GREATEST INTEGER
PART FUNCTION
CHATPER I
INTRODUCTION
This thesis is a collection of formulas for sums of values of
the greatest integer part function. The domain of this function is
the set of all real numbers and the value of this function corre-
sponding to a given real number is the largest integer less than or
equal to the given number. We denote the value of this function,

corresponding to the real number x, by [x] . Some authors
use E(x). Also [x] is called the greatest integer part of x.
This function appears in the literature as far back as the early
part of the Nineteenth Century. See (3, p. 3 -8). A brief history of
this function, along with a development of its basic theory and a dis-
cussion of the above two notations, appear in a thesis by Murray (20).
The formulas considered in this thesis are those which involve
the sum of the greatest integer part function alone and those which
involve the greatest integer part function in a simple connection with
other functions. Summation formulas not meeting this criteria may

be found in the thesis by Murray (20).
The purpose of this thesis is to provide a systematic organiza-
tion of these formulas, to provide proofs for those formulas which

2
are unproved in the literature, and to provide generalizations,

specializations, and analogues for these formulas.
The thesis by Murray (20) was a valuable aid in writing this
thesis. His thesis is a collection of all properties of the greatest

integer part function obtained by an extensive search of the literature.
This author has read and verified his findings which pertain to sum-
mation formulas. The author has also searched the literature for
results published since Murray's thesis was written.
Included in this thesis are some interesting classes of for-
mulas. The following formulas and most of their special cases

are symmetric in m and n: Formulas 1. 2, 2, 4, 9, 10, 11,
49, 52, and 53. The following formulas and their special cases
are reciprocity formulas: Formulas 49, 52, and 53. The following
formulas and their specializations give evaluations for sums:
Formulas 1, 3, 4. 14, 9 through 12, 15. 1, 15.3 through 15. 5,
16.1 through 16.3, 16.5, 17. 1, 17.4, 17.5, 17.8, 18, 19, 21, 22,
25 through 29, 31 through 42, 48, 56 through 60, 62, 63, 64.2,
64.3, 65, and 66. The latter set might be of particular interest
to some applied mathematicians.
It is apparent to this writer that more research in this area

would be useful as further generalizations, specializations, and
analogues seem likely. For example, some of the more general

formulas, namely Formulas 1, 3. 1, 4. 1, 4.3, 4.6, 4. 12, 9. 10,
3
and 11, indicate a definite pattern. These sums involve the ratio of
two integers m and n whose greatest common divisor is d.
In each instance, the formula: contains a term which vanishes when

d = 1. It seems reasonable to conjecture that analogous general
formulas may be obtained from Formulas 14, 48, 49, 50, and 57.
In the process of writing this thesis, the author has found

several results which he has not been able to find in the literature.
These are Formulas 1, 3, 3. 1, 4, 4. 3, 4. 4, 4. 6, 4. 8, 4. 9, 4. 10,
4. 11, 4. 12, 4.14, 4. 15, 32, 33, 37, 38, 40, 42, 44, 46, 47, 48,
48. 1, 49, 49. 1, 53; Lemmas 4. 1, 4. 2, 4. 3, 18. 1, 18. 2 ; and
Properties 7 and 8. In addition several new special cases of
known results are included. The lemmas are of independent interest,
but they are not listed together since they are not summation
formulas.
Chapter II contains the basic properties of the greatest integer
part function which are used in the thesis. A more extensive list of
these properties may be found in many elementary number theory
texts. A good reference for this purpose is (21).
Chapter III is a table of summation formulas of the greatest
integer part function, The formulas are organized so that related

formulas are listed together. If a formula is the nth special case
of another formula in the table, then its number consists of the
number of the more general formula followed by a period and the

4
number n. For example, if 4 is the number of a general for-
mula having a number of special cases, then 4. 1 and 4. 2 would
be the numbers of the first and second special case of Formula 4.
There are three exceptions to this numbering system. These

are Formulas 4. 12, 4. 13, and 24. 2. Although these formulas
are not strictly speaking special cases, they are, however, direct
consequences of the general formula, and are closely related to
neighboring formulas.
An attempt was made to keep the notation used in the table
uniform. As a matter of convenience, the notation was in some

cases changed in the proofs.
Chapter IV lists pertinent comments regarding the formulas
in Chapter III. These comments are listed so that the number of
the comment is the same as the number of the corresponding for-
mula from Chapter III.

If the formula is not original with the author, the source is
given. On the other hand, if a source is not given, the formula is
original with the author. The sources given are not necessarily the
original sources, but are simply those which are accessible.
If the formula follows from, or is a special case of, some
other formula from Chapter III, it is also indicated in the comments.
If the formula has a relatively simple alternate proof from that
given in its source, then that proof is given in the comments. The
5
reader is referred to Chapter V for non -trivial original proofs.

Chapter V contains the non -trivial proofs of those formulas
which are original with the author or are stated without proof in
the literature. These proofs are listed with the number of the cor-
responding formula from Chapter III. This ordering sometimes
requires that a formula be proved by using a formula which is
proved later in Chapter V.
Throughout the remainder of this thesis the letters m and

n will denote positive integers.
The following notation from number theory will be used:
(m, n) denotes the greatest common divisor of m and n.
m n denotes the statement "m divides n. "
T(n) denotes the number of positive integers which divide

the integer n.
(1)(n) denotes the number of positive integers less than or

equal to and relatively prime to the integer n.
o(n) denotes the sum of the positive integral divisors of

the integer n.
µ(n) denotes a function of n which is equal to 1 if
n - 1, 0 if n is a positive integer which contains

6
a square factor greater than 1, and ( -1)k if n
is a product of k distinct prime factors.
unless otherwise stated will denote Euler's constant
n
y = lim ( 7 1- log n) .
n 00
i=1
7
CHAPTER II
BASIC PROPERTIES
Listed below are basic properties of the greatest integer part

function that are used in the thesis. Properties 1, 2, 3, and 4 are
proved by Niven and Zuckerman (21, p. 85 -86). Properties 5 and 6
are not readily available in the literature and so these properties

along with Properties 7 and 8, which are new results with the author,
are accompanied with proofs.
Property 1. If x is a real number, then
x -1 < [x] <x< [x]+ 1.
Property 2. If n is an integer and x is a real number, then
[ x+n] _ [ x] +n .
Property 3. If n is an integer and x is a real number, then
[ [x]] =[x]
if x is an integer,
[ x] +[ -x
otherwise .
8
Property 5. If m and n are positive integers, then
1, if ni m,
[m m-1
] [ ] _
n n
0, otherwise .
The special case of this formula where n is a prime number
is stated without proof by Niven and Zuckerman (21, p. 87). We
prove this property as follows.

m m
Suppose that nl m. Since [ ] = , then
n n
[m] <m-1 <m

n
-1
- n n = [m]
n
[mn-1,
Hence, = [n -1 and so
[ñ] -[ nl] = 1
Suppose now that n X m. Let m = pn +q, where p and
q are positive integers with 0 < q < n -1. Then by Property 2, we
have
[rni-1] [pnñq-1
_
]
_= p+[gl
] = p
But p = [m] . Hence,
[n] [
ñ-1] =0,
which completes the proof.

9
Property 6. If n is a positive integer, then
, if n is a perfect square
[N.n] -[Nin.--1] -
0, otherwise.
This property and the following proof are due to Murray (20,
p. 47 -48),
The difference between the square roots of two consecutive
positive integers is less than 1, since
1
1p +1 - Np - <
tip 1 + tip
1
if p is a positive integer.
If n is a perfect square, let [ "Tn] _ "Tn = p. Since
\/n -1 < Tn, it follows that [ ^/n- 1 ] = p-1. Hence
[vñl - [in -1] = 1 .
If n is not a perfect square, let "In -1 = p +h where p
is an integer and 0 < h < 1. Then ^./n = p +k where 0 < k < 1,
for if k > 1, then n -1 < (p +1)2 < n, a contradiction. Also, if

k = 1, then n is a perfect square, another contradiction. Hence,
[fn] - [ NÍn- 1 ] = p and
[N/n] - [i/n -1] = 0,

10
which was to be proved.
if 21[x] ,
[2]
i
2'
if 2,1/ [x] .
Proof. By Property 1, we have
[x] -1 < [x] < x < [x] +l ,
and so
[x] -1
2
<<-
<
2
<
x
2
<[x]+1
2
Therefore,
21
if 21 [ x] .
Property 7 now follows immediately.

11
if 21[x] ,
2
Lx +1
if 2,r [ x] .
2 '
Proof. From the definition of [x] , we have
[x] -1 < [x] < x < [x] +1,
[x] < [x] +1 <x +1 < [x] +2 ,
and so
[x] +1 x+1 <Lx]-+l

2 2 - 2 2
.
Therefore,
if 21 [x]
[x +2 1
[x] +1
if 2% [x] ,
2 '

12
CHAPTER III
TABLE OF SUMMATION FORMULAS
1. If m, n, and r are positive integers such that

(m, n) = d and 1 < r < In, then
n-r
i
n ] i (m-1)(n-2r+1)+ á (d-1)-[(r-1)ñ ] .
i=r
1.1 If m, n, and r are positive integers such that

(m, n) = 1 and 1 < r < i n, then
n-r
i
n ] = z (m-1)(n-2r+1) .
i=r
1. 2 If m and n are positive integers and

(m, n) = d, then
n-1
i
n ] = z (m-1)(n-1) + i (d-1).
i=1
13
1. 3 If m and n are positive integers with

(m, n) = 1, then
n-1
iñn ] = i (m-1)(n-1)
i=1
2. If m and n are positive integers with

(m, n) = 1, then
n-1 m-1
i- m
] .
i=1 i=1
3. If m, n and q are positive integers with

(m, n) = d, then
air-12] _ [clan ] - q
i=1 n
3. 1. If m and n are positive integers with

(m, n) = d, then
n-1
- d(n (n-1).
( [ 1
n ] + [
n ] ) [ 1) ] -
i=1
14
4. If m, n and r are positive integers with

(m, n) = d, then
111
=[m] ] [r] +[d]
i=1
4. 1. If m, n and r are positive integers with

(m, n) = 1, then
[n ] [ T
m
i-]
n 1-17r; - [ r ] [ r ] + [ +rr
1.
]
i.1 i=1

(m, n) = d, then
m
[Z ] r2 ]
i-n
T71
] + 1 m ] _ [
2"2-1
] +
L
]
i=1 i=1
4. 3. If m, n, a, and r are positive integers such that

r > 2, m=n °a (mod r), and 0 < a < r, and if
(m, n) = d, then
n-a m-a
r r
(m-a)(n-a)
/[ t ] + [ im
m
r
2
[ d
i=1 i=1
15
4. 4 If m, n, and r are positive integers such that

r > 2 and m= n ° 1 (mod r), and if (m, n) = d,
then
n-1 m-1
r r
i=1
Y,
-
[1m
n 1 +
i=1
,
[i m
n
]
(m-1)(r-1)+ [d
r
2 r
4. 5. If m, n, and r are positive integers such that

r > 2 and m= n = 1 (mod r), and if (m, n) = 1
then
n-1 m-1
r r
(m-1)(n-1)
y[1 n ] + [1 m] - r
2
i=1 i=1
4. 6. If m and n are positive odd integers with

(m, n) = d, then
n-1 m-1
2 2
+ [l m ] = (m-1)(n-1) + 1(d-1).
i=1 i=1
16
4.7. If m and n are positive odd integers with

(m, n) = 1, then
n-1 m-1
2
CL)
[1ñ]
n
[i m ]= 4 (m-1)(n-1).
i=1 i=1
4. 8. If m, n, and r are positive integers such that

r (m, n), then
n m
['n] }
i]-
n
-
mn
r
+rd .
i=1 i=1

(m, n) = d, then
n m
d d
m mn
[ i
n ] im] +1 .
d
i=1 i=1
4. 10. If m and n are positive even integers such that

(m, n) = d, then
n m
[
i=1
2
m
n
2
i=1
n
im ]
mn
+ Z
d
Z
.
17
4.11. If m and n are positive integers with

(m, n) = d, then
m
n
+ [i-
m
] =mn+d.
L,
i=1 i=1
4.12. If m and n are positive integers with

(rn, n) = d, then
n-1 m-1
[i n
] +
,
[i m ] = (m-1)(n-1) + d-1 .
i=1 i=1

(m, n) = 1 , then
n-1 m-1
i
m _ (m- 1)(n -1)
] +
m ]
.
[ n L,
i=1 i=1
4. 14. If m and n are positive odd integers, then

mn-1
2
i (n-1)(mn-m+2)
8
i=1
18
4.15. If m and n are positive odd integers with

(m, n) = d, then
n-1
2 m
r
n
i
Zm]
= zm(n-1) + 1(d-1).
i=1 i=1

(m, n) = 1, then
n-1
2 m
2im] n
n iZm] =zrn(n-1).
i=1 i=1
4. 17. If m and n are positive odd integers such that

(m, n) = 1, then
n-1
2 m-1
2im]
[ +
i 2m
] = Z(m-1)(n-1) .
i=1 i=1
5. If m and n are positive odd integers such that

(m, n) = 1, then
n-1
2 m-1
2im] n
[ i
n 2m ]
i=1 i=1
19
6. Let p, q, and r be positive odd integers such that
(p, q, r) = 1. If x, y, and z are real numbers such that

1< x< and such that x = E y =
P z, then
q r
p -1 q -1 r -1
2 2 2
[i P ] [ip]
h
+ [iq] [ia ] + [ip [i"]
r
i=1 i=1 i=1
(2) (9 ) (r21)
7. Assuming the hypothesis of Formula 6, then

p-1 q-1 ir
2 [ p ]
[P] 2 q [q]
i=LLL1
i=1
{
j=1
[ ] +
j=1
] } +LLL
i=1
{
j=1
[ r
+
j=1
[
P ]
rZl
[] [l ]
(p
+ { [
P ) + [
q ] }
21
2
) 2 )(-2-)
r 1
i=1 j=1 j=1
8. Assuming the hypothesis of Formula 6, then
rX
[
P ] [
P
]
i=1
[gr]
i=1
[] = [
p ] [p ]
20
9. If m and n are positive integers such that

(m, n) = d, then
n-1
i-3
M1i[iñ +n ) i[im]
m-1
i=1
mn-1
+ [
i=1
m
rn][rxi
= mn(m-1)(n-1) + -1).
9. 1. If m and n are positive integers such that

(m, n) = 1, then
n-1 m-1 mn-1

i-]
n
+ n [n1]tñ]
n1 n
i-1 i=1 i=1
= mn(m-1)(n-1) .
10. If m and n are positive integers with

(nn, n) - d, then
n-1 m-1
m- i[i n:1 -
nn E n 12 (n-1)(m--1)(8rr7n-m-n-1)
i=1 i= 1
+ (d- 1)(6mn -d -1).

12
21
10. 1. If m and n are positive integers such that

(m, n) = 1, then
- :n - .
-
ï'l.
C rn n
;,. ) i[i ] +n)' =
1
12
(m-1)(n-1)(8mn-m-n-1).
i=1 i=1
11. If m and n are positive integers such that

(m, n) _ cì, then
mn-1
i
m ]
[ n ]
= 12 (m-1)(n-1)(4mn+m+n.+1)+-12(d -1).
i=1
11.1. If m and n are positive integers such that

(m, n) = 1, then
mn-1
1
[m ] [ n ]
= 12 (m-1)(n--1)(4mn+m+n+1).
i:=1
12. If x is a positive irrational number and n is a
positive integer, then
n [nx]
2- [ ix] + [ 1 ] = n[nx].
i i_./ x
i=1 i-1
22
13. If x is a positive irrational number and n is a
positive integer, then
n [ nx]
[1
) [ix] =
x
] + [ nx] + n[ nx] .
i=1 i=1
14. If m, n, and r are positive integers such that

(m, n) = 1, then
rm
r [n ]
[lm] rm +[ n]
[1 n ] +
_ r[ n ] n
i=1 i=1
15. If A. is the jth element in a sequence of numbers

J
and n is a positive integer, then
n 21-1 2n-1 n
A. A. .
J J
i=1 j=1 j=1 i=1+[ log2j]
15. 1. If n is a positive integer, then
2n -1
[ log i] = 2n(n -2) + 2.
iLLi
2
i=1
23
2n -1
([log 2i] 2 + [log 2i] ) = n(n+1)2n--(n-1)2n+2-4.
i=1
15.3. If n is a positive integer, then
2n-1
) [log 2i] 2 = 2n(n2-4n+6) - 6.
i=1
2n -1
i[log 2i] = (2n-1)(n 2n-1+1) (22n-1).
- 3
i=1
2n-1
(2i- 1)[log 2i] _ (3n- 4)(2n- 13)2 +4(2n -1) -3n
iLL1
i=1
24
. th
16. If A. is the J element in a sequence of numbers
J
and a, r, and n are positive integers, with r < n and

a < n, then
n [r]
A. A.
i=a j=a j=a i=rj
16. 1. If a, r, and n are positive integers with r < n
and a < n, then
n [r ]
[-r ] + ir = [ ] (n+1) -a ( a -1) .
i=a illl= a
16. 2. If r and n are positive integers with r < n
and m = [-n ] , then
\
n
[r
i
]
mn(n+1)
2 +
rm(m+1)(3-2rm-r)
12
i=1
16.3. If r and n are positive integers with r < n
and [
= m, then
n
2i-1)[r] = rm(m+1) + m(n 2 -1) - r2m(m+61)(2m+1)
6
i=1
25
and [r1 = m, then
m(m+1)(3n+3-2rm-r)
[=] r
+1) - m
3
i=1
and [n] = m, then
n
i] 2 m(m+1)( 6n -4rm+r+6)
m(n+1).
L r 6
i=1

and if a and n are positive integers, then
[a\Ti] [Krn] n
n
i=1 j=1
/i AJ
L
j=1 i=ja
/ Aj.
17. 1. If a and n are positive integers, then
n
[ N]
[ + y id=[a'<[-n](n+l).
i=1 ï =1
26
17. 2. If n is a positive integer and [ Tn] = m, then
n
LJ[i] -
m(6n-2m2-3m+5)
6
i=1
17. 3. If n is a positive integer and [ Win] = m, then
n
i] i]= m(n+1) -
m(m+1)
2
4
2
i=1
17.4. are positive integers and a

If a and n [ [n] = rn,
then
n m
2 i] + ia(ia-1) = mn(n+l).
i=1 i=1
a
17. 5. If a and n are positive integers and [ <rn] = rn,
then
n m
) 2i-1)[i] + ia(ia-2) = m(n2-1).
i=1 i=1
27
a
17.6. If a and n are positive integers and [ aKin] = m,
then
n m
ia+1
[áÎi] ([áÎi] +1) + 2 m(m+1)(n+1) .
i=1 i=1
17.7. If a and n are positive integers and [ ^n] = in,
then
n m
i] _ 2i- 1)(n -la +1) .
i=1 i=1
17. 8. If a and n are positive integers and [áÎn] =m,

then
n m m
ia+l a
[áÎi] 2 = m2(n+1) - + )-- i .
/....,
i=1 i=1 i=1
17. 9. If n is a positive integer and [ßÎn] = m, then
n
2 2(n+1) m(m+1)(3m2+m-1)
i - m2(n+1) _
-
6
i=1
28
18. If n is a positive integer and [fin +21 ] = m,
then
n
1
-
m(3n-m2+1)
3
i=1
19. If x is a positive real number, m is an integer
such that m > 2, and S is the set of all positive integers
not divisible by nm where n is an integer not less than
2, then
[ X i] = [ x] .
ieS
20. If m and n are positive integers and x is a
real number, then
1/n 1/m
[ ( m) ] _ [( n ) ]
i> 1 1 j> 1 j
a
21. If a and n are positive integers and [ 2n] = m,
then
n
i=1
[ ] = rnn+ Z[ m2+1]
+[ z ]
-2
1
m
i=1
i
a
29
21. 1. If n is a positive integer and [4-211 = m, then
n
[m] m(m+1)(2m+1)
[ 2i = mn+1[m2+1] 2 12
i=1
3
21. 2 If n is a positive integer and [ 27] = m, then
n
/
i=1
[342T] mn+ 1[m+1]
2 2
+[m]
2
(m+1)2m2
8
22. If a and n are positive integers and

a
[ 2 n -1 ] = m, then
n m
a 1 [m+1] a
[ 2i-1] = mn + Z i .
2 [ 2 ] 21
i=1 i=1
22.1. If n is a positive integer and [ ß/2n -1] = m,
then
n
/H 2i-1]
i///=1
= mn + ? [
m+1
2 ]
m(m+1)(2m+1)
12
i=1
30
3
22.2. If n is a positive integer and [ 2n -1] = m,
then
n
[3 2i-1] = mn + Z[
m+1 m2(rn+1)2
8
i=1
23. If d, h, n, and p are positive integers such that

d < p, h < p-d, and 'Jip -(d +h) is not an integer for
n 2+d
1 < i < then
[n2+d]
n P
[i 2 + ip-(d+h)] =
n+d
2
p P
i=1 i=1
24. If a, n, and p are positive integers such that

a
aq-
ip is not an integer for 1 < i <
- [nP ] then
a
r;--]
a
[ = n[ ]
P +
i=1 i=1
24. 1. If p is a prime number and a is a positive integer,
then
p-1 [ (p-1)a]
a p a
i (13p1)
] + [a47131 = (13-1)[
P
i=1 i=1
31
24. 2. If p is a prime number, then
p -1 2 p -1
i =1
Lp ] + i =1
[NriT31 = (p-1)2
24. 3. If p is a prime number such that p °- 3 (mod 4),
then
P-1 p-3
2 4
_ (P-1)(8 P-3)
P 1+ i=1
[Nri-p-]
8
i=1
24. 4. If p is a prime number such that p= 1 (mod 4),
then
p-1 .L-5
2 4
/
i=1
[
P
] +
i=1
Lip] _ (P-1)(P-5)
8
25. If p is a prime number such that p s 1 (mod 4),
then
p-1
(p-1)(2p-1)
[471 - 3
i=1
32
26. If p is a prime number such that p= 1 (mod 4),
then
p-1
4
i=1
DN/TI-Di
_ 12 '
27. If p is a prime number such that p= 1 (mod 4),
then
p-1
2
Sc[ (p-1)3p-2)
P
- 3
.
i=1
28. If p is a prime number such that p = 1 (mod 4),
then
p-1
2 2
i (13-1)(P-5)
p 24
i=1
29. If p is a prime number, then
p -1 p -1
/
j=1 i=1
p = ()2 (P-2) .
33
30. If p is a prime number such that p > 2, then
p-1 _1
p-1 2 p-1 [2 ]
/
j=1 i=1
;r-i±j
j=1
/ [Pj]
i=1
= (L)3
2
31. If n is a positive integer and x is a real number,
then
n-1
\ i
) [ x + ] = [nx] .
i=0

then
n-1
[x -ñn ] = [nx] - (n -1).
i=0
then
n-1
.,([x+1] - [x - ] ) = n-1.
i=0
34
34. If n is a positive even integer and x is a real
number, then
n1
2
,[x+ nl =[Z] - [x]

i =1
number, then
n -1
[x
2
2i =[2] n
n ] - [ x] -
2 -1).
i=1
number, then
[x + 2i-1] _ [nx] - [nx]

n - 2
i=1

number, then
n
2
2i -1 n
x -
n ] _ [ nx]
-
r
2 ]
2
i=1
35
number, then
Z-i
l[x+ry--] -[x -
nl ] ) =
2
- 1.
i=1
39. If n is a positive odd integer and x is a real
number, then
n-1 , if 2I([nx]-[x]),
2
).,- ñi] [ nx]2 - [x]
[ x +
2
+
i=1
1
2'
otherwise.

number, then
n-1 , if 2,1' ([nx] -[nñ-1]),
[
2
2i] -1]
X - -n
n 2 n
-n +
i=1
, otherwise .
number, then
n-1
[ nx] -[x]
2 if 21 ( [ nx] - [ x] ) ,
2 '
2i-13
) [x+
i=1 [ nx] -[ x] -1
2
otherwise.
36

number, then
n-1 0, if 21 ([nx] -[x] ,

2
[x
iLLL=1
2i 1
-
[nx] -[x] -(n-1)
=1
i 1
otherwise.
43. If n is a positive odd integer, then
n+l n+1
2 2
2
n+2i-1 n+2i-1
(2i-1)[ L. [ 2(2i-1)
-
i=1 i=1
44. If n is a positive integer, then
n+1 n+1
n+i n+i 2
(2i-1)[2i-1] _ [2i-1]
i=1 i=1
n
(2i-1)[ ] _
i=1 i=1
37
n n-1
n
(2i-1)[i ] (2i-1)[-12f.-1-1 = 2cr(n) -T(n).
i=1 i=1
n-1
n-1
/["] 2 - [
i
2 =
20- (n) - T(n).
i=1
48. If m, n, and s are positive odd integers with

(m, n) = 1, then
n-1
i=1
i
m
n
s
+ -2-1
-
(n-1)(m+s-1)
2

(m, n) = 1, then
n-1
i ñ
is
+ Z
= 2 m(n-1) .
1=1
38
49. If m, n, and s are positive integers with

(m, n) = 1, then
n-1 m-1
[i -n
n
+ + im Z ] =(m-1)(n-1)+ 2 (m+n-2).
iLL..=1
i=1 i=1

(m, n) = 1, then
n-1 m-1
[iñ ñm + 2]+
1
[im+z] =mn-mZn
i=1 i=1
50. If m and n are positive odd integers with

(m, n) = 1, then
n-1 n-1
2 2
m 1
(m-1)(n-1).
n +2
s-
in - 2n -I = 4
i=1 i=1

(m, n) = 1, then
n-1 n-1
2 2
n-1 .m
[ (i+ 2
)m
n ) - +2 -2n ] = 4(m-1)(n-1) .
i=1 i=1
39
(m, n) = 1, then
n-1
[
m-1
2 2
1--
m
n
-2
1
i--+-
.m
[ n
1
2
.
i=1 i=1

(m, n) = 1, then
n-1 m-1
2 2
i -
m
n
m
2n
n
im-2m]
n
i=1 i=1
54. If a, d, n and p are positive integers such that

ai +d is not an integer for and
p > d+1, 1 < i < n,
p - -
an+d ]
h r then
p
n
ai+d
P
\ [pi-(d+1)
G
h
a
_nh.
i=1 i=1
55. If a, d, n, and p are positive integers, and h
and q are positive integers defined by the equation

(n +l)a +d = (h +l)p +q, where q < p, then
h
ai+d ` [pi+q1
p L a
i=1 í =0
40
56. If n is a positive integer and (2) is a binomial
coefficient, then
-
L i
)111(igli-11 = 1.
i-1
[ Nrn] n
2 [] - T(i)=[Nrn]2.
í=1 i1
Nn-1]
',;-1
2 ( -,i - i ] - T(n)-[rn] + [ rii-TL] .
i-1
41
n
([n] - [nil] ) = T(n).
i=1
[Nrn] n
[n] - [Nrn] 2 .
i=1 i = [ Nrn] +1
62. If n is a positive integer and y is Euler's
constant, then
n
n
[ ] = n(log n
e
+ 2y-1) + O(Nrn).
i=1
63. If y is Euler's constant, then
oo
[ log2 i] = y
i =1
42
64. If n is a positive integer and a is a real number,
a > 1, and m = [ an] , then

n(m+1), if a is an integer,
n
m`
[a ] + ) [ loga i] _
i=1 i=1
mn, otherwise.
64. 1. If n is a positive integer, e is the base of the
natural logarithms, and m = [en] , then
n m
[ el] log i] = mn.
e
i=1 i=1
64. 2. If n is a positive integer and m = 10n, then
m
0i [ log10 i] = n(m+l).
i=1 i=1
64. 3. If n is a positive integer and m.= 2n, then
n m
[ log2 i] = n(2n +1).
i=1 i=1
43
oo
n
La
[-+ 1
2
] = n.
21
i=1
r'31}
3i n2+2n+4
2 [ 12
i=0
67. If a and n are positive integers, then
n [áin/J
a
la[ a i .
i=1 j=1 i=1
n [2] [n2+i
n n 2 n
1 }
= 2 { [2i-1 }
+ [2i-1
i=1 i=1 i=1
44
69. If n is a positive integer and x is a positive real
number, then
[ x] n [n ]
[X] -n[]
i =1 i =1 i=1
70. Let Jk(n) be the number of different ordered sets
of k positive integers less than or equal to n whose
greatest common divisor is relatively prime to n. Then
n n
[.a} Jk(1) ik
=
i=1 i=1
70, 1, If n is a positive integer, then
n
d, (n) = i
[i]
i=1 i=1
45
CHAPTER IV
COMMENTS
1. This formula is proved in Chapter V.
1 . 1. This formula is stated without proof by Jacobsthal
(10, p. 154). It is the special case of Formula 1 where d _ 1 .
1. 2. This formula is proved by Hacks (7, p. 205). It is the
special case of Formula 1 where r = 1.
1. 3. This formula is proved by Uspensky and Heaslett

(32, p. 97). It is the special case of Formula 1.2 where
d = 1.
2. This formula is proved by Stern (29, p. 9). It follows
immediately from Formula 1.3.
3. 1. This formula is the special case of Formula 3 where

q = n -1.
4. 1. This formula is proved by Jacobsthal (10, p. 156).

It is the special case of Formula 4 where d = 1.
46
special case of Formula 4 where r = 2.
4. 3. This formula is proved as follows. Since r > 2,
m = a (mod r), n = a(mod r), and 0 < a < r, then

m m a n -a
[-r and [I J = . The formula now follows
r r r
immediately from Formula 4.
4. 4. This formula is the special case of Formula 4. 3
where a = 1.
special case of Formula 4. 4 where d = 1.
where r = 2.
4. 7. This formula is proved by Niven and Zuckerman
(21, p. 68). It is the special case of Formula 4.6 where

d = 1. Many proofs of the quadratic reciprocity law involve
this formula where m and n are distinct odd prime

numbers.
4. 8. This formula follows immediately from Formula 4.
4. 9 This formula is the special case of Formula 4. 8 where

r = d.
47
4.10. This formula is the special case of Formula 4.8

where r = 2.
4. 11. This formula is the special case of Formula 4.8

where r = 1.
4.12. This formula is proved as follows. If from both sides

of Formula 4. 11 the quantity m+n is subtracted, Formula
4.12 follows. It also follows immediately from Formula 1. 2.
4.13. This formula is stated without proof by Mordell (18, p.
593). It is the special case of Formula 4.12 where d = 1.
It also follows immediately from Formula 1.3.
4. 14. This formula is proved as follows. We set m = qn
in Formula 4. 6, noting that (qn, n) = n, to obtain

n -1 can -1
2 2
iq + [19 = 4 (qn-1)(n-1) + á (n-1).

g
i=1 i 1
Hence
qn -1
2
g +1
[I ] = 4 (qn +1)(n -1) -
Z
(11- )(n21 )
i=1
(n-1)(8n-g+2)
(n81 )(2qn+2-q(n+1)) _
We now replace q with m and the formula is proved.

48
4.15. This formula is proved as follows. Let q and n
be positive odd integers with (q, n) = d. We set r = 2
and m = 2q in Formula 4, noting that (2q, n) = d, to
obtain
Zg ] =qZ] +[J
i=1
Since d and n are odd, then [-2] -

n21
2
and
d21
-
[-2]
2
Hence, we have
n-1
2
i 2 ] = i q(n-1) + á (d-1) .
i=1 i=1
We now replace q with m and the formula is proved.
where d = 1.
4. 17. This formula is proved by Stern (30, p. 337). It
follows immediately from Formula 4. 16.
5. This formula is proved by Stern (30, p. 338).
6. This formula is proved by Busche (2, p. 124).

49
9. This formula is proved by Rademacher (24, p. 228).
9.1. This formula is proved by Rademacher (24, p. 221).

12. This formula is proved by Gauss (3, p. 3 -8).
13. This formula is proved by Jacobsthal (10, p. 154).

It follows immediately from Formula 12 by Property 4.
14. This formula is proved by Jacobsthal (10, p. 155).
15. This formula is stated without proof by Gould (4, p. 277).
It is proved in Chapter V. Gould states the formula in terms

of a rectangular array of numbers, but he uses only one
column. Hence, we have stated the formula in terms of the
50
column used, which we call a sequence.

We indicate how the special cases are obtained from
this formula, but the manipulation required is straight forward
and is therefore not included.

A.-=1.
J
15. 2 This formula is the special case of Formula 15 where

A - 1.
J

A. = 2i -1. It may also be obtained from Formulas 15.1 and
15.2.
15.4 This formula is the special case of Formula 15 where

A.=j.

A. = 2j -1. It may also be obtained from Formulas 15.1 and
15.4.
16. This formula is stated without proof by Gould (4, p.277).

column. Hence, we have stated the formulas in terms of the
51

16.1. This formula is the special case of Formula 16 where

A. = 1.
J
16. This formula is the special case of Formula 16 where

A. =ï and a =1.
J

A. = 2i -1 and a = 1. It may also be obtained from
J
Formulas 16.1 and 16.2.

A. =j and a -1.
=

A. = 2j -1 and a = 1. It may also be obtained from
J
Formulas 16.1 and 16.4.
17. This formula is stated without proof by Gould (4,p. 276).

column. Hence, we have stated the formula in terms of the
52
17.1. This formula is stated without proof by Gould (4, p.276).

It is the special case of Formula 17 where A. = 1.
17. 2. This formula is stated without proof by Gould (4,p. 275).

It is the special case of Formula 17.1 where a = 2.
17.3. This formula is stated without proof by Gould (4,p. 275).


A =i.
J

A. = 21 -1. It may also be obtained from Formulas 17.1 and
17.4.

Aj=j.
]
17.7. This formula is stated without proof by Gould (4,p. 277).

It is the special case of Formula 17 where A. = 2j -1. It may
also be obtained from Formulas 17. 1 and 17.6.

53
17. 8. This formula is stated without proof by Gould (4,p. 277).
It follows immediately from Formula 17.7.
17. 9. This formula is stated without proof by Gould (4, p. 277).
18. This formula is stated without proof by Murray (20,p.

17). He writes that it is stated without proof by Moser (19).
However, this reference is incorrect and the author is unable
to locate the formula elsewhere. This formula is proved in
Chapter V.
19. This formula is proved by Vinogradov (33, p. 140).
20. This formula is proved by Gupta (5, p. 703 -704).
21. This formula is proved by Hacks (8, p. 52).
special case of Formula 21 where a = 2.
21. 2 This formula is the special case of Formula 21
where a = 3.

special case of Formula 22 where a = 2.
54
a = 3.
23. This formula is proved by Zeller (34, p. 253).
24.1. This formula is proved by Hacks (8, p. 35 -36). It is
the special case of Formula 24 where p is a prime number
and n = p -1. To see that the hypothesis of Formula 24 is
satisfied, we must show that MT, is not an integer for
(p-1 )a
1 1, then (p -1)a < pa and so (p -1) < p -1.
p
Hence, we have
(p-1)a <pa-1
1 _
and so tifirs is not an integer.
24. 2. This formula is proved by Hacks (8, p. 38). We
expand his proof as follows.
Consider the special case of Formula 24.1 where

a = 2.
p-1 p-2
(1) L, [
p ] +
[Nilp] = (p-1)(p-2)
i=1 i=1
55
We note that
1 <p ,
-2p+1 < -p < 0 ,
p2-2p+1 < p2-p < p2 ,
and hence
p-1 < Jp(p-1) < p .
Therefore
(2) [N/p(p-1)] =13-1 .
We now add the quantity [ p] to both sides of (1),
and by (2) Formula 24. 2 follows.
special case of Formula 24 where p is a prime number
such that p - 3 (mod 4),

( ),
}, n - P-1 and a = 2.
To see that the hypothesis of Formula 24 is satisfied,
we note that p = 4k +3, where k is a positive integer.
Hence
56
p
na
1
(p-1)2
4p - [
(4k+2)2
16k+121 - 16k2+16k+4
16k+12
_
4k+4
[k+16k--j.21 == k -
p-3
1
Since P-3 < p, then Nri.5 is not an integer for

4
p-3
1
-< i -< (-na1
p _
4 '

p21
p is a prime number such that p= 1 (mod 4), n - ,
and a = 2.
In order to see that the hypothesis of Formula 24 is
satisfied, we note that p = 4k +1, where k is a positive
integer. Hence
[(P-1)2 4k2 k
p 4p ]
[(4k)2
16k+4 4k+1 1=Lk- 4k+1 1
p-5
= k-1 =
4
P45
Since < p, then '/ip is not an integer for
p
-<i<<ná1
5
1
- p = 4

57
29. This formula is proved by Hacks (7, p. 206 -207). We

give an alternate proof.
We have
p-1 p-1 p-1 p-1 p-1
j=1 1=1
p
[11-3i
i=1
.1
p
i=1
ip ] + +
i=1
[ i
P ]
By Formula 1. 3, we have
p-1 p-1
/
j=1 i=1
[li.]
p
= 0 + (p-1)+ 2(p-1)+
2 2
. . . + (P-2)(13-1)
2
= (P21)(1 +2 +3+ ... + (p -2)) =

(221)2(p
-2) ,
30. This formula is proved by Hacks (7, p. 206 -207).
We give an alternate proof.

We have
2-1 p-1 -1 p-1
p-1 2 2 2 2
1
i ] + i ] + + [ i . ]
[ p ] _ p [ P
j=1 i=1 n- 1 i=1 i=1
58
and
[2] []
p-1
j=1
[2
i=1
[pf]
[z]
i-i
J
i=1
[ip] + +
i=
i _P_-]
p-1
,
Hence,
p-1 p-1
p-1 2 P-1
[2l 2 ['
(1)
[ p ] + L[p3l _ ( [ lp] 1
+ [iJ)
j=1 i=1 j=1 i=1 i=1 i=1
p-1 p-1
2 [z ]
2 2
]
i
2
-]
p
[ip])+..+ [i
P ] [ip J )
i=1 i=1 i=1 i=1
We note that 1 = [2 ] . Thus by Formula 4. 2, equation
(1) becomes
p-1 p-1
2 p-1 2
(2) L _ (P1) LJ+ z

+()[p1J
j=1 i=1
P ] +
j=1
Z._,
i=1
[p
) l
] 2 (13-1) [11+ .
. .
z
p-1
- (p21 ) I.- J
i=1
By Formula 16. 1 , where a = 1, r = 2, and

n = p-1, (p > 2), we have
59
p-1 2
(3) /
i=1
=[p21 p-
i=1
2i -
p 1
) p- ( i )( )
(p -1)2
2
Therefore by equations (2) and (3), we have Formula 30.
31. This formula is stated without proof by Niven and
Zuckerman (21, p. 90). It is proved by Murray (20, p. 51 -53).
33. This formula follows immediately from Formulas

31 and 32.
34. This formula is stated without proof by Stern (28,p. 94).
It is proved in Chapter V.
36. This formula is stated without proof by Stern (28, p. 93).
38. This formula follows immediately from Formulas 34
and 35.
60


44. This formula follows immediately from Formula 43

if we set n = 2m +1 and then replace m with n.
45. This formula is stated without proof by Uspensky
and Heaslett (32, p. 98). It is proved in Chapter V.
s = 1.
49. This formula follows immediately from Formula 48.

61

s = 1.
50. This formula is proved by Stern (30, p. 337 -342).
51. This formula is proved by Stern (30, p. 337-342).
52. This formula is stated without proof by Kronecker
(14, p. 347). It is proved in Chapter V.
56. This formula is proved by Perez -Cacho (22, p. 37 -39).
57. This formula is proved by Meissel (16, p. 301).
58. This formula is proved by Uspensky and Heaslett
(32, p. 99).
59. This formula is stated without proof by Stewart

(31, p. 55). It is proved in Chapter V.
60. This formula is proved by Stewart (31, p. 55). It
follows immediately from Property 5.

62
62. This formula is proved by Hardy and Wright (9, p. 262).
63. This formula is proved by Sandham (27, p. 116 -117).
64. This formula is proved by Murray (20, p. 49 -51).
64. 1. This formula is stated without proof by Hacks (8,p. 23).

It is the special case of Formula 64 where a = e.
64. 2. This formula is stated without proof by Hacks (8,p. 23).

It is the special case of Formula 64 where a = 10.
a = 2. We give an alternate proof. By Formula 15.1 ,
2n-1
/
i=1
[log2 i] = 2n(n-2) + 2 .
Thus
n
2
[ log2 i] = 2n(n- 2) + 2 + n
i=l
2n -2n +1 +1
n + 2 + n = n(2n +1)- (2n
We note that 2n +1 2 =
/
i=1
21. Formula 64.3 now follows
immediately.
63
65. This formula is proved by Mendelsohn (17, p. 49 -50).

66. This formula is proved by Kingston (13, p. 185).
69. This formula is proved by Pexider (23, p. 46).
70. This formula is stated by Murray (20). He states

that it is proved by Dirichlet (15, p. 78). However, this
reference is incorrect and the author is unable to locate
the formula elsewhere.
70. 1. This formula is proved by Dirichlet (15, p. 78).
It is the special case of Formula 70 where k = 1.

64
CHAPTER V
PROOFS
1, If m, n, and r are positive integers such that

(m, n) = d and 1 < r < In,
i then
n-r
i=r
[ i n = i (n1-1)(n-2r+1) + 1(d-1) - [
d(r-1) ]
Proof. By Formula 1. 2, we have
n-r n-1 r-1 n-1

(1)
mij m
--j n1
[ La] i
n
i
n
- [ i
n
]
i=r i=1 i=1 i=n-r+1
1 n-1
m
= Dm-1)(n-1) + i ( d- 1) - [ i2-11
n
- i-
n
],
i=1 i=n-r+1
Since
n- r-1
_1 m
[
; -
//
[ (n-i) n
J ,
i=n-r+1 i=1
then by Property 2 we may write (1) as

65
n-r r-1 r-1

(2) ) [ im] = 1(m-1)(n-1) + 1(d-1) - i -r11-]
n
- [ (n-i) n
m
]
i=1 i=1 i=1
r-1 r-1
z(m-1)(n-1) m] -i-]
= + 1(d-1) - ) [ i
n
i=1 i=1
r-1 r-1
= 1(m-1)(n-1) + 1(d-1) - 1-n
. m
imn ])
i=1 i=1
r-1
= 1(m-1)(n-1) + 1(d-1) - m(r-1) - ([ im]+[-im]).
n n
i=1
By formula 3,
r-1
( [ i m] + [ -i m ]) _ [ d(r-1) - (r-1) .
i=1
Thus we have
n-r
[ i
n ] = z(m-1)(n-1)+ 1(d-1)-m(r-1)+(r-1)-[d(ñ-1)]
i=r
Dm-1)(n-2r+1) d(n-1)
= + 1(d-1) - [ ] ,

66
3. If m, n, and q are positive integers with

(m, n) = d, then
LLLLi
([i]+ [-i])=[ág]
n n n
-q.
i=1
Proof. By Property 4, we have
, if i -
m
n
is an integer
[im]+[-im]
n n
=
-1, otherwise.
We now determine the number of values of i, 1 <i< q,

m
for which i
n
is an integer. Let m = ad and n = bd.
m a
Then i = i
b
. Since (a,b) = 1, then i bab is an integer
is an integer.
iff
b
Since 1 < i < q, then b <
b -< bb .
a dq
Hence i
n = i is an integer for [ ] = [ ] values
b
of i.
We now have that

dq
, for [
n
] values of i,
M
[ 1
n
] + [ -i m
n
] =
dq
- 1 , for q - [ ] values of i.
n
Therefore,
67
q
2j( [ i n + [ °i n )_ [ añ
n
] - q ,
i=1
4. First we prove three lemmas.
Lemma 4. 1. Let m, n, and r be positive integers
with m < n and let a and ß be defined by the following:
n
(1)
r
= [ nr ] + a ,
where 0<a< 1 ;
(2) [r , n = [[r ß,
where 0 < ß < 1. Then
[Lai
[[n]mi=
r n r -[ß +ma
n
].
Proof. We use equations (1) and (2) and Property 2
to write the following:

68
r =[n'
[m] r n
_
r n r n +7
[([n]+a)m]=[[n]mman
=[[[T] ñ]+ß+ ña]= [[rlñ] +[ß+ ña].
Hence,
[[r] ñ]=[r]-[ß+ña],
Lemma 4. 2. If m, n and r are positive integers

with m < n, then
[[n]m]=[m]-Y,
r n r
where Y E {0, 1} .
Proof. Let a and ß be defined as in Lemma 4. 1.
Since 0 < m < n and 0 < a < 1, we have that

ma m
Since
-
0 <
n
<
n
< 1 . 0 < ß < 1 , then it follows that
0 < 13 <13 +ma
+ < 2. Hence [p+ Tria] is either 0 or 1.
n n
By Lemma 4. 1,
Ern-]-n2]
r n =
r
+ñ n
=[ m ] Y
.r
69
where ye {0, 1 }, which was to be proved.
Lemma 4. 3. If m, n, and r are positive integers

with ni < n, and
[Lar ]'111-]=[11-1}
n
-1,
then
[ [ r ] m] {:J
Proof. Let a and p be defined as in Lemma 4. 1.
Then we have by our hypothesis and by Lemma 4. 1 that
[ p+ na] = 1.
Hence, ma Since
m
and
1 < p +
- n
< 2. 0 < a < 1, we
n
have further that

mCL
n
<-m
n
. It follows, then, that
p< 1
-<p+ma
n
<p+-112:
n
,
-<--<-
0 < 1 - p
ma m
,
n n
and so
0<(1-p)-2-m < a < .

m -
1
70
Therefore
[ (1 -(3)m ] = 0.
By Property 2, we have that
[r] [r] = +[(1 -ß)m] = [[r] +(1 -ß)m]

n nß
(2) _ [ [ n]
r +
m -
m ].
Recall that ß is defined by
m m]
P = [r] n - [ [
r]
Equation (2) may now be written as
[
r ]
_ [ [
r] + m - 11- ( [ r ]
n
- [ [ r ]
n ] ) ]
=[[r]+m-[]+
m r m [[r] 171 n ]]
(3) =[(1+[[r] ñ])rn

n
]. ])m.
Since by our hypothesis m n m

[ ] = 1 + [ [ ] J, equation
r r n
(3) becomes
[ r]
r
_ [ [ m]
r m ]

71
Now we state and prove Formula 4,
If (m, n) = d and r is a positive integer, then

[m]
[ r]
m n
L-/
[ i
m = [m ][x] +[
i=1 i=1
Proof. Suppose m = n. Then m = d = n since

(m, n) = d. Thus we have
[r] [m] [m]

m] n
i
n
z = [
r
12-1. ([ m
r ] + 1)
=1 =1 i=1
= [m] [Mr ] +
[112r
=
[Ln-r
+ [a]
r ,
and so the theorem is true. Therefore, since the formula is

symmetrical in m and n, we suppose with no loss in
generality that m < n.
Now we consider the sum
Cri]
m
(1)
n ] = [Lai] +
n
[ 2
n ] + [3 n ] + . + [ [r]
r n]
=1
Let k = [ [
r] n
] . Suppose that s is an integer such that
1 < s < k. We define JG as follows.
( 2) j = min {j ; [ j
n ] = s) .
72
We may now write (1) as
[T ] j-1 j3-1 jk [r]

) [
m
= 0+1+ 2 + . . . + (k-1) +
1_¡¡Jk
k
i=1 i<i<j 1-j i=j 2 r=jk-1 1-ik
= 1(j2-j1) + 2(j3-j2)+... +(k-1)(jk-j.k_1)
+ k([11; ] + 1 - jk)
- j - - jk + k([ + 1)
= -j 1
- 3 r]
ck
(3) =- ) js+k([T]+1).
s
s=1
m
By definition ( 2), we have (j -1) m
n -
< s < j
s n
,
s
which is equivalent to j -1 < s

s
nm -< j s , Therefore,
j
s'
if s-mn is an integer,
n
(4) [ s°] _
m
j
s
-1, otherwise
Solving (4) for s' we have
[ sm ] , if s
m
is an integer,
(5) j
s =
[ s°mn ] + 1, otherwise ,
We now determine the number of values of s for

73
n
which s
m
is an integer. Let m = ad and n = bd.
Then (a, b) = 1 and s -

n
m
= s
b
-a- .
a
Since (a, b) = 1, then
s
s
a is an integer iff is an integer. Since 1
-< s -< k,
s k s k
we have 1
a -a -a
< < . Hence
a
is an integer for [
a
]
values of s. Using this result and (5), we may write
k k
(6) js
L
s=1
s
=
s=
([sm ] + 1) -[] a
.
We obtain a simplification of [ a ] By Property 3,
[ i[x]] _ [ - x ], where x is real and c is an integer.

n m
Recall that k = [ [
r
]
n
] . Then
k n m
[
a = [1k]
a = [ 1a [ [
r n
] ] _ [1[21E1-1
a r n _ {1[1-1-]!-]
a r b
[b[ r] bd [d].
] _ [b r ] - [b r ] _ r
Equation (6) now becomes
k_
d]
(7) J _
\_k
) ([sm]
m + 1) - [
r
s=1 s=1
Using equation (7), we may write (3) as

74
k
i
n ] _ - j ( [ sm ] + 1) - [5-1] + ka-a] + 1)
i=1 s=1
k
s
n
m ] - k + [
d
r
] + k[ nr ] + k
s=1
_ -
L
m] + k[ r] [ a]
s=1
If we replace the dummy variable s in this equation with
i, we have
[n]
k
m
(8) [ 1-n ] = - im]
m
+ k[ r ] + [ d] .
i=1 i=1
According to Lemma 4.2, k= [ [r] n ] = 1-r ] -Y where

,
E {0, 11 . We proceed by considering the two values for Y
separately.
Suppose k = [ ] . Equation (8) then becomes
[n]
r [a]
i=1
i°m
n
] =
,
i=1
[1 m m[m][r]+[á].
r r r
Hence,
75
[m]
i-]
m
n
+ [m]
r [r]
r
+ [a]
r
,
i=1 i=1
Suppose now that k = [ m] - 1. Equation (8) becomes
[m] -1
i=1
im] _ 5
i=1
[ i
m ] + ( [ r r
] - 1 ) [ r ] + [ ar ]
[ -]
(9) i
m +[ [m]m]
m] r m + [m][11-]
r r - [n]
r + [á]
r .
i=1
n m m
Since k = [ [ -]
r ---]
n
= [
r ]
-- 1, then we have by
n r_]
Lemma 4.3 that [ [7-7 ]
r m ] _ [ . Equation (9) becomes
r
[n] [m]
r
m n I"I1 n d
7
n ] _ [
m ] + [ nr ] + [
r 7 [ nr ] - [
r ] + [
r ]
i=1 i=1
[m]
m]
_ - [ i 2-1-]
m + [ r
rnr ] + [
d
]
i=1
Hence,
[m]
[r]
m m....][n d
i
n
] +
¡ [i m]
m [
r r +
r
1=1 i=1
76
This completes the proof of the theorem.

J
and n is a positive integer, then
i 2n-1 n
A. = A. .
L L J J
i=1 j=1 j=1 i=1+[ log2 j]
Proof. Consider the sum
n 21-1 21-1 2? 1 23- 1 n ? 1
(1) )
jlL=1
A.
J
=
j=L.1
A.
J
+
j=1
A.
J
+
LLL
A.
J
... + A.
J
i=1 1 j=1 j=1 j=1 j=1
2n-11
-1 2n-1
A. + A.
+ J L J
j=1 j=1
2m- 1
Let A.
J
j=1
be the first sum of the right -hand side of equation (1) which
contains the element A. . Then 2m -1 < j' < 2m, and
hence, m- 1 < log2 j' < m. Thus [ log2 j' ] = m-1, and so
(2) m = [log2j'] + 1 .
77
Since A. occurs first in the mth sum of the

J
right -hand side of (1), and since it also occurs in all of the
succeeding sums, then it occurs n -m+1 times, or by
equation (2), it occurs n- [log2j' ] times.
2i)-1
= (n -[logt 1])A1 + (n -[logt 2])A2 + . .
A,
i.=1 j=1
. . _ + (n- [ log 2(2n- 2)])A2n_2+ (n- [ log 2(1)])A

1
n n n
= ) Al + A2 + . . . + 1 A2n-
A2n- 2
i=1+L[rlog2l] i=1LL+[1og22] i=1+[log2(2n-2)]
n
+ A2n-1
i=1+[log2(2 n- 1)]
) A.
j=1 i=1+[l.og2j]
th
and a, r, and n are positive integers, with r < n and
a < n, then
78
n [r] [ r n
A. _ A.
i=a j=a j=a i=rj
Proof. We note that if m is a positive integer

and r(a +m) < i < r(a +m +1), then [i] = a +m. If
s = (-] then
n [r] ra-1 [r] r(a+1}1 [r] r(a -1[1]

)
AJ
1 A.
+
)
A +
) A.
i=a j=a i=a j=a i=ra j=a i=r(a+1) j=a
i
rs-1 [r] n [ir ]
+ . . . +
L 1 Aj +
1 A.
i=r(s-1) j=a i=rs j=a
r(a+1)-1 a r(a+2)-1 a+1 r(a+3)-1 a+2

=
i=ra j=a
Lr Aj + 7
i=r(a+1) j=a
Ai +
i=r(a+2) j=a
; + . .
rs-1 s-1 n s
. . . + >
j=LLa
Aj
J
+ 1 1 Aj
J
i=r(s-1) j=a i=rs j=a
a a+ 1
_ (r(a+1)-ra) > A. + (r(a+2)-r(a+1)) > Aj+...

J
j'a j=a
s- 1
... + (rs-r(s-1)) A. + (n-rs+1) > A.
j=a
J [
j=a
J
79
= (r(a +l) -ra)Aa

+ (r(a+2)-r(a+1))Aa+(r(a+2)-r(a+1))Aa+1
+ (r(a+3)-r(a+2))Aa+(r(a+3)-r(a+2))Aa+1
+(r(a+3)-r(a+2))Aa+2
+ (rs-r(s-1))Aa+(rs-r(s-1))Aa+1+(rs-r(s-1))Aa+2
+ ... + (rs-r(s-MA
+ (n-rs+l)Aa+(n-rs+1)Aa+1+(n-rs+1)Aa+2
+ ... + (n-r s+ 1)As-1+(n- r s+ 1)As
= (n-ra+l)Aa+(n-r(a+l)+1)Aa+1+(n-r(a+2)+1)Aa+2
+ ... + (n-rs+l)A s
n n n
= Aa +
a+1
+ Aa+
a+ + . . . + I A
s
i==ra i=r(a+l) i=r(a+2) i=rs
A
j=a i==rj
n formula.
Since s = [ ], this completes the proof of the
r
80
17, If A, is the jth element in a sequence of numbers

J
and if a and n are positive integers, then
n [ [ 4rn] n
A. A .
i=1 j=1 i=1 i=ja
Proof. if m is a positive integer such that

m ai <(m+1)a,
< then
a
[NI] = m. We set s = [aÑn]
and note that sa < n < (s+ 1)a. Hence.,
2a_1
n i
Z[i] 1 [áfi] 3a-1 [a';[1] 4a-1 [ai]
Aj =
Z
) A.
J
+ Aj+ Aj+...
i=1 j=1 i=1 j=1 i= 2a j=1 i=3a j=1
sa-1 [ aÌi] r [ N
. . . + A. + A.
J
a
i=(s-1) j=1 i= s j=1
2a-1 1 3a-1 2 4a-1 3
) Aj+ Aj+ Ai +
a a
i=1a j=1 i=2 j=1 i=3 j=1
+
s -1 s-1
1Aj+1
L
n
/s
A.
i=(s-1)
L
j=1
L
j=1
i=s
a
= (2a-la)A1
81
+ (3a- 2a)A1 + (3d 2a)A2

(4a (4a ,4a
+ -3a)Á1 + a)Á2 + -3a)Á3
+ (sa- (s -1)a)A l + (sa -(s- l )a)A2 + (sa- (s- 1)a)A3

+ ... + (sa -(s- l )a)A s-1
+ (n- sa+ 1)A1 + (n- sa+1)A + (n- sa+ 1)A3 + . ..
. . . + (n-sa+l)As-1 + (n-sa+l)As
1
= (n-la+l)A1 + (n-2a+1)A2 + (n-3a+1)A3 + ...

. . . + (n- sa+ 1)A s
s n
a
n-j +1)A, = EA..
j=1 j=1 i=ja
a
Since s = [ ^/n] , the proof is complete.
18. First we prove two lemmas.
Lemma 18. 1. If n is a positive integer, then
[ '/n+ 1 + z] -1, if n is the product of two

consecutive integers,
['s/n+-] =
[ n +1 + Z] , otherwise.
82
Proof. Let p be the uniquely determined positive
integer such that
p< Nrn 1, then

Nñ 0 we
may assume that q> O. Hence n = q(q +1).
Since p < "In < p +l, then
p < q(g+1) < p+l,
and
p2 < q(g+1) < (p+1)2.
We now show that q = p.
Suppose that q < p. Then q+ 1 p. Then q+ 1> p+ 1 and q > p+1.
Thus q(q+1)> q(p +l) and q(p+1)> (p+l)2. Hence q(q +1) >(p +1)2,
another contradiction.
Therefore, p = q and n = p(p +l).
By equation (1), we have
(p+h)2 = n = p2+p<p2+p+ á = (p+ 1)2.
Therefore,
(p+h)2 < (p+1)2,
and hence
(3) h p p+ = (p+ á)
Therefore,
(p+j)2 > (p+ z )2,
and hence
(4)
We have by equations (1) and (3) and by Property 2
that
(5) [ in+ 2 ] = [p+h+ 2] = p+ [h+ Z ] = p.

84
We further have by equations (2) and (4) and by Property

2 that
(6) [ n+l + z] = [ p+ j+ ?] = + [ j +?] = p+1.
Hence, by equations (5) and (6)
[ fn +z] = [ n +1 +?] -1.
This completes the proof of Case I.
Case II. The natural number n is not the product

of two consecutive integers. Thus n p(p +l).
Suppose n < p(p +l) = p2 p .
Then
4)+1)2.
(p+j)2 = n +l<p2 +p <p2 +p +4 =
Hence
(p+j)2 < (13+1)2,
and so
j < z .
But h < j, since 'fn < "/n + l.
Thus
85
(7) 0 < h < j < ? .
By inequality (7) and Property 2, we have
[fn +2] = [p +h +i] = p +[h +Z] = p,
and also
Hin+l +Z] = [P+j+i] = P+ [i+-1] = P.
Therefore, if n < p(p +1), then
['fn+z] = [ n+1+Z].
Suppose now that n > p(p +l) = p 2 + p.
Since n is an integer, then
(P+h)2=n>p2+p+1> p2+p+á =(P+?)2.
Hence
(P +h)2 > (p +z)2,
and so
h > 1 z
But since J > h, then
(8) i < h < j < 1.

86
By inequality (8) and Property 2, we have
[ "fn+ ?] = [p +h +?] = p +[h +2] = p+ 1,
and also
[ n +1 + z] = [p +j+ Z] = p +[j +z] =p+ 1.
Therefore, if n > p(p+l), then
[ ^in + z] = [ ,) / n+1 + Z].
This completes the proof.
Lemma 18. 2. If n is a positive integer, then
(1) n = [ in+1 + z] 2 - [ r^nri + i]
iff n is the product of two consecutive integers.
Proof. It is clear that if n satisfies (1), then

n is the product of two consecutive integers since the right -
hand side of (1) may be written as
Hn+1 + z] ( [ n+1 + z] - 1).
Conversely, suppose n is the product of two con-
secutive integers p and p+1. Since n is positive,

we may assume that p is positive. Then n = p(p+ 1) and so
,
87
p < Nfn< n+1 .
Hence
n+1 = P2 + p + 1 < p2 + 2p + 1 = (p+1)2,
and so
n +1 P2+p+ á = (P+z)2
Hence, we have
(P+j)2 > (p+1)2,
and so
J > z
We now have by definition (2) that

88
(3) i< < 1.
Now if the right -hand side of (1) is written in factored

form, and we use (2), (3), and Property 2, then we have
[ n+1 + Z] (H/r171 + 1] -1) = [p +j +Z] ([p +j +1] -1)
= (P +[j +i])(p +[j +1] -1)
= (p +l)(p +l -1)
= (p +l)p
= n .
This completes the proof of the lemma.
Now we state and prove Formula 18. If n is a

positive integer and m = [ ^in. + i ] then
n
) [fit z] = m(
3n+1-m2 )
v
i=1
3
Proof, The proof is by induction. Assume the

theorem to be true for some natural number k. Then
k 2
3k+'_[rfk+ z]
(1) [N/i +4] _ [k-1-4] (3k+
3 )
i=1
89
Hence, we have for n = k +1,
k+1 2
(3k+13 [+fk+2]
(2) [NÌi+ 2] _ [Ñk+ ) + [ IN/77-1+1].
i=1
By Lemma 18. 1,
[^Íkt 1 + 2] -I, if k is the product of two

consecutive integers,
(3) [^/k+ -y]
4 =
[4k+1+ 2] , otherwise.
By Lemma 18. 2,
(4) [ k +1+ 2 - [Nk +1 +2] = k,
if k is the product of two consecutive integers.
Case I. The natural number k is the product of
two consecutive integers. If we let A = [ k +1 + 2] then
by equation (3) the sum (2) can be written as
k+1
[A+ 2] _ (A-I)(3k-13(A-1)2) + A
i=1
3kA-A3+3A2+A-3k
(5)
3
By equation 4, we may write equation (5) as

90
k+1
3kA-A3+3A2+A-3(A2-A)
[NR+ z] -
u 3
i=1
3kA +4A --A3

3
A(3k+4-A2
3
A(3(k+1)+1-A2)
=
3
2
k+l k+1+i]
_ [ + i] 3 )
Therefore, if k is the product of two consecutive integers

and the formula is true for n = k, then it is also true for
n =k +1.
Case II. The natural number k is not the product

of two consecutive integers. By equation (3)
[ k +1 + z] _ [N/1k + z] .
The sum (2) may then be written as
k+1
2
[N/k+l + Z] 1 3+1-[ k+1+ á] k+1+ z]
[Ni-i +1] _ (
3 ) + [
i=1
2
z] 3(k+l)+1-[N/k+l + z]
= [ k+1 + ( )
3
91
Therefore if k is not the product of two consecutive inte-

gers and the formula is true for n = k, then it is also
true for n = k +1. Since the formula is true when n = 1,
the proof is complete.

then
n-1
-
n
] _ [nx] - (n-1).
i=0
Proof. We use Property 2 to write
n-1 n-1 n-1

n- 1-i 1 i
[x ° ] [x+ñ+ñn -1]
i=0 i=0 i=0
n-1
([x+'°1
n
+ -ni ] -1)
i=0
n-1
i
(1) [(x+-)
n
1
+-n
n
] - n
i=0
Now by Formula 31 and Property 2, equation (1) becomes

92
n-1
--n ] = [nx+ 1 ] -n = [nx] +1 -n
i=0
= [nx] - (n -1),

number, then
n-1
2
[x+nl ]
_
[i-12)!] - [x].
i=1
Proof. Let x = m +a, where m is an integer

and 0 < a < 1. Then by Property 2, we have
'
2-1
i=1
[x +-]
2i
n
=
2-1
i=1
2i
[m+a+-
n
]
n-1
2
2i ]
)
i=1
n
2i
(1) = m(2 -1) + [a + n ]
i=1
93
Since 0 < a + ñl< 2, then [a+ nl ] = 0 or 1. We
note that if i = 0, then [a + ] = 0, and if i = Z,

nl
then [a + ?n
1 ] = [a+ 1] = 1. We define the integer j as
follows.
(2) j=max {i; [a+ ñl] = 0, 0<i< 2-1}.
We have by (2) that
2(j+1)
a +
n
< 1
-< a+ n
2j
n
< 1 -a -< 2(j+1)
n
---
and
j <(1-a)Z<j+l .
Therefore,
j +1, if (1 -a) 2 is an integer,

(3) [(1 -a) 2 ] _
j, otherwise.
Solving (3) for j, we have
n
[(1-0.)1i] -1, if (1-a)-2 is an integer,
(4) j =
[(1-a)112- ] , otherwise
Using definition (2), we may write (1) as

94
n-1
[x+nl] =m(2-1)+
i=1 i< j i=1
m( Z-1)
Z-1 -j
= +
= (-n -1)(m+ 1) - j.
By (4) and Properties 2 and 4, equation (5) becomes
n-1
2
[x+ n ] _ (2- 1)(m+ 1)
i= 1
] - 1, if (1-a) is an integer or, equiv-

alently, if n2 is an integer,
[(1 -a)Z ], otherwise,
= ( Z- 1)(m+ 1)
na is an
-1, if
2
integer,
n na
[ 2- 2
] otherwise,
_ (2 - 1)(m+ 1)
+ [- n2 -1, if nZ is an integer,
2
- [-2.2c-.11 , otherwise,
95
= (Z - 1)(m+ l)
- [lit-] -1, if nZ is an integer,

2
2 - [Bi] - 1, otherwise.
(6) _ (2- 1)m+ [12-2c-L-] .
By Property 2, equation (6) becomes
-1
2
[x+ n ] _ ( 2 -1)m + (x-m) ]
i=1
= 1)m + ] -
Zn
= -m
= [n2] -[x] ,

number, then
n-1
2
[x - Zl] =[nZ] -[x] -(2-1).

i=1
96
Proof. First we note that
n-1 n2 -1 n-1
2 2 2
2i n- 2i
n _ [x n ] = [(x-1) + ñl]
n .
i=1 i=1 i=1
Then we use Formula 34 and Property 2 to obtain
n-1
2
---n-] _ [n( 1) ] - [x_1]
Z
i=1
= [nZ - 2 ] - [x -1]
= [n2] - [x] - (2 -1),

number, then
n
2
1 x +
2i-1
n
= nx
[
2nx
i=1
Proof. By Formula 31,
n-1
(1) > [x +ñ] =[nx] -[x],
i=
97
and by Formula 34,
n-1
2
( 2) ) [ x + ñl ] _
[ n2
] - [x]
i=1
We have, then, by (1) and (2) that

n
2 n-1 n-1
2
2i. -1
[x +
n ] _ [x +
n
] - [ x +
n ]
i=1 i=1 i=1
= [nx] -[n2] .
This completes the proof of the forumla.

number, then
2i-1 nx n
- ] = [nx] - [ 2 - Z .
n
i=1
Proof. We note that

n n
2 2
2i-1
[x -
n+1-2i
[X _ ]
n ] _J n
i=1 i=1
n
2
[(x-1) + 2i-1 ]
.
n
i=1
98
By Formula 36 and Property 2, we have
2i
[x - 1 ] = [n(x -1)] - [1:(x-1)] _ [nx -n] -
[n2
-L)2:]
i=1
_ [nx] - n - [7] +
2
= [nx] - [ n2 ] - Z ,

number, then
n-1 0, if 2 I ([nx] - [x] ),
2
ñ-] [nx] - [x]
[x + =
2
i=1
Z, if 2 1/ ([nx] - [x] ).
Proof. Let x = m+ a, where m is an integer

and 0 < a < 1. By Property 2, we have
n-1 n-1 n-1
2 2 2
[x+ 2i]
_ [m+ 2i.]
_ (ni
+[a+2i])
, n n n
i=1 i=1 i=1
n-1
2
(1) m(n-1) +?i]
2
i=1
99
2i
Since 0 < i < 2, then 0 < < 1. Therefore,
0 < a +
21
< 2 and so [a +1--
i] = 0 or 1. We define the
n n
integer J as follows.
(2) j = max {i; [a + 21] = 0, 0 <

- i <- n-12 }.
n
We now consider the special case where

n-1
J
= 2 '
Equation (1) becomes

n -1
2
(3)
2i m(n-1) mn-m n[x] -[x]
[x + n ]
= 2 = 2 = 2
i=1
Since
n-1
by definition (2), then
-a+
0 <
n
< 1
n a + n-1 < n and n a < 1. Also, since 0 < a < 1, then

0 < n a, and so 0 < n a < 1. Therefore, by Property 2,
we have
[nx] = [n(m+a)] = [mn+na] = mn + [na] = mn = n[x] .
Hence equation (3) becomes

n-1
[nx] - [x]
[x +
- 2
i=1
We note that [nx] - [x] = m(n -1) and hence,
21 ([nx] - [x] ) since n -1 is even. Therefore, if

100
n -1
J - 2 , the theorem is valid.
n -1
Suppose, then, that 0 < j < . Then by definition
(2), we have
2(j+1)
a+ 2J
+
< 1< a+
n n
1
-
?J < 1 - a<- 20 +1
n n
and so
j <(1-a)Z<j+ 1.
Therefore
j+l, if (1-a) is an integer,

(4) [(1-a)-1--] =
J otherwise.
Solving (4) for j, we have
[(1-a)] -1, if (1-a) is an integer,

(5) j =
n
[(1 , otherwise.
Using definition (2), we may express (1) as

n-1 101
n-1
+-ni ] m(n-1) + 0 + 1
=
i=1 i<j i=j+1
m(n-1) n-1
(6) n 2 -J
By equation (5) and Properties 2 and 4, equation (6) becomes
n-1
2
[(1 -a)] -1, if (1 -a)Z is an integer,
[X+n2i m(n-1)+n-1
1 2 2
[(1 -ate], otherwise,
i=1
m(n-1) +n-1 -
t °
[
n
2
a
] - , if (1 -a)112 is an integer,
2 2
n
[
2-n2a
], otherwise,
n+1 na+1
[-2-----z--1, if (1 -a)2 is an integer
or, equivalently, if
m(n-1) n-1 na+1
2
n
2 2
is an integer,
n+1 na+ 1
], otherwise,
[-T. - 2
nl +[-n2+1
-
]-1, if
na+1
1 is an integer,
2 2
_m(n -1) n -1
- 2 2 n+1 _na+1
, otherwise,
th
2
n'2+l ] na+ 1
1 if 2
is an integer,
m(n-1) - 1 -
2
n¢2+1
otherwise,
102
-[n 2 1 1, if
n
2 1 is an integer,
m(n-1) 1 -
= 2
-[
na-1
1-j -1, 1
otherwise,
m(n-1) + [n Z 1]
_
m(-1) [n(xm)+1]
nx+ 1 mn
[ 2 ] 2 '
if m is even,
m (n - 1)
2
[a] 1 -mn
+ if m is odd,
2
[nx+1]
2
, if m is even,
(7) = - Z +
{ [nZ ]
[nZ
+ 2, if m is odd.
By Property 8,
if 21 [nx]
2 '
+1]
[nx] + 1
2
, otherwise,
and by Property 7,
[nx
2 2
103
Therefore, since m = [x] , then equation (7) becomes
[2.x
if 21 [nx] and 21[x] ,
2
n-1 [nx] +1
2 2
if 2/ [nx] and 21[x] ,
(8) x+-n
2i
]
[nx] +1
i=1 2
if 21 [nx] and 2t [x] ,
[ nx]
if 21' [nx] and 21 [x] .
2
We have the following implications:
The conditions 21 [nx] and 21[x] imply that 21 ([nx] -
the conditions 2t[nx] and 21[x] imply that 2f ([nx] 4x1);
the conditions 21 [nx] and 24'[x] imply that 24 ([nx] -[x] );
the conditions 24'[nx] and 24'[x] imply that 21 ([nx] -[x] ).
Hence equation (8) may be written as
n-1 [nx]
2 if 21 ([nx] - [x] ),
2
[x+ ñl]=-[2] +
i=1 [nx] + 1
, if 24' ([nx] - [x] ),
2
0 f 21 ([nx] - [x1),
[nx] - [x]
2
if 2}' ([nx] - [x] ).
This completes the proof of the forumla.

104

number, then
n-1 [nx-1]
2 0, if 2 X ([nx] -
n '
=
[nñ-1] n)
[x- 2n] i([nx] - - +
i
i=1 i otherwise
Proof. First we note that

n-1 n-1 n-1
2 2 2
2i n+1-2i n+1)+ 21
[x- ] [x- n ] = [( X- n n.
i=1 i=1 1=1
Therefore, by Formula 39 and Property 2, we have

n-1
2 0, if 2I ([nx -(n +l )] -[x -nñ 1] ),
[x-ñl]
n = z([nx-(n+1)] - [x-n+1
n ] )+
2, otherwise,
i=1
0, if 2I ([nx -(n+ 1)] 4x-n---+1] )

n
= z([nx] -(n+1)-[x-
-(n+ n] +1) +
i
otherwise,
0, if 2I ([nx] -[nn- 1] -n), or equiva-
= z([nx] _[nñ-1]-n) + lently, if 2X ([nx] - [nx-1] ) ,

n
, otherwise.
This completes the proof of the formula.

105
number, then
n -1 ( f.,Yl - [x]
, if 2I ([nx] -[x]),
21-1
[x+
n
[nx] -[x] -1, if 2/ ([nx] -[x] ).
LLLi
i=1 2
Proof. We have by Formula 31 that
n-1
(1) ) [x+ñn ] _ [nx] - [x] ,
i=1
and by Formula 39, we have that
n-1
2
, if 2I ([nx] -[x] ),
2i] [nx] -[x]
( 2) +
n 2
i=1 1, otherwise.
We have, then, by (1) and (2) that
n-1 n-1
2 n-1 2
(
i=1
[x+ 2i-1]
n
i=1
[x+ 1 ]
nn -
i=1
[x+ Z1
n
]
(0, if 21([nx] -[x] ),

2[nx] -2[x] -[nx] +[x]
1
= 2 Z, otherwise.
nx] -[x] ,
2
if 2I ([nx] -[x] ),
] -[x] - 1
2
, if 2/ ([nx] -[x] ),
106

number, then
n-1
\?' 2i-1 0, if 2/ ([nx] -[x] ),
[x - ] = [nx]- [x] -(n -1) +
2
i=1 1
2'
otherwise.
Proof. We note that

n-1 n-1 n-1
Z\_' 2 2
2i-1
[x- n ]_ _ [x-n21
n ] _ [(x-1)+ n ] .
i=1 i=1 i=1
Now by Formula 39 and Property 2, we have
n-1
2
0, if 2+([n(x-1)] -[x-1] ),
l Li-1 [n(x -1) ] -[x-1]
i=1
[x -
n ] 2
+
{ L 21 , otherwise,
0, if 21 ([nx] -[x] -(n-1)), or

equivalently, if 21 ([nx] -[x] ),
[nx] -[x] -(n -1)
- 2
1
2' otherwise.
107
n n 2
2i-1)[ i] = (i] .
iLLLLLL=1
i=1 i=1
Proof. The proof is by induction. Assume that the

formula is true for all positive integers less than some posi-
tive integer k. By Formulas 46 and 47, we have
k k-1
(1) (2i- 1)[k] - (2i - 1)[k l ]
iLLL=1
i=1
k-1
i=1 i=1
By the induction hypothesis,
k-1 k-1
k-1
=
i=1 i=1
Therefore, equation (1) is equivalent to
k k 2
y [k]
i=1
2i - 1 ) [ _
J
i=1
Hence, the formula is true when n =k. Since the formula
is true when n =1, the proof is complete.

108
-1
2i -1)[i] - ( 2i - 1)[?-i--1] = 2o- (n) - T(n).
i=1 i=1
Proof. We note that
-1)[i] [n-1]
2i - (2i- 1)
i=1 i=1
n-1
(1) (2i- 1)([] -[n-1 ) + 2n- 1.
i i
i=1
By Property 5, we have
1, if i n, I
[] -[nil] _
0, if i,I'n.
If {d1 = 1, d2, d3, ... , dT(n) n} is the set of positive

divisors of n, then (1) may be written as
109
n n-1 T(n)-1
-11
2i - - (2i- 1)1n
1
= (2di-1)+ 2n-1
i=1 i=1 i=1
T(n)-1
= 2 d. - (T(n)-1) +2n- 1
i=1
= 2(6 (n)-n) - (T(n)-1)+ 211- 1
= 2o- (n) - T(n),
which was to be shown.
2
2
n-1 = 2v (n) - T(n).
i=1 i=1
L
i=1
[41]
Proof. We note that
n-1
i=1
n-
i
, 2 ' i=1
([i]
2 -- 1
2
)+1
n-1
(1) [ni [nil])([ ii+[nill )+1.
i=1
110
n-1]
[n]
i 1.
=
0, if i lin.
If {d1 = 1, d2, d3, ... , dT(n) = n } is the set of positive

divisors of n, then (1) may be written as
n 2 n 1 2 T n) -1
n
(2)
[i
nil] _ ([d ]
[d.l])+1.
i=1 i=1 i=1 i i
Since
d is an integer and since -1< dl
< 0,
3.
then by Property 2 equation (2) becomes
i=1
[
n
1]
2
n-1
-[nll]
i=1
2
T(n)-1
i=1
([ á]
i
+[:1] +[ al])+
i
1
T(n)-1
(2á - 1)+ 1
i
i=1
T(n)-1
= 2 - (T(n) - 1) + 1
di
i=1
= 2(0- (n) - 1) - (T(n) - 1)+ 1
= 26 (n) - T(n).

111
48. If m, n, and s are positive odd integers with
(m, n) =1, then
n-1
m s (n- 1)(m+s-1)
=
1 n + 2 2
i=1
Proof. Since s -1 is even, then by Property 2
we have
n-1 n-1
m m s-1
[i ñ 2]
s 1
_ [1 n Z+ ]
i=1 i=1
n-1
- ([1nn + Z ] + )
i=1
n-1
ni s-1)
(1) i +
2
i=1
We now consider the sum
n-1 -1
m m
[(n-i) ñ
1
[i n
+ 2] _
n
+ 2
1
]
i=1 i=1
1
m
-i -
n
+
1
2 ]
i=1
n-1
(2) [ rn+1-i mn -2].
1
112
m
We note that i +
Z
is not an integer for
1 <i<n -1. To see this, suppose that i m
r
+ Z = k,
where k is an integer. Then 2im = (2k-11n, which is

a contradiction since n is odd. Hence, by Property 4,
we have that
[-( i
n + ) ] = -[i n +
Z
] - 1
for 1 <i<n - 1.
We use this result and Property 2 to write equation
(2) as
n-1 n-1
[i n + Z] _ (m+14-(i n +
2
)] )
i=1 i=1
n-1
(m+l)(n -1) - i -(n-1).
=
n +
Z
]
i=1
Hence,
n-1
m
2 i + ] = m(n- 1),
i=1
and so
i=1
i
m
n
+ ]
1
2
=
m(n- 1)
2
113
n-1
C`
i
m s
=
m(n-1) (n-1)(s-1)
+ 2 ]
n 2 2
i=1
(n- 1)(m +s -1)
2
52. If m and n are positive odd integers such that

(m, n) = 1, then
n-1 m-1
2 2
1 .711-
+
1
Z ]
_ i-+-].
m
n 1
2
i=1 i=1
Proof. Suppose m =n. Then m= l =n since

(m, n) = 1. Hence both sums are vacuous and the formula
is valid. Therefore, with no loss in generality we suppose

that rn < n.
n-
Suppose that 1 < i < l . Then we have
0< im 1< n-1 m+ -1_ mn-m+n

n + 2-( 2 n + 2 2n
mn-n+2n-m
2n
m-1 +1
2
--m
2n '
Since m < 2n < 2n+ m, then 0 < 2n - m < 2n, and so

114
0 < 1 -
2< 1. Hence because m is odd, we have
(1) 0<[iñ +2] < Z1
We define js (1 < s <

21 ) as follows:
min {j; [J m s)
1
(2) is = + 2 ] =
We have by (2) and (1) that
n-1 j -1 n-1
j2-1 3 2
2
i
rn 1
1 = 0 + 1 + 2 + + m-1
n 2
i=1 1<i< i= 1=
1-im-1
2
= 1(j2 -j1) + 2(j3 -j2) + ..
. . . + (
m-3
2 )(
m-1 n-1 +1-j
Jm-1 - Jm-3 2 )( m-1) 2
2 2 2
= -jl-i2-j3-... -im-1 -4-

(
2
+ 1)
m-1
2
(3)
m-1 n+1
- - s 2 2
s=1
is not an integer. To see this,

The number J
n +
suppose that j-- +

Z
= k, where k is an integer. Then
2jm = (2k- 1)n, which is a contradiction since n is odd.
115
1
Hence, by (2) we have (jss -1) js which
n +
2< s <
n + 2 '
is equivalent to j -1<21-(s-1) j It follows that

s z 2
[
m (s z) ] = j s -1 or, equivalently, that
(4) js = [m (s- Z)] + 1.
We have by (3) and (4) that

n-1 m-1
2
+-]
i-
m
n
1
2
= -
2
(S-2)] + 1) + (n-12--1-)(121-.1)
i=1 s=1
m-1
2
z 1)+( 212)
1
_ -
Z_, ( m (s- )] -(
s=1
m-1
2
(5) s
n n +(m-1)(n-1)
m 2m 4
s=
By Formula 50, we have

m-1 m-1
2 2
,
s
n 1
s
n n (m- 1)(n- 1)
- ] +
[ m + 2
=
- [ m - 2m 4
s=1 s=1
Hence (5) becomes
n-1 m-1
2 2
+1.1
im
n 2
= I. sn+1].
m 2
1= s=1
116
Since the index s in this formula is a dummy variable,
the proof of the formula is complete.

(m, n) =1, then
n-1 m-1
2 2
m m
n 2n ] [lm 2m]'
i=1 i=1

n-1 n-1
2 2
m
[l ñ
1
(1)
n +
2] [i-112'n
n
- 2n] =1(m-1)(n-1)
+ J
i=1 i=1
and also that

m-1 m-1
2 2
(2) -
[lm + 2 ] + [lm 2m ] - 4(m-1)(n-1).
i=1 i=1
By Formula 52,
m-1 n-1
2 2
LJ imn
+
1
= [ i-m +-
n
1
2
1.
i=1 i=1
Therefore, from equations (1) and (2), we obtain

117
n-1 m-1
`2
i m
n
- m]i-
2n
_
2
[
i -
n
m -
n
2m ]
,
i=1 i=1
H\571.]
2 ([ i] -[n 11 ] ) = T(n) - [Nin] +[ nÑ-1] .
i=1
[Nin] n
`
(1) 2
i=1
i [ ] - [^%n] 2 =
i=1
) T(i) ,
and also that
[ n-1 ] n-1
( 2) 2 [B]
i - Nn-11] 2 = T(i).
i!ll=1
i=1 i=1
From equations
(3) 2
[Nin
i=1
]
[] - 2
[
(1) and (2),
i=1
]
[-n±-1-] - [N[n]
we obtain
2+[ n-1] 2 = T(n)
118
(4) [] =
[fin] -1, if n is a perfect square,
[Ñn] , if n is not a perfe':t square.
We proceed by considering the two cases separately.
Case I. Let the integer n be a perfect square.

Hence by (4), [ n -1 ] = P[n] -1. Equation (3) now becomes
2
[Ñn]
i=1
[] -
[
2 [nil] -[.În]2+([n]-1)2T(n)
n-1]
i=1
['fn [Nrr-ITI]
2 [] - 2
n-1]
i
- 2[Ñn] +1 = T(n)
i=1 1=1
[NTri
2
-1
[li] - 2
[][nl] + 2[7;] -2[Nrn]
+1 = T(n)
i=1 i=1
[ n-1 ] [ nti-1]
2 [i] - 2 [ ni ] + 2[Nrn] - 2[Nrn] +1 = T(n)
i=1 i=1
[^Í -1]
2
([n] [n-1 T(n) - 1.
( 5) - =
i i
i=1
Since [qn -l] - [fin] _ -1, then equation (5) becomes

119
[]
z
i =1
([111 [ nil ]) = T(n) -[n] + [] ,
which was to be shown.
Case II. Suppose the integer n is not a perfect

square. Hence by (4), [Ï] _ [fin] . Equation (3) now
becomes
[1] [Nrn ]
2 [n] -2 [nl] -[`rn]2+[Nfil]2=T(n)
i=1 i=1
[ n-1]
z ([n] - [n-1 ]
) = T(n)
i=1
Since - [ [n ] + [ n -1 ] = 0, we have Formula 59. This

completes the proof.
120
BIBLIOGRAPHY
i(q-1)
1. Busche, E. Uber die Function
Y L qx ] Journal für die
x =1
Reine und Angewandte Mathematik 106: 65 -80. 1890.
2. Busche, E. Uber grosste Ganze. Journal für die Reine und

Angewandte Mathematik 103: 118 -125. 1888.
3. Gauss, Carl Friedrich. Carl Friedrich Gauss Werke. Vol. 2.

Göttingen, Königlichen Gesellschaft der Wissenschaften Zu
Gottingen, 1876. 526 p.
4. Gould, H. W.Generalization of a bracket function of L. Moser.

Canadian Mathematical Bulletin 6: 27 5-277. 1963.
5. Gupta, Roshan Lal. Problem 4390: Sums of greatest integer
functions. American Mathematical Monthly 58: 703 -704. 1951.
6. Hacks, Jacob. Einige Sätze über Summen von Divisoren. Acta
Mathematica 9: 177-181. 1887.
7. . Über Einige für Primzahlen charackteris-
tische Bezeihungen. Acta Mathematica 17: 205 -208. 1893.
8. . Uber Summen von grössten Ganzen. Acta
Mathematica 10: 1-52. 1887.
9. Hardy, G. H. and E. M. Wright. Theory of numbers. Oxford,

Clarendon Press, 1938. 403 p.
10. Jacobsthal, Ernst. Beitrage zur Zahlentheorie IV. Kongelige

Norske Videnskabers Selskab. Forhandlinger 22: 154 -156.
1949.
11. Über die grösste ganze Zahl I. Kongelige

.
Norske Videnskabers Selskab. Forhandlinger 30: 1-5. 1957.

12. Uber eine zahlentheoretische Summe.
.
Norske Videnskabers Selskab. Forhandlinger 30: 35-41. 1957.
13. Kingston, J. M. Problem E978: A '.emma used by Hansraj

Gupta. American Mathematical Monthly 59: 185. 19 52.
121
14. Kronecker, Leopold. Bemerkung über die von Gauss mit [x]
bezeichnete arithmetische Function einer reelen Grösse x.
Journal für die Reine und Angewandte Mathematik 106: 346-
348. 1890.
15. Lejeune - Dirichlet, P. G. Ueber die Bestimmung der mitteren

Werthe in der Zahlentheorie. Abhandlung der Königlichen
Akademie der Wissenschaften zu Berlin, 1849, p. 78 -81.
16. Meissel, E. E(x) and reversion of series. Journal für die
Reine und Angewandte Mathematik 48: 301 -306. 1854.
17. Mendelsohn,N. S. Problem 4346: Greatest integer function.
American Mathematical Monthly 58:49-50. 1951.
18. Mordell, L. J. The reciprocity formula for Dedikind sums.
The American Journal of Mathematics 73: 593 -594. 1951.
19. Moser, Leo. An introduction to the theory of numbers. A

report presented to the Canadian Mathematics Congress
Summer Seminar, University of Alberta, August, 1957.
20. Murray, Peter John. The greatest integer part function.
Master's thesis. Corvallis, Oregon State University, 1964.
67 numb. leaves.
21. Niven, Ivan and Herbert S. Zuckerman. An introduction to

the theory of numbers. 2d ed. New York, Wiley, 1966.
262 p.
22. Perez- Cacho, L. La funcion E(x) (Entero de x) en la teorie

de numeres. Revista Mathematica Hispano- Americana,
ser. 4, 12: 36 -40. 1952.
23. Pexider, J. Sur la fonction E(x) representant l'entier
V.
contenu dans x. Rendiconti del circolo Matematico di
Palermo 24: 46 -63. 1907.
24. Rademacher, Hans. Eine arithmetische Summen formel.
Monatshefte für Mathematik und Physik 39(2): 221 -228. 1932.
25. Zur Theorie der Modulfunktion. Journal
.
für die Reine und Angewandte Mathematik 167: 312 -336. 1932.
122
26. Sandham, H. F. Problem E 938: Euler' s constant. American

Mathematical Monthly 58: 341 -342. 1951.
27. . Problem 43 53 Euler' s constant. Ameri-
:
can Mathematical Monthly 58: 116 -117. 1951.
28. Stern, M. A. Sur un théoréme de M. Hermite relative á la

fonction E(x). Acta Mathematica 8: 93 -96. 1886.
29. . Zur Theorie der Function E(x). Journal

für die Reine und Angewandte Mathematik 102: 9-19. 1888.
30. . Zur Theorie der Function Ex. Journal
für die Reine und Angewandte Mathematik 106: 337 -345. 1890.
31. Stewart, Bonnie Madison. Theory of numbers. New York,
MacMillan, 1952. 261 p.
32. Uspensky, J. V. and M. A. Heaslett. Elementary number
theory. New York, McGraw -Hill, 1939. 480 p.
33. Vinogradov, I. M. Elements of number theory. New York,
Dover, 1954. 227 p.
34. Zeller, Chr. Ueber Summen von grössten Ganzen bei
arithmetische Reihen. Nachricten von der K. Gesselschaft
der Wissenschaften und der Georg- Augusts Universitat,
May 14, 1879, p. 243 -268.

HaertelRaymondD1967 Redacted

Uploaded by

Copyright:

Available Formats

You might also like

HaertelRaymondD1967 Redacted

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

HaertelRaymondD1967 Redacted

Uploaded by

Copyright:

Available Formats

AN ABSTRACT OF THE THESIS OF

RAYMOND DELBERT HAERTEL for the M.S. in Mathematics

This thesis contains a collection of summation formulas for

RAYMOND DELBERT HAERTEL

Redacted for Privacy

Associate Professor /of Mathematics

Redacted for Privacy

Chai roan of'Department of Mathematics

Redacted for Privacy

Date thesis is presented August 11, 1966

The author wishes to express his appreciation to Professor

Stalley for his assistance and encouragement.

II. BASIC PROPERTIES 7

III. TABLE OF SUMMATION FORMULAS 12

This thesis is a collection of formulas for sums of values of

the greatest integer part function. The domain of this function is

sponding to a given real number is the largest integer less than or

equal to the given number. We denote the value of this function,

use E(x). Also [x] is called the greatest integer part of x.

This function appears in the literature as far back as the early

part of the Nineteenth Century. See (3, p. 3 -8). A brief history of

involve the greatest integer part function in a simple connection with

other functions. Summation formulas not meeting this criteria may

The purpose of this thesis is to provide a systematic organiza-

tion of these formulas, to provide proofs for those formulas which

are unproved in the literature, and to provide generalizations,

thesis. His thesis is a collection of all properties of the greatest

mulas. The following formulas and most of their special cases

to some applied mathematicians.

It is apparent to this writer that more research in this area

analogues seem likely. For example, some of the more general

two integers m and n whose greatest common divisor is d.

In each instance, the formula: contains a term which vanishes when

In the process of writing this thesis, the author has found

48. 1, 49, 49. 1, 53; Lemmas 4. 1, 4. 2, 4. 3, 18. 1, 18. 2 ; and

Properties 7 and 8. In addition several new special cases of

known results are included. The lemmas are of independent interest,

integer part function, The formulas are organized so that related

number of the more general formula followed by a period and the

number n. For example, if 4 is the number of a general for-

mula having a number of special cases, then 4. 1 and 4. 2 would

be the numbers of the first and second special case of Formula 4.

There are three exceptions to this numbering system. These

uniform. As a matter of convenience, the notation was in some

mula from Chapter III.

reader is referred to Chapter V for non -trivial original proofs.

Throughout the remainder of this thesis the letters m and

(m, n) denotes the greatest common divisor of m and n.

m n denotes the statement "m divides n. "

T(n) denotes the number of positive integers which divide

(1)(n) denotes the number of positive integers less than or

o(n) denotes the sum of the positive integral divisors of

µ(n) denotes a function of n which is equal to 1 if

n - 1, 0 if n is a positive integer which contains

a square factor greater than 1, and ( -1)k if n

is a product of k distinct prime factors.

unless otherwise stated will denote Euler's constant

Listed below are basic properties of the greatest integer part

are not readily available in the literature and so these properties