We will prove the last two properties. For 3) consider all multiples
x
1 n, 2 n, . . . , k n, where k n x < (k + 1)n. That is k < k+1
n
and the conclusion follows. For 4) denote bxc = m and {x} = . jFrom the
mk
Division Algorithm and property 1) above it follows that m = n + r,
n
where
0 r n 1. We obtain 0 r + n 1 + < n, that is
r+
= 0 and
n
j x k m + j m k r + j m k r + j m k bxc
= = + = + = = .
n n n n n n n n
1
The following result is helpful in proving many relations involving the
floor function.
Theorem. Let p be an odd prime and let q be an integer that is not
divisible by p. If f : Z+ R is a function such that:
f (k)
i) is not an integer, k = 1, 2, . . . , p 1;
p
ii) f (k) + f (p k) is an integer divisible by p, k = 1, 2, . . . , p 1, then
p1 p1
X q qX p1
f (k) = f (k) . (1)
p p 2
k=1 k=1
It follows that
p1 p1
X q X q p1
f (k) f (k) =
p p 2
k=1 k=1
Remark. From the proof of our Theorem, it follows that the above
formula holds for any relatively prime integers p and q.
Application 2. The function f (x) = x3 also satisfies conditions i) and
ii), hence
p1
q (p 1)2 p2 p 1 (p 1)(p2 q pq 2)
X q
k3 = = . (4)
p p 4 2 4
k=1
q p(p 1) p 1
= ,
p 2 2
hence
p1
X
k 2q (p 1)(q 1)
(1) k = . (6)
p 2
k=1
Using now the identity bxc = 1 bxc, x R\Z, the last display takes
the form
p1 2
X
k k 1p
(1) = . (7)
p 2
k=1
Taking q = 1 gives
p1 4
X
kk (p 2)(p 1)(p + 1)
(1) = . (9)
p 2
k=1
sp
Application 5. For f (s) = , conditions i) and ii) in our Theorem are
p
also satisfied and for q = 1 we obtain
p1 p p1 p1
!
X k 1 X kp p 1 1 X p p(p 1)
= = 2 k ,
p2 p p 2 p 2
k=1 k=1 k=1
hence
p1 p p1
X k 1 X kp k
= . (10)
p2 2 p
k=1 k=1
Formula (10) shows that half of the sum of the quotients obtained when
k p k is divided by p (Fermats Little Theorem) is equal to the sum of the
quotients obtained when k p is divided by p2 , k = 1, 2, . . . , p 1.
Babes-Bolyai University
Faculty of Mathematics and Computer Science
Cluj-Napoca, Romania
e-mail: dandrica@math.ubbcluj.ro