Anda di halaman 1dari 11

# Name: NIM: Class:

## Assignment 4: Number Theory

Discrete Mathematics - A (MSH1A3)
Second Term 2017-2018
Instructions:

1. This assignment is due Friday May 4 at 5:00 p.m.. Please submit your work at School of Computing
academic roster (roster akademik Fakultas Informatika), room A203A (building A room A203A). Do
not forget to write your identity on the space provided. You may submit this assignment as of Monday
April 30 at 8:00 a.m..

2. In order to prevent any academic misconduct, you also need to submit a readable scan or photograph of
detailed information. The due date of this online submission is the same as the hardcopy. Please make
sure that your file size do not exceed the maximum file size allowed.

3. To save paper, you may print and reproduce this assignment double-sided.

4. Your answers must be handwritten. You may use: HB or 2B pencil, or pen with blue or black ink.

5. All problems in this assignment are adapted from the textbooks. The problems are written in English.
If you are a student in a regular class, you may answer the problems in Bahasa. However, if you are a
not be graded. You may ask your class instructor or teaching assistant for helping you understanding the
problem, but you should not ask them to give the solution of any problem.

6. Write your solutions on the space provided. If you need more space, you may use additional A4 papers
and attach them to your assignment.

7. Be neat and write legibly. You will be graded not only on the correctness of your answers, but also on
the clarity with which you express them.

## 8. This assignment consists of 10 problems and each problem is worth 10 points.

9. Please retain yourself from copying answers from elsewhere without understanding the steps. This
assignment is an individual evaluation.

10. Important: late submission without reasonable explanation will not be graded.

page 1 of 11
Problem 1 (10 points) Find a div b and a mod b when:

## (d). [2.5 points] a = −155 and b = 23

Justify your answer using division theorem. For example: 13 div 3 = 3 and 13 mod 3 = 1 because
13 = 4 (3) + 1.

A NSWER :

page 2 of 11
Name: NIM: Class:

Problem 2 (10 points) Convert each of these values into its corresponding decimal representation

## (c). [4 points] (EA)16

A NSWER :

page 3 of 11
Problem 3 (10 points) Convert the decimal number 141 into:

## (c). [4 points] hexadecimal expansion.

A NSWER :

page 4 of 11
Name: NIM: Class:

Problem 4 (10 points) Andrea owns a candy parlor. One day, she has produced 510 cinnamon candies,
680 licorice candies, and 850 caramel candies. She wants to divide the candies into identical packages so
that each package has the same number of candies, and she must use all of the candies (no candies are left
over).

(a). [5 points] Determine the maximum number of identical packages Andrea can make.

(b). [5 points] If the number of identical packages is maximum, determine the number of each cinnamon,
licorice, and caramel candy in a package.

A NSWER :

page 5 of 11
Problem 5 (10 points) A small district has an ice cream parlor, a bakery, and a noodle stall; each shop
opens every day. The ice cream parlor gives discount every 12 days, the bakery sells its product half-price
every 28 days, and the noodle stall gives its customers extra dumplings every 21 days.

(a). [5 points] Find the cycle (in day) in which the parlor, the bakery, and the noodle stall respectively
give discount, half-price products, and extra dumplings at the same time.

(b). [5 points] Suppose for the first time in 2018, the ice cream parlor, the bakery, and the noodle stall
respectively give discount, half-price products, and free dumplings at January 2nd. When will the
third simultaneous occurrence of this condition be happened this year?

A NSWER :

page 6 of 11
Name: NIM: Class:

Problem 6 (10 points) Suppose Z7 is the set of integers modulo 7, that is, Z7 = {0, 1, 2, 3, 4, 5, 6}.

## (b). [5 points] Construct the multiplication table for Z7 . We have a ·7 b = (a · b) mod 7.

A NSWER :

page 7 of 11
Problem 7 (10 points) Use the addition and multiplication table in Problem 6 to solve each of the follow-
ing congruences for x ∈ Z7 .

## (d). [2.5 points] 2x + 5 ≡ 2 (mod 7)

A NSWER :

page 8 of 11
Name: NIM: Class:

Problem 8 (10 points) Use the Euclidean algorithm to calculate the gcd of a and m when:

## (b). [5 points] a = 19 and m = 141.

A NSWER :

page 9 of 11
Problem 9 (10 points) Use the result in Problem 8 to find the integers s and t that satisfy each of the
following expressions:

## (b). [5 points] gcd (141, 19) = s · 141 + t · 19.

A NSWER :

page 10 of 11
Name: NIM: Class:

Problem 10 (10 points) Use the result in Problem 9 to determine whether each of the following congru-
ences has a solution. If so, determine the smallest positive value of x that satisfies the corresponding
congruence.

A NSWER :

page 11 of 11