1-

Prove that if d | m and a ≡ b (mod m), then a ≡ b (mod d).

Solution:
We are given that d | m, meaning that m = d · k for some integer k. Also,
a ≡ b (mod m) implies:

a−b=m·n for some integer n.

Since m = d · k, we have:
a − b = d · k · n.
Thus, a − b is divisible by d, which implies:

a ≡ b (mod d).

Hence, the statement is proved.

2-
True or false? a ≡ b (mod m) implies a2 ≡ b2 (mod m2 ).
Solution:
This statement is false.
Counterexample:
Consider a = 1, b = 4, and m = 3.
• Here, a ≡ b (mod 3), because 1 ≡ 4 (mod 3).

• However, a2 = 1 and b2 = 16.

• We observe that 1 ̸≡ 16 (mod 9).
This counterexample shows that a ≡ b (mod m) does not imply a2 ≡ b2
(mod m2 ).

3-
(a) What can a square be, modulo 9?
Solution:
Let’s compute the square of each number modulo 9:

02 ≡ 0 (mod 9),
12 ≡ 1 (mod 9),
2
2 ≡4 (mod 9),
32 ≡ 0 (mod 9),
2
4 ≡7 (mod 9),

1
 52 ≡ 7 (mod 9),
2
6 ≡0 (mod 9),
72 ≡ 4 (mod 9),
2
8 ≡1 (mod 9).
Therefore, a square modulo 9 can be 0, 1, 4, or 7.
(b) Is 314159267144 a square?
Solution:
To determine if 314159267144 is a square, first check its value modulo 9.
Summing the digits of 314159267144, we get:

3 + 1 + 4 + 1 + 5 + 9 + 2 + 6 + 7 + 1 + 4 + 4 = 47.

Now sum the digits of 47:

4 + 7 = 11 ⇒ 1 + 1 = 2.

Since 314159267144 ≡ 2 (mod 9), and we know that squares modulo 9 can only
be 0, 1, 4, or 7, it follows that 314159267144 cannot be a square.

4- What is the largest integer with ten distinct digits that is divisible by 9?
Answer: To solve this, we use the property of divisibility by 9: a number
is divisible by 9 if and only if the sum of its digits is divisible by 9.

• The ten distinct digits are: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9.

• The sum of these digits is:

0 + 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 = 45

Since 45 is divisible by 9, any number that uses all ten digits is divisible
by 9.
• The largest number that can be formed by these digits is 9876543210.

Thus, the largest integer with ten distinct digits divisible by 9 is:

9876543210
Problem: Find the largest integer with 8 distinct digits that is divisible by
9.
Solution:
To find the largest integer with 8 distinct digits that is divisible by 9, we
can use the divisibility rule for 9: a number is divisible by 9 if the sum of its
digits is divisible by 9.

2
 Step 1: Determine the digits
Since we need 8 distinct digits, the largest digits we can use are 9, 8, 7, 6, 5, 4, 3, and 2.
We will omit 1 since we need only 8 digits.
Step 2: Check the sum of these digits
Calculate the sum of these digits:

9 + 8 + 7 + 6 + 5 + 4 + 3 + 2 = 44

Since 44 is not divisible by 9, we need to adjust the digits. By removing the

largest digit 9 and adding 1 (the next largest unused digit), we keep our total
sum divisible by 9.
Step 3: Use digits 8, 7, 6, 5, 4, 3, 2, 1
Calculate the sum of these digits:

8 + 7 + 6 + 5 + 4 + 3 + 2 + 1 = 36

Since 36 is divisible by 9, the number formed by these digits will also be

divisible by 9.
Step 4: Arrange the digits in descending order
To make the largest number, arrange the digits 8, 7, 6, 5, 4, 3, 2, 1 in descending
order:
87654321
Conclusion:
The largest integer with 8 distinct digits that is divisible by 9 is:

87654321

5- Given: The two congruences are:

ar ≡ b (mod m) (1)

br ≡ a (mod m) (2)
We are tasked to show that:

a2 ≡ b2 (mod m)

Proof:
First, multiply both congruences (1) and (2):

(ar)(br) ≡ b · a (mod m)
This simplifies to:
(ab)r2 ≡ ab (mod m)
Thus, we have:
(ab)(r2 − 1) ≡ 0 (mod m)

