06-240/Homework Assignment 4 - Revision history

John.koziar: Added bit about honorificabilitudinitatibus.

2006-10-05T21:11:44Z

Added bit about honorificabilitudinitatibus.

← Older revision		Revision as of 17:11, 5 October 2006
Line 12:		Line 12:
	* 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 days ago from [http://www.math.toronto.edu/hovinen/ Bradford Hovinen]).		* 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 days 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.		* 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!		* 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>		8641<s>5</s>

Drorbn at 16:05, 5 October 2006

2006-10-05T16:05:11Z

← Older revision		Revision as of 12:05, 5 October 2006
Line 5:		Line 5:
	* '''Solve''' problems 3, 8, 9, 10 and 11 on pages 41-42, but submit only your solutions of problems 8 and 9.		* '''Solve''' problems 3, 8, 9, 10 and 11 on pages 41-42, but submit only your solutions of problems 8 and 9.

	* '''Solve''' problems 1, 2, 4, 5, 9 and 16 on page 34, but submit only your solutions of problems 4, 5 and 9.		* '''Solve''' problems 1, 2, 4, 5, 9 and 16 on page 53-56, but submit only your solutions of problems 4, 5 and 9.

	{\|		{\|

Drorbn at 11:58, 5 October 2006

2006-10-05T11:58:04Z

← Older revision		Revision as of 07:58, 5 October 2006
Line 11:		Line 11:
	\|'''Just for Fun.'''		\|'''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 days ago from [http://www.math.toronto.edu/hovinen/ Bradford Hovinen]).		* 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 days ago from [http://www.math.toronto.edu/hovinen/ Bradford Hovinen]).
	* Find a similar criterion for divisibility by 17 and for all other divisibilities.		* Find a similar criterion for divisibility by 17 and for all other divisibilities and indivisibilities.
	* Note that the word "~~divisibilities~~" has the largest number of repetitions of a single letter among all words in the English language (6 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!		* 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!
	\|		\|
	8641<s>5</s>		8641<s>5</s>

Mc: Correct spelling of repetitions

2006-10-05T10:29:34Z

Correct spelling of repetitions

← Older revision		Revision as of 06:29, 5 October 2006
Line 12:		Line 12:
	* 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 days ago from [http://www.math.toronto.edu/hovinen/ Bradford Hovinen]).		* 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 days ago from [http://www.math.toronto.edu/hovinen/ Bradford Hovinen]).
	* Find a similar criterion for divisibility by 17 and for all other divisibilities.		* Find a similar criterion for divisibility by 17 and for all other divisibilities.
	* Note that the word "divisibilities" has the largest number of ~~repeatitions~~ of a single letter among all words in the English language (6 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!		* Note that the word "divisibilities" has the largest number of repetitions of a single letter among all words in the English language (6 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!
	\|		\|
	8641<s>5</s>		8641<s>5</s>

Drorbn at 00:03, 5 October 2006

2006-10-05T00:03:24Z

← Older revision		Revision as of 20:03, 4 October 2006
Line 3:		Line 3:
	* '''Read''' sections 1.5 through 1.7 in our textbook. Remember that reading math isn't like reading a novel! If you read a novel and miss a few details most likely you'll still understand the novel. But if you miss a few details in a math text, often you'll miss everything that follows. So reading math takes reading and rereading and rerereading and a lot of thought about what you've read.		* '''Read''' sections 1.5 through 1.7 in our textbook. Remember that reading math isn't like reading a novel! If you read a novel and miss a few details most likely you'll still understand the novel. But if you miss a few details in a math text, often you'll miss everything that follows. So reading math takes reading and rereading and rerereading and a lot of thought about what you've read.

	* '''Solve''' problems ~~1-5~~ on pages 32-34, but submit only ~~the~~ ~~last part~~ of ~~each~~ ~~problem~~.		* '''Solve''' problems 3, 8, 9, 10 and 11 on pages 41-42, but submit only your solutions of problems 8 and 9.

	* '''Solve''' problems ~~6-10~~ on page 34, but submit only your ~~solution~~ of ~~problem~~ 10.		* '''Solve''' problems 1, 2, 4, 5, 9 and 16 on page 34, but submit only your solutions of problems 4, 5 and 9.

	{\|		{\|

Drorbn at 23:40, 4 October 2006

2006-10-04T23:40:47Z

← Older revision		Revision as of 19:40, 4 October 2006
Line 1:		Line 1:
	{{06-240/Navigation}}		{{06-240/Navigation}}

	* Read sections 1.5 through 1.7 in our textbook. Remember that reading math isn't like reading a novel! If you read a novel and miss a few details most likely you'll still understand the novel. But if you miss a few details in a math text, often you'll miss everything that follows. So reading math takes reading and rereading and rerereading and a lot of thought about what you've read.		* '''Read''' sections 1.5 through 1.7 in our textbook. Remember that reading math isn't like reading a novel! If you read a novel and miss a few details most likely you'll still understand the novel. But if you miss a few details in a math text, often you'll miss everything that follows. So reading math takes reading and rereading and rerereading and a lot of thought about what you've read.

	* Solve problems 1-5 on pages 32-34, but submit only the last part of each problem.		* '''Solve''' problems 1-5 on pages 32-34, but submit only the last part of each problem.

	* Solve problems 6-10 on page 34, but submit only your solution of problem 10.		* '''Solve''' problems 6-10 on page 34, but submit only your solution of problem 10.

	{\|		{\|
Line 12:		Line 12:
	* 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 days ago from [http://www.math.toronto.edu/hovinen/ Bradford Hovinen]).		* 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 days ago from [http://www.math.toronto.edu/hovinen/ Bradford Hovinen]).
	* Find a similar criterion for divisibility by 17 and for all other divisibilities.		* Find a similar criterion for divisibility by 17 and for all other divisibilities.
	* Note that the word "divisibilities" has the largest number of repeatitions of a single letter among all words in the English language (5 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!		* Note that the word "divisibilities" has the largest number of repeatitions of a single letter among all words in the English language (6 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!
	\|		\|
	8641<s>5</s>		8641<s>5</s>

Drorbn at 23:34, 4 October 2006

2006-10-04T23:34:03Z

← Older revision		Revision as of 19:34, 4 October 2006
Line 12:		Line 12:
	* 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 days ago from [http://www.math.toronto.edu/hovinen/ Bradford Hovinen]).		* 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 days ago from [http://www.math.toronto.edu/hovinen/ Bradford Hovinen]).
	* Find a similar criterion for divisibility by 17 and for all other divisibilities.		* Find a similar criterion for divisibility by 17 and for all other divisibilities.
	* Note that the word "divisibilities" has the largest number of repeatitions of a single letter of all words in the English language (5 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!		* Note that the word "divisibilities" has the largest number of repeatitions of a single letter among all words in the English language (5 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!
	\|		\|
	8641<s>5</s>		8641<s>5</s>

Drorbn at 23:32, 4 October 2006

2006-10-04T23:32:07Z

New page

{{06-240/Navigation}}

* Read sections 1.5 through 1.7 in our textbook. Remember that reading math isn't like reading a novel! If you read a novel and miss a few details most likely you'll still understand the novel. But if you miss a few details in a math text, often you'll miss everything that follows. So reading math takes reading and rereading and rerereading and a lot of thought about what you've read.

* Solve problems 1-5 on pages 32-34, but submit only the last part of each problem.

* Solve problems 6-10 on page 34, but submit only your solution of problem 10.

{|
|-
|'''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 days ago from [http://www.math.toronto.edu/hovinen/ Bradford Hovinen]).
* Find a similar criterion for divisibility by 17 and for all other divisibilities.
* Note that the word "divisibilities" has the largest number of repeatitions of a single letter of all words in the English language (5 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!
|
8641<s>5</s>
10
----
863<s>1</s>
2
---
86<s>1</s>
2
--
8<s>4</s>
8
-
0
|}