Query 26

#$&*

course Mth 151

026. `query 26

*********************************************

Question: `q5.4.12 What is [ (10+7) * (5+3) ] mod 10 and how did you get your result?

YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY

Your solution:

First you would do the math in the parentheses which would be 10 +7 and 5 + 3. The answer would be 17 * 8 (mod 10). 17*8 = 136; 136/10 equals a remainder of 6.

confidence rating #$&*:

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

.............................................

Given Solution:

`a** x mod 10 is the remainder when x is divided by 10.

So [ (10+7) * (5 + 3) ] mod 10 = ( 17 * 8) mod 10 = 136 mod 10 = 6, since 136 / 10 leaves remainder 6. **

&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&

Self-critique (if necessary):

Yea me!!!! I got it.

------------------------------------------------

Self-critique Rating:

*********************************************

Question: `qquery 5.4.20 2 / 3 on 5-hour clock

What is 2 divided by 3 on a 5-hour clock, and how did you obtain this result?

YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY

Your solution:

Not quite sure what to do on this. I don’t recall seeing this in the chapter.

confidence rating #$&*:

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

.............................................

Given Solution:

`a** You have to turn this one into a multiplication problem to get the correct answer.

In decimal numbers, for example, 60 / 20 = 3 because 3 * 20 = 60.

Whatever you get when you divide 2 by 3, when you multiply it by 3 you get 2. That is, if 2 / 3 = x, then 3 x = 2.

So what would you multiply by 3 to get 2 on a 5-hour clock?

It turns out that 3 * 4 = 2. So it follows that 2 / 3 = 4. **

&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&

Self-critique (if necessary):

Okay how would I get the 3x = 2??? I do understand that if I take 3*4 = 12/5 which gives us a remainder of 2.

------------------------------------------------

Self-critique Rating:

@& On a 5 hour clock 3 * 4 = 12 takes you through 2 complete trips around the clock (corresponding to 10 hours) with 2 hours left over. So, starting from the 'top' of the clock (at 0) you end up at 2. Thus, on this clock, 3 * 4 = 2.*@

*********************************************

Question: `qquery 4.4.42 (3 - 27) mod 5

What is (3 - 27) mod 5, and how did you reason out your result?

YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY

Your solution:

3 - 27 = -24/5 gives us a remainder of -4….. Is this right, not sure with the whole negative number?

confidence rating #$&*:

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

.............................................

Given Solution:

`a** (3-27) mod 5 = -24 mod 5.

You would go all the way around around backwards 5 complete times to get -25, then move forward 1 to get to -24. That would put you at 1 on the actual clock. **

&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&

Self-critique (if necessary):

Okay not sure why I would do this or how I would know how to do this????? I thought we were in chapter 5 and I am not sure where this is in the book.

------------------------------------------------

Self-critique Rating:

@& Let me check the correspondence between the query and the current edition of the text. Can't do that now, since I'm out of town.

In any case if it's not in the text you won't be responsible for it.*@

*********************************************

Question: `qquery 5.4.20 Pos Integer solns (5x-3) = 7 (mod 4)

YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY

Your solution:

5x - 10/4 the solution is: 2, 6

confidence rating #$&*:

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

.............................................

Given Solution:

`a** The solutions have to be integers, and the mod makes a difference in the algebra.

7 (mod 4) is 3.

Since (5x - 3) mod 4 = 7 mod 4, (5x - 3) mod 4 must be 3.

For x = 1, 2, 3, 4, ..., the expression 5x - 3 takes values 2, 7, 12, 17, 22, 27, 32, 37, ... .

These numbers, when divided by 4, give remainders 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, ... .

Thus every fourth number, mod 4, is equal to 3.

This starts with the second number, which occurs when x = 2.

Every fourth number, starting with 2, gives us the sequence 2, 6, 10, 14, ...

2 is the first solution, 4 is the difference between solutions.

Thus x can be any element in the set {2, 6, 10, 14, . . . }.

The general term of this sequence is 2 + 4 n. So we can also say that x = 2 + 4 n, where n = 0, 1, 2, 3, . . .

Checking these results:

If n = 0 then x = 2 + 4 * 0 = 2.

If n = 1 then x = 2 + 4 * 1 = 6.

If n = 2 then x = 2 + 4 * 2 = 10.

If n = 3 then x = 2 + 4 * 3 = 14.

etc.

These are the solutions obtained above to the equation. **

&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&

Self-critique (if necessary):

So got this wrong!!!! Not sure what was done and why???? I thought that I would have to subtract the 7 to get a zero on the one side.

------------------------------------------------

Self-critique Rating:

*********************************************

Question: `qquery 5.4.30 table for addition mod 7 and properties of operation

YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY

Your solution:

I hate to say this, but I don’t remember how to do this!!!!!

confidence rating #$&*:

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