3
This means that either ab ≡ 0 (mod m) or r2 ≡ 1 (mod m). However, this
condition alone does not directly imply that a2 ≡ b2 (mod m).
Now, let’s manipulate the original equations differently to directly show
a2 ≡ b2 (mod m).
Step 1: From equation (1), solve for b:

b ≡ ar (mod m)

Step 2: Substitute this into equation (2):

br ≡ a (mod m) =⇒ (ar)r ≡ a (mod m)

Simplifying:
ar2 ≡ a (mod m)
Step 3: Rearranging the above:

a(r2 − 1) ≡ 0 (mod m)

This implies:
a · (r2 − 1) ≡ 0 (mod m)
Step 4: Now square both sides of ar ≡ b (mod m):

(ar)2 ≡ b2 (mod m)

This simplifies to:

a2 r2 ≡ b2 (mod m)
Step 5: From the earlier result ar2 ≡ a (mod m), multiply both
sides by a:
a2 r2 ≡ a2 (mod m)
Thus, we have:
a2 ≡ b2 (mod m)
as required.
Example:
Let a = 2, b = 3, r = 2, and m = 7.

• Check the first congruence:

ar ≡ 2 × 2 = 4 ≡ 3 (mod 7)

• Check the second congruence:

br ≡ 3 × 2 = 6 ≡ 2 (mod 7)

4
 Both congruences are satisfied. Now, let’s verify the conclusion:

a2 = 22 = 4, b2 = 32 = 9 ≡ 2 (mod 7)

Thus, a2 ≡ b2 (mod 7) is true, as 4 ≡ 2 (mod 7).

This provides a nontrivial example with a = 2, b = 3, r = 2, and m = 7.

Problem: Show that a5 ≡ a (mod 10) for all integers a.

Solution:
To show that a5 ≡ a (mod 10) for any integer a, we can use modular arith-
metic to analyze the cases for a modulo 10. Since a ≡ 0, 1, 2, . . . , 9 (mod 10),
we need to check the statement for each residue class.
Case 1: a ≡ 0 (mod 10)

a5 ≡ 05 = 0 ≡ 0 (mod 10)

In this case, a5 ≡ a (mod 10).

Case 2: a ≡ 1 (mod 10)

a5 ≡ 15 = 1 ≡ 1 (mod 10)

In this case, a5 ≡ a (mod 10).

Case 3: a ≡ 2 (mod 10)

a5 ≡ 25 = 32 ≡ 2 (mod 10)

In this case, a5 ≡ a (mod 10).

Case 4: a ≡ 3 (mod 10)

a5 ≡ 35 = 243 ≡ 3 (mod 10)

In this case, a5 ≡ a (mod 10).

Case 5: a ≡ 4 (mod 10)

a5 ≡ 45 = 1024 ≡ 4 (mod 10)

In this case, a5 ≡ a (mod 10).

Case 6: a ≡ 5 (mod 10)

a5 ≡ 55 = 3125 ≡ 5 (mod 10)

In this case, a5 ≡ a (mod 10).

Case 7: a ≡ 6 (mod 10)

a5 ≡ 65 = 7776 ≡ 6 (mod 10)

In this case, a5 ≡ a (mod 10).

5
 Case 8: a ≡ 7 (mod 10)

a5 ≡ 75 = 16807 ≡ 7 (mod 10)

In this case, a5 ≡ a (mod 10).

Case 9: a ≡ 8 (mod 10)

a5 ≡ 85 = 32768 ≡ 8 (mod 10)

In this case, a5 ≡ a (mod 10).

Case 10: a ≡ 9 (mod 10)

a5 ≡ 95 = 59049 ≡ 9 (mod 10)

In this case, a5 ≡ a (mod 10).

Since a5 ≡ a (mod 10) holds for each residue a ≡ 0, 1, 2, . . . , 9 (mod 10), we
have shown that a5 ≡ a (mod 10) for all integers a.
Conclusion:

a5 ≡ a (mod 10) for all integers a

7- Find an integer n such that n ≡ 1 (mod 2), n ≡ 0 (mod 3), and n ≡

0 (mod 5). Can you find infinitely many?
Solution:
We are tasked to solve the system of congruences:

n≡1 (mod 2) (1)

n≡0 (mod 3) (2)
n≡0 (mod 5) (3)
We will solve this using the Chinese Remainder Theorem.
Step 1: Solve congruences (2) and (3):
From congruences (2) and (3), we know that n must be divisible by 3 and
5, so n must be a multiple of lcm(3, 5) = 15. Thus, n = 15k for some integer k.
Step 2: Substitute into congruence (1):
Substitute n = 15k into n ≡ 1 (mod 2):

