You are on page 1of 4

1.

An ISBN (International Standard Book Number) is a number that uniquely identifies a


book. ... ISBNs are example of an application of an area of mathematics called coding
theory . The code used for the ISBN-10 is an error detecting code.

-With the virtue of having an ISBN you book can be found and referred widely and beyond
your lifetime.

2. Universal product code (UPC) is a 12-digit number and associated machine-readable bar
code used to identify products being purchased in grocery stores.

-The purpose of UPCs is to make it easy to identify product features, such as the brand
name, item, size, and color, when an item is scanned at checkout. In fact, that’s why they
were created in the first place – to speed up the checkout process at grocery stores.

3. Testing credit card numbers

Here’s how to apply the Luhn check to test whether or not a credit card number is valid:

Step 1a. For a card number with an even number of digits (e.g., Visa or MasterCard), double
alternating digits starting with the first digit in the sequence.

Step 1b. For a card with an odd number of digits (e.g., American Express), double alternating digits
starting with the second digit in the sequence.

Step 2. If the doubling resulted in a number with two digits, add them together to get a single digit
number

Step 3. Now go back to the original credit number and replace the digits that you doubled with the
new value — either the doubled value, or the doubled value with the digits added together — and
add it all up.

Step 4. Check to see if the sum is evenly divisible by 10 (you can simply look to see whether or not it
ends with a zero).

-If the card number does not pass this check, then it is not a valid number. If, on the other hand, it
does pass, then it may be a valid number with valid credit report.

4.
Cryptography is the study of secure communications techniques that allow only the sender
and intended recipient of a message to view its contents. The term is derived from the Greek
word kryptos, which means hidden. ... If the message is intercepted, a third party has
everything they need to decrypt and read the message

- Uses sophisticated mathematical equations (algorithms) and secret keys to encrypt and
decrypt data. Today, cryptography is used to provide secrecy and integrity to our data,
and both authentication and anonymity to our communications.
5.

Enchiper - UQJHSE

DecipheIf we subtract first, we have 73 – 64 = 9, so (73 – 64)mod5 is congruent to 9mod5. Now we


just need to find the remainder when 9 is divided by 5, which is 4. Therefore, (73 – 64)mod5 is
congruent to 4mod5.

We can also first find that 73mod5 is congruent to 3mod5 and that 64mod5 is congruent to 4mod5.
By our rules, we have that (73 – 64)mod5 is congruent to 3mod5 – 4mod5 which is congruent to -
1mod5. We have a negative number, so we add multiples of 5 until we get a number between 0 and
4. If we add 5 to -1, we get 4, which falls in our range, so this is our answer. We see that once again,
we get that (73 – 64)mod5 is congruent to 4mod5.r - Proceed to the following coordinates

6.

In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers “wrap
around” when reaching a certain value, called the modulus.

7.
1.) As in our initial clock example, let’s work in modulus 12. Assume it is 7:00, and we want to know
what time it will be 10 hours from now.

Solutions:

Basically, this is asking us to find (7 + 10)mod12. To perform this operation, we first add 7 + 10 to get
17, so (7 + 10)mod12 is congruent to 17mod12. Next, we find 17mod12. To find 17mod12, we find
the remainder when 17 is divided by 12, which is 5. Therefore, (7 + 10)mod12 is congruent to
5mod12. This tells us that if it is 7:00, then 10 hours from now, it will be 5:00. The following image
shows the work that’s described in a nice compact form.

Time 10 hours after 7:00

(7 + 10) mod 12 = 17 mod 12 = 5mod 12

2.) Working in modulus 5, find (73 – 64)mod5.

Solutions:

If we subtract first, we have 73 – 64 = 9, so (73 – 64)mod5 is congruent to 9mod5. Now we just need
to find the remainder when 9 is divided by 5, which is 4. Therefore, (73 – 64)mod5 is congruent to
4mod5.

We can also first find that 73mod5 is congruent to 3mod5 and that 64mod5 is congruent to 4mod5.
By our rules, we have that (73 – 64)mod5 is congruent to 3mod5 – 4mod5 which is congruent to -
1mod5. We have a negative number, so we add multiples of 5 until we get a number between 0 and
4. If we add 5 to -1, we get 4, which falls in our range, so this is our answer. We see that once again,
we get that (73 – 64)mod5 is congruent to 4mod5.

Subtracting first

(73 -64) mod 5 = 9mod 5 = 4mod 5

Finding numbers mod 5 first

(73- 64)mod 5

= -1mod5

= 4mod5

You might also like