MATH 1200 - ASSIGNMENT 4

PAULOS HAILESELASSIE

2a)

lets assume that n is an odd integer, so by the definition of off numbers n = 2k+1 for all
integers k

we also know that 0 mod n means that there is no remainder when n is the divisor

another ting we should establish is that the the sum of consecutive integers from 1 to n-1
can be modelled as the following formula:

0.5n(n − 1)
= (1)
n

1
= (n − 1) (2)
2

by substitution of n = 2k+1 using the fact that n is odd

1
= ((2k + 1) − 1) (3)
2

1
= (2k) (4)
2

=k (5)

Since we established in the beginning that k is an integer and there is nothing being added to
k which would represent the remainder then we have shown that when n is odd the sum of pos-
itive consecutive integers from 1 to n-1 is congruent to 0 mod m which means a remainder of 0.

Date: March 30, 2023.

1
2 PAULOS HAILESELASSIE

so we have proved that the sum of positive consecutive integers from 1 to n-1 is congruent
to 0 mod n

2b)
if n is even then n = 2k for all integers k by the definition of even numbers

Also the summation from 1 to n-1 has a general formula of

1
(n − 1) (6)
2

in addition if the summation formula is congruent to 0 mod n then so you could represent
it as the summation formula divided by n and show that there is no remainder.
so using the fact that n is even then which refers to n = 2k or all integers k and by
substitution of n - 2k into the summation formula

1
2
− 1)
(n
(7)
n

1
2
(2k−1
(8)
2k

1
2
(2k− 1)
(9)
2k

so because this has a remainder that is not zero is an in then that means that the summation
of positive consecutive integers from 1 to n-1 is not congruent to 0 mod n when n is even.