MARIA CORAZON N.

YEMA

MAED- MATHEMATICS

OCTOBER 19, 2024

NT 12425 PRE-MID ASS

PROVING

1. Using the method of direct proof, prove that if x is an odd positive

integer, then x 2−1 is divisible by 4.
SOLUTION

Let x be an odd positive integer. By definition, any odd integer can be written
as: x=2 k +1 for some integer k. We aim to show that x 2−1 is divisible by 4.
First, compute x 2: x 2=(2 k +1)2=4 k 2+ 4 k + 1. Now subtract 1 from x 2:
2 2 2 2 2
x −1=(4 k +4 k +1)−1=4 k + 4 k . Factor out 4: x −1=4( k +k ). Since k 2+ k is an
integer, we see that x 2−1 is divisible by 4.
Thus, if x is an odd positive integer, x 2−1 is divisible by 4.

2. Show that the product of two integers of the form 6 k + 5 is of the form
6 k + 1. Use direct proof.
SOLUTION
Let a and b be two integers of the form 6 k + 5. Thus, we can express
them as a=6 m+5 for some integer m and b=6 n+5 for some integer n .
Calculate the product ab : ab=( 6 m+5 ) .Expanding the product using the
distributive property: ab=6 m ∙6 n+ 6 m∙ 5+5 ∙6 n+5 ∙5=36 mn+ 30 m+30 n+ 25.
Rearrange the expression: :ab=6 (6 mn+ 5 m+5 n)+25. We can express
25 in terms of 6: 25=24+1=6 ( 4 ) +1. We can write ab as
 ab=6 ( 6 mn+5 m+5 n+4 ) +1 .Let p=6 mn+5 m+5 n+ 4 which is an integer.
Therefore, we can conclude that ab=6 p+1.
This show that the product of ab is of the form 6 k + 1 for some integer
k.

3. Use mathematical induction to prove the following formula:

n( n+1)(2n+ 1)
12 +22 +32 +… n2=
6
SOLUTION

2
1 =1

1 ( 1+1 ) ( 2⋅ 1+1 ) 1 ⋅2⋅3 6

= = =1
6 6 6

The formula is true.

Assume that the formula holds for some arbitrary positive integer k

k ( k +1 ) ( 2 k +1 )
12 +22 +32 +…+ k 2=
6

Show that it holds for k +1

2 (k +1) ( k +2 ) ( 2( k +1)+1 )
12 +22 +32 +…+ k 2+ ( k +1 ) =
6

k ( k +1 ) ( 2 k +1 )
12 +22 +32 +…+ k 2+ ( k +1 )2= + ( k +1 )2
6
2
2 2 2 k ( k +1 ) ( 2 k +1 ) 6 ( k +1 )
2 2
1 +2 +3 +…+ k + ( k +1 ) = +
6 6

2 2 2 2 2 k ( k ( 2 k +1 ) +6 ( k +1 ) )
1 +2 +3 +…+ k + ( k +1 ) =
6

Simplify he expression inside the parentheses:

k (2 k +1)+6 (k +1)=2 k 2+k + 6 k +6=2 k 2+7 k +6

 ( k +1 ) ( 2 k 2 +7 k +6 )
k ( 2 k +1 ) +6 ( k +1 )=
6

Factor 2 k 2 +7 k + 6
2
2 k +7 k + 6=(2 k +3)(k +2)

Rewrite the expression:

( k +1 ) ( 2 k +3 ) ( k +2 )
k ( 2 k +1 ) +6 ( k +1 ) ¿
6

This matches the form we want for n=k +1

(k + 1) ( k +2 ) ( 2( k +1)+1 )
¿
6

We can conclude that the formula

n ( n+ 1 )( 2 n+1 )
12 +22 +32 +…+n 2=
6

CONVERSION (Show your solutions)

1. ( A 35 BOF )16 from hexadecimal notation (base 16) to decimal notation

(base 10)

