07-401/Homework Assignment 4: Difference between revisions

From Drorbn
Jump to navigationJump to search
No edit summary
 
No edit summary
Line 9: Line 9:


===Doing===
===Doing===
Solve problems ??? in Chapter 15 of Gallian's book and problems 1, 2, #3, 9, 10, 11, #12 and ??? in Chapter 16 of the same book, but submit only the solutions the problems marked with a sharp (#).
Solve problems ??? in Chapter 15 of Gallian's book and problems 1, 2, 3#, 9, 10, 11, 12# and ??? in Chapter 16 of the same book, but submit only the solutions the problems marked with a sharp (#).


===Due Date===
===Due Date===
This assignment is due in class on Wednesday February 7, 2007.
This assignment is due in class on Wednesday February 7, 2007.

===Just for Fun===
{|
|-
|
* Take a large integer and write it in base 10. Cut away the "singles" digit, double it and subtract the result from the remaining digits. Repeat the process until the number you have left is small. Prove that the number you started from is divisible by 7 iff the resulting number is divisible by 7. Thus the example on the right shows that 86415 is divisible by 7 as 0 is divisible by 7. (I learned this trick a few months ago from [http://www.math.toronto.edu/hovinen/ Bradford Hovinen]).
* Find a similar criterion for divisibility by 17 and for all other divisibilities and indivisibilities.
* Note that the word "indivisibilities" has the largest number of repetitions of a single letter among all words in the English language (7 i's). I've known this fact for years but this is the first time that I'm finding a semi-legitimate use for that word! (It is tied with the word honorificabilitudinitatibus for seven 'i's. You can read more about it here: http://en.wikipedia.org/wiki/Honorificabilitudinitatibus)
|
8641<s>5</s>
10
----
863<s>1</s>
2
---
86<s>1</s>
2
--
8<s>4</s>
8
-
0
|}

Revision as of 16:38, 31 January 2007

In Preparation

The information below is preliminary and cannot be trusted! (v)

Reading

Read chapters 15 and 16 of Gallian's book three times:

  • First time as if you were reading a novel - quickly and without too much attention to detail, just to learn what the main keywords and concepts and goals are.
  • Second time like you were studying for an exam on the subject - slowly and not skipping anything, verifying every little detail.
  • And then a third time, again at a quicker pace, to remind yourself what bigger all those little details are there to paint.

Doing

Solve problems ??? in Chapter 15 of Gallian's book and problems 1, 2, 3#, 9, 10, 11, 12# and ??? in Chapter 16 of the same book, but submit only the solutions the problems marked with a sharp (#).

Due Date

This assignment is due in class on Wednesday February 7, 2007.

Just for Fun

  • Take a large integer and write it in base 10. Cut away the "singles" digit, double it and subtract the result from the remaining digits. Repeat the process until the number you have left is small. Prove that the number you started from is divisible by 7 iff the resulting number is divisible by 7. Thus the example on the right shows that 86415 is divisible by 7 as 0 is divisible by 7. (I learned this trick a few months ago from Bradford Hovinen).
  • Find a similar criterion for divisibility by 17 and for all other divisibilities and indivisibilities.
  • Note that the word "indivisibilities" has the largest number of repetitions of a single letter among all words in the English language (7 i's). I've known this fact for years but this is the first time that I'm finding a semi-legitimate use for that word! (It is tied with the word honorificabilitudinitatibus for seven 'i's. You can read more about it here: http://en.wikipedia.org/wiki/Honorificabilitudinitatibus)
86415
  10
----
8631
  2
---
861
 2
--
84
8
-
0