15k ≡ 1 (mod 2)

Since 15 ≡ 1 (mod 2), we have:

1·k ≡1 (mod 2) =⇒ k ≡ 1 (mod 2)

Thus, k = 2m + 1 for some integer m.

Step 3: Substitute back into the expression for n:

6
 Now substitute k = 2m + 1 back into n = 15k:

n = 15(2m + 1) = 30m + 15

Therefore, the general solution is:

n = 30m + 15 for some integer m.

Step 4: Infinitely many solutions:

Since m can take any integer value, there are infinitely many solutions. For
example, for m = 0, we have n = 15, and for m = 1, we have n = 45, and so on.
Thus, the integer solutions to the system are given by:

n = 30m + 15 for all integers m,

which means there are infinitely many solutions.

Problem: Show that no triangular number has as its last digit 2, 4, 7, or 9.

Solution:
A triangular number is a number of the form

n(n + 1)
Tn =
2
where n is a positive integer. We need to show that Tn cannot end in the digits
2, 4, 7, or 9.
Step 1: Determine Tn mod 10 Since we are interested in the last digit of
Tn , we will examine Tn (mod 10).
To evaluate Tn mod 10, we look at the two cases for n (even and odd).
Case 1: n is even If n ≡ 0 (mod 2), then n + 1 is odd. Let n = 2k for some
integer k. Then:

n(n + 1) 2k(2k + 1)
Tn = = = k(2k + 1)
2 2
We only need to evaluate k(2k + 1) (mod 10).
Case 2: n is odd If n ≡ 1 (mod 2), then n + 1 is even. Let n = 2k + 1 for
some integer k. Then:

n(n + 1) (2k + 1)(2k + 2)

Tn = = = (2k + 1)(k + 1)
2 2
We need to evaluate (2k + 1)(k + 1) (mod 10).
Step 2: Calculate Tn mod 10 for several values of n To find a pattern, we
calculate Tn for values of n from 1 to 10, then observe the last digits.

7
 1·2
T1 = = 1 ⇒ T1 ≡ 1 (mod 10),
2
2·3
T2 = = 3 ⇒ T2 ≡ 3 (mod 10),
2
3·4
T3 = = 6 ⇒ T3 ≡ 6 (mod 10),
2
4·5
T4 = = 10 ⇒ T4 ≡ 0 (mod 10),
2
5·6
T5 = = 15 ⇒ T5 ≡ 5 (mod 10),
2
6·7
T6 = = 21 ⇒ T6 ≡ 1 (mod 10),
2
7·8
T7 = = 28 ⇒ T7 ≡ 8 (mod 10),
2
8·9
T8 = = 36 ⇒ T8 ≡ 6 (mod 10),
2
9 · 10
T9 = = 45 ⇒ T9 ≡ 5 (mod 10),
2
10 · 11
T10 = = 55 ⇒ T10 ≡ 5 (mod 10).
2
The last digits of Tn from n = 1 to 10 are: 1, 3, 6, 0, 5, 1, 8, 6, 5, 5.
Step 3: Observe the pattern of last digits From our calculations, we observe
that the last digits of triangular numbers Tn modulo 10 are 0, 1, 3, 5, 6, and 8.
The digits 2, 4, 7, and 9 do not appear. Hence, no triangular number Tn can
end in 2, 4, 7, or 9.
Conclusion:

No triangular number has as its last digit 2, 4, 7, or 9.

9- Prove that if p is a prime and p divides no one of a1 , a2 , . . . , ap−1 nor any of their differences
1 in some order.
Solution:
Let p be a prime and let a1 , a2 , . . . , ap−1 be integers such that:
• p divides none of a1 , a2 , . . . , ap−1 , i.e., ai ̸≡ 0 (mod p) for all i.
• p divides none of the differences ai − aj for any i ̸= j, i.e., ai ̸≡ aj (mod p)
for i ̸= j.
We need to show that the set of residues {a1 , a2 , . . . , ap−1 } is congruent to
{1, 2, . . . , p − 1} (mod p) in some order.
Step 1: Consider the set of residues modulo p.
Since p is prime, the set of integers {1, 2, . . . , p − 1} forms a complete set of
residues modulo p. There are exactly p − 1 distinct nonzero residues modulo p.

8
 By assumption, the numbers a1 , a2 , . . . , ap−1 are distinct modulo p, and none
