Sunteți pe pagina 1din 5

Cometa, Kenneth Marshall V.

GED102 – A13

January 15 2020

Assignment 8

Ex 1.1

1. Evaluate the following modular operations:

a. (47 + 26) mod 15

=47 +26=73

73 13
=73 ÷15= ∨4
15 15

Remainder is 13 so therefore, (47 + 26) mod 15 = 13

b. (25 – 32) mod 9

25 6
= =2 , so therefore 25 mod 9 = 6
9 9

−32 5
= =3 , so therefore -32 mod 9 = -5
9 9

=25 mod 9+ (−32mod 9 )=6+ (−5 )=1

So therefore, (25 – 32) mod 9 = 1

c. (13)(32) mod 14

=(13)(32) = 416

416 5
= =29 ,
14 7

The remainder is 5, so therefore (13)(32) mod 14 = 5

2. Determine the value of the following:

a. Additive inverse of 6 mod 10

=6+ 4=10 ≅ 0 mod 10, so therefore, the additive inverse of 6 mod 10 is 4


b. Multiplicative inverse of 5 mod 11

=9 ×5=45

=45 mod 11 = 1, so therefore, the multiplicative inverse of 5 mod 11 is 9

c. Multiplicative inverse of 6 mod 15

3. In a 12-hour clock, determine the time

a. 55 hours after 7 o’clock

=55 + 7 = 62 ≅1 mod 12. So therefore, the answer is 1 o’clock

b. 25 hours before 2 o’clock

=2 – 25 = -23

=23 mod 12 = 11

=11 + 12 = 1

So therefore, the answer is 1

4. In exactly 125 days, the country will commemorate Labor Day (May 1).

a. If today is Tuesday, what day of the week is Labor Day?

=125 mod 7 = 6

-Counting 6 days from Tuesday, we get a Monday

- So therefore, Labor Day is on a Monday

b. What day will Labor Day be after 10 years?

c. What day was Labor Day 10 years ago?

=
For numbers 5 and 6, determine whether the given ISBN code is valid or not. If the

code is not valid, give the correct check digit.

5. 978 – 971 – 98 – 0456 – 6

= x 13=10− [ 9+3 (7 ) +8+3 ( 9 ) +7+ 3 (1 ) + 9+3 ( 8 ) +0+3 ( 4 ) +5+3 ( 6 ) ] mod 10

= x 13=10−( 143 mod 10 )

= x 13=10−3

= x 13=7

ISBN code is not valid. The correct check digit should be 7.

6. 978 – 013 – 14 – 3747 – 1

=x 13=10− [ 9+3 (7 ) +8+3 ( 0 ) +1+3 ( 3 ) +1+3 ( 4 ) +3+3 ( 7 ) + 4+3 ( 7 ) ] mod 10

= x 13=10−( 110 mod 10 )

= x 13=10−11

= x 13=−1

= ISBN code is valid

For numbers 7 and 8, determine whether the given UPC number is valid or not. If the

number is not valid, give the correct check digit.

7. 3 – 8173 – 115208 – 7

= x 12=10−[ 3 ( 3 ) +8+ 3 ( 1 ) +7+ 3 ( 3 )+1+3 ( 1 ) +5+3 ( 2 ) +0+3 ( 8 ) ] mod 10

= x 12=10−( 75 mod 10 )

= x 12=10−1

= x 12=9

= The number is not valid. The correct check digit is 9

8. 000 – 396 – 01593 – 6


= x 12=10−[ 3 ( 0 ) + 0+ 3 ( 0 ) +3+3 ( 9 ) +6+ 3 ( 0 )+ 1+ 3 (5 )+ 9+3 ( 3 ) ] mod 10

= x 12=10−( 70 mod 10 )

= x 12=10−0

= x 12=10

= The number is not valid. The correct check digit is 0

For numbers 9 and 10, determine whether the given credit card number is valid or not.

9. 3 – 8173 – 115208 – 7

=Sum = 6 + 8 + 2 + 7 + 6 + 1 + 2 + 5 + 4 + 0 + 1 + 6 + 7 = 55

=55 mod 10 = 1

=The credit card is not valid

10. 000 – 396 – 01593 – 6

=Sum = 0 + 0 + 0 + 3 + 1 + 8 + 6 + 0 + 1 + 1 + 0 + 9 + 6 + 6 = 41

=41 mod 10 = 1

=The credit card is not valid

Ex 2.1

1. Determine the decimal number that is equivalent to each of the given binary numbers:

a. 1001011

=1 ( 26 ) +0 ( 25 ) +0 ( 2 4 ) +1 ( 23 )+ 0 ( 22 ) +1 ( 2 ) +1

= 64 + 0 + 0 + 8 + 0 + 2 + 1

= 75

b. 110011 = 51

=
c. 101101 = 45

4. Translate the following into binary codes.

a. I AM NEVER LATE IN CLASS

- 010010000000001011010000001110001011011000101100100000001100000011

010000101000000100101110000000001101100000011001110011

b. EXPERIENCE TEACHES THE BEST LESSON IN LIFE

- 001011100010000001011001001001001010111000011001010000010100001010

000100011010000010110011000001010001000001010000000010001011001110

100000000110000101100111001101111011100000001001011100000001100010

010011000101

5. Translate the following binary code into English sentence.

a. 001110111100100000000001001100001011001110011000001010001000001010

00001000001000010010110001001100001000001001011100010110011

= GOD BLESS THE PHILIPPINES

b. 01101 00001 01011 00101 00000 00101 10110 00101 10010 11001 00000 00001

00011 10100 00100 10111 10111 00000 00001 10111 11010 10111 01010

010011

= MAKE EVERY ACTION COUNTS

S-ar putea să vă placă și