.............................................

Given Solution:

`a** Your table should read

0 1 2 3 4 5 6

0 0 1 2 3 4 5 6

1 1 2 3 4 5 6 0

2 2 3 4 5 6 0 1

3 3 4 5 6 0 1 2

4 4 5 6 0 1 2 3

5 5 6 0 1 2 3 4

6 6 0 1 2 3 4 5

The operation is closed, since all numbers mod 7 are between 0 and 6. The only numbers on the table are 0, 1, 2, 3, 4, 5, 6.

The operation has an identity, which is 0, because when added to any number 0 doesn't change that number. We can see this in the table because the row corresponding to 0 just repeats the numbers 0123456, as does the column beneath 0.

The operation is commutative--order doesn't matter because the table is symmetric about the main diagonal..

The operation has the inverse property because every number can be added to another number to get the identity 0: 0+7 = 0, 1+6=0, 2+5=0, 3+4=0. These numbers form pairs of inverses. This property can be seen from the table because the identity 0 appears exactly once in every row.

The operation is associative, since for any a, b, c we know that (a + b ) + c = a + ( b + c), and it follows that [ (a + b ) + c ] mod 7 must equal [ a + ( b + c) ] mod 7. **

&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&

Self-critique (if necessary):

I am so sorry; I had a major brain fart!!!!!

------------------------------------------------

Self-critique Rating:

*********************************************

Question: `q5.4.33 table for mult mod 4 and properties of operation

YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY

Your solution:

0 1 2 3

0 0 0 0

1 1 2 3

2 2 4 6

3 3 6 9

I understand doing the tables, but not so sure about the properties of operation.

confidence rating #$&*:

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

.............................................

Given Solution:

`a** The correct table is

0 1 2 3

0 0 0 0 0

1 0 1 2 3

2 0 2 0 2

3 0 3 2 1

For example the row across from 2 is obtained as follows: 2 * 0 = 0 and 2 * 1 = 2, as always. Then 2 * 2 mod 4 = 4 mod 4, which is 0 and 2 * 3 mod 4 = 6 mod 4, which is 2.

the operation is closed because the results all come from the set {0, 1, 2, 3} being operated on

1 is the identity because the row and column for 1 both have 0,1,2,3 in that order, so 1 doesn't change a number when multiplied by that number.

0 and 2 lack inverses--they can't be combined with anything else to get 1--so the operation lacks the inverse property.

symmetry about the main diagonal implies commutativity

associativity follows from associativity of multiplication of real numbers**

&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&

Self-critique (if necessary):

I forgot to include the zero when figure the table. Sorry and I still need to work on the whole properties stuff.

------------------------------------------------

Self-critique Rating:

*********************************************

Question: `qquery 5.4.70 y + [[ (y-1)/4 ]] - [[ (y-1) / 100 ]] + [[ (y-1) / 400 ]]; day of jan 1, 2002; smallest b with a = b (mod 7); b=0 Sunday etc.

YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY

Your solution:

Please help me understand this more. Every time I think I understand I get confused again. So sorry.

confidence rating #$&*:

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

.............................................

Given Solution:

`a** The calculation is

2002 + [[ 2002-1/4 ]] - [[ 2002-1/100 ]]+ [[ 2002-1/400 ]].

[[ Q ]] means the greatest integer contained in Q.

So we get

2002+ [[500.25]] - [[20.01]] + [[5.0025]]

= 2002 + 500 - 20 + 5

= 2487.

Now 2487 mod 7 is 2.

Sunday is 0, Monday is 1 so Tuesday is 2.**

***I understand how you got what you did, but not sure how I would not that the “y” is 2002?????

"

Self-critique (if necessary):

------------------------------------------------

Self-critique rating:

*********************************************

Question: `qquery 5.4.70 y + [[ (y-1)/4 ]] - [[ (y-1) / 100 ]] + [[ (y-1) / 400 ]]; day of jan 1, 2002; smallest b with a = b (mod 7); b=0 Sunday etc.

YYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYY

Your solution:

Please help me understand this more. Every time I think I understand I get confused again. So sorry.

confidence rating #$&*:

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

.............................................

Given Solution:

`a** The calculation is

2002 + [[ 2002-1/4 ]] - [[ 2002-1/100 ]]+ [[ 2002-1/400 ]].

[[ Q ]] means the greatest integer contained in Q.

So we get

2002+ [[500.25]] - [[20.01]] + [[5.0025]]

= 2002 + 500 - 20 + 5

= 2487.

Now 2487 mod 7 is 2.

Sunday is 0, Monday is 1 so Tuesday is 2.**

***I understand how you got what you did, but not sure how I would not that the “y” is 2002?????

"

Self-critique (if necessary):

------------------------------------------------

Self-critique rating:

#*&!

&#Your work looks good. See my notes. Let me know if you have any questions. &#