of them are divisible by p (i.e., none are congruent to 0 (mod p)). Therefore,
the numbers a1 , a2 , . . . , ap−1 must also form a complete set of distinct nonzero
residues modulo p.
Step 2: Mapping a1 , a2 , . . . , ap−1 to 1, 2, . . . , p − 1.
Since there are p − 1 distinct numbers in {a1 , a2 , . . . , ap−1 }, and these num-
bers are all distinct modulo p, they must correspond to the set {1, 2, . . . , p − 1}
modulo p.
Thus, the set {a1 , a2 , . . . , ap−1 } is congruent to {1, 2, . . . , p − 1} (mod p) in
some order.
Conclusion:
We have shown that if p divides none of a1 , a2 , . . . , ap−1 nor any of their
differences, then the set {a1 , a2 , . . . , ap−1 } must be congruent modulo p to
{1, 2, . . . , p − 1} in some order.

{a1 , a2 , . . . , ap−1 } ≡ {1, 2, . . . , p − 1} (mod p).

10- Induce a definition for f(n) and prove divisibility conditions

for 7, 11, and 13.
Induced definition for f(n):
Let n be a large integer written as n = ak ak−1 . . . a2 a1 a0 , where ai represents
a group of 3 digits starting from the least significant digit. The function f (n)
can be defined as the alternating sum of groups of 3 digits starting from the
least significant group.
For example, if n = 31, 415, 926, 535, 897, we split it into groups of 3 digits:

n = 31, 415, 926, 535, 897

Then f (n) is the alternating sum of these groups:

f (n) = 897 − 535 + 926 − 415 + 031 = 904.

Thus, for a general integer n, the function f (n) is defined as:

k
X
f (n) = (−1)i · ai
i=0

where each ai represents a group of 3 digits from n.

Proof of divisibility conditions:
We are tasked with proving that if 7|f (n), then 7|n; if 11|f (n), then 11|n;
and if 13|f (n), then 13|n.
The key idea is that the alternating sum of groups of three digits, as de-
fined in f (n), preserves divisibility by 7, 11, and 13 in the same way the usual
alternating sum of digits works for divisibility by 3 or 9.

9
 The reason this holds is based on the properties of powers of 1000 mod 7,
1000 mod 11, and 1000 mod 13. For each of these primes, 1000 ≡ 1 (mod 7),
1000 ≡ 1 (mod 11), and 1000 ≡ 1 (mod 13), meaning that multiplying or shift-
ing groups of three digits in n by powers of 1000 will not affect their congruence
modulo 7, 11, or 13. Therefore, if f (n) is divisible by 7, 11, or 13, the original
number n will also be divisible by those primes.
Divisibility by 7 , 11 , and 13 using f (n):
To check divisibility of n by 7, 11, or 13, compute f (n). If f (n) is divisible
by any of these primes, then n is also divisible by that prime.
Example Check: Divisibility for n = 118, 050, 660:
We will check n = 118, 050, 660 for divisibility by 2, 3, 5, 7, 11, and 13.
1. **Divisibility by 2**: A number is divisible by 2 if its last digit is divisible
by 2.
n = 118, 050, 660 (last digit is 0)
Since the last digit is 0, n is divisible by 2.
2. **Divisibility by 3**: A number is divisible by 3 if the sum of its digits
is divisible by 3.

1 + 1 + 8 + 0 + 5 + 0 + 6 + 6 + 0 = 27

Since 27 ÷ 3 = 9, n is divisible by 3.
3. **Divisibility by 5**: A number is divisible by 5 if its last digit is 0 or 5.

n = 118, 050, 660 (last digit is 0)

Since the last digit is 0, n is divisible by 5.

4. **Divisibility by 7**: To check divisibility by 7, we calculate f (n) using
the alternating sum of groups of 3 digits:

n = 118, 050, 660 groups: (660, 050, 118)

f (n) = 660 − 050 + 118 = 728

Since 728 ÷ 7 = 104, n is divisible by 7.
5. **Divisibility by 11**: We use the same function f (n) to check divisibility
by 11:
f (n) = 728
Since 728 ÷ 11 = 66.18, n is not divisible by 11.
6. **Divisibility by 13**: Again, using f (n):

f (n) = 728

Since 728 ÷ 13 = 56, n is divisible by 13.

Conclusion:
For n = 118, 050, 660, we find that: - n is divisible by 2, 3, 5, 7, and 13. - n
is not divisible by 11.

10