SOLUTION
( A 35 BOF )16
5
10 ×16 =¿ 10,485,760
4
3 ×16 =¿ 196,608
3
5 ×16 =¿ 20,480
2
11×16 =¿ 2,816
1
0 ×16 =¿ 0
0
15 ×16 =¿ 15
( A 35 BOF )16 =¿ 10 , 6 85,67910

2. ( 101001000 )2 from binary notation (base 2) to decimal notation (base 10)

 SOLUTION
( 101001000 )2
0
0 ×2 =¿ 0
1
0 ×2 =¿ 0
2
0 ×2 =¿ 0
3
1 ×2 =¿ 8
4
0 ×2 =¿ 0
5
0 ×2 =¿ 0
6
1 ×2 =¿ 64
7
0 ×2 =¿ 0
8
1 ×2 =¿ 256
( 101001000 )2=¿ 3 2810

3. ( A 35 BOF )16 from hexadecimal notation (base 16) to binary notation

(base 2)
SOLUTION
( A 35 BOF )16
A 1010
3 0011
5 0101
B 1011
0 0000
F 1111
( A 35 BOF )16 = 1010001101011011000011112

4. ( 101001000 )2 from binary notation (base 2) to octal notation (base 8)

SOLUTION
( 101001000 )2
001 010 010 000

1 2 2 0
( 101001000 )2=¿ 12208
 5. ( 1925 )10 from decimal notation (base 10) to binary notation (base 2)
SOLUTION
( 1925 )10
1925 ¿ 2 ∙962 +1
962 ¿ 2 ∙ 481 +0
4 81 ¿ 2 ∙24 0 +1
24 0 ¿ 2 ∙12 0 +0
12 0 ¿ 2 ∙6 0 +0
60 ¿ 2 ∙30 +0
30 ¿ 2 ∙15 +0
15 ¿ 2 ∙7 +1
7 ¿ 2 ∙3 +1
3 ¿ 2 ∙1 +1
1 ¿ 2 ∙0 +1
( 1925 )10=¿ 11110 00 0 10 12

PROBLEM SOLVING (Show your solutions)

1. For which positive integers m is the statement 27 ≡5 (mod m) TRUE?

SOLUTION
The statement 27 ≡5 (mod m),m means the difference 27- 5 must be
divisible by m ,so we have 27-5 = 22. Thus, m must be a divisor of
22. The positive divisors of 22 are 1,2,11, and 22.
Therefore, the positive integers m are: {1,2,11,22}.

2. For any integer a , show that ( 2 a+1 , 9 a+ 4 ) =1

SOLUTION
To show that ( 2 a+1 , 9 a+ 4 ) =1, we can use the properties of the greatest
common divisor (gcd). We will express9 a+ 4 in terms of 2 a+1:

Using the Euclidean algorithm:

( 9 a+ 4 )−4 ( 2 a+1 )=9 a+4−( 8 a+4 )=a

Now we find (( 2 a+1 , a )

Next, apply the algorithm again:

2 a+1−2 a=1

Since ( a , 1 )=1 , we have

( 2 a+1 , 9 a+ 4 ) =1

3. Solve for (12378, 3054) and [12378, 3054].

SOLUTION

4. An old receipt has faded. It reads “88 chickens cost a total of $ x 4.2 y ,
where x and y are unreadable digits. How much did the 88 chickens
cost? (Hint: Review divisibility rules for 8, 4, 2, and 11).
SOLUTION

5. Ephraim wants to buy pizza and cola for his Number Theory
classmates. He has 400 pesos only. If we know that each pizza costs 57
pesos and each bottle of cola costs 22 pesos, how many pizzas and
bottles of cola can he buy?
SOLUTION

Let pbe the number of pizzas and c be the number of cola bottles.

The equation is:

 57 p+22 c ≤ 400

Testing combinations:

1. For p=7 :57 × 7=399gives c=0

2. For p=6: 57× 6=3 42gives c=2 (with in the budget)

Therefore, Ephraim can buy:7 pizzas and 0 cola bottles, or 6 pizzas

and 2 cola bottles.