<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.ubc.ca/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=PeterDabrowski</id>
	<title>UBC Wiki - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.ubc.ca/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=PeterDabrowski"/>
	<link rel="alternate" type="text/html" href="https://wiki.ubc.ca/Special:Contributions/PeterDabrowski"/>
	<updated>2026-05-13T15:08:13Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.43.8</generator>
	<entry>
		<id>https://wiki.ubc.ca/index.php?title=Course:MATH110/Archive/2010-2011/003/Groups/Group_15/Homework_4&amp;diff=56521</id>
		<title>Course:MATH110/Archive/2010-2011/003/Groups/Group 15/Homework 4</title>
		<link rel="alternate" type="text/html" href="https://wiki.ubc.ca/index.php?title=Course:MATH110/Archive/2010-2011/003/Groups/Group_15/Homework_4&amp;diff=56521"/>
		<updated>2010-10-20T08:30:52Z</updated>

		<summary type="html">&lt;p&gt;PeterDabrowski: /* Question 3 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
== Question 1 ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Five persons named their pets after each other. From the following clues, can you decide which pet belongs to Suzan&#039;s mother? Tosh owns a cat, Bianca owns a frog. Jaela owns a parrot. Jun owns a snake. Suzan is the name of the frog. The cat is named Jun. The name by which they call the turtle is the name of the woman whose pet is Tosh. Finally, Suzan&#039;s mother&#039;s pet is Bianca.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Polya’s law is about ways to tackle a problem successfully so it should apply here as well. Step one: Read the question carefully. The question, when broken down, implicitly asks us two questions in place of one, because they both need to be answered before we can answer the original question. They are:&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
1.	Who is Suzan’s mother?&amp;lt;br&amp;gt;&lt;br /&gt;
2.	What pet does Suzan’s mother own? (which is also the “ultimate” question)&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
From reading the question we are already given a useful clue. That is, Suzan’s mother, must not be Suzan. We can forget about Suzan and narrow the list of five candidates down to four (though this doesn&#039;t prove particularly useful for the problem at hand as you will be able to see). We then work down the list of other clues, basically taking them, a better description wanting, at face value (and easy, too!). By simple logic we know that Suzan’s pet is a turtle (because it is the only pet left without an owner). So we get the following data in the form of a sorted table (Polya’s Step 2: Plan and map out your strategy in a chart, table, graph, etc.). &amp;lt;br&amp;gt;&lt;br /&gt;
[[File:Picture1.png]]&lt;br /&gt;
&lt;br /&gt;
We then try to find out the name of Suzan’s turtle. It is the name of the person whose pet is called Tosh. Tosh can be Jaela’s parrot or Jun’s snake, but not Tosh’s cat nor Bianca’s frog. (It cannot be Suzan’s turtle either unless the question is playing tricks with our head... A rather dumb trick that would be too, wouldn’t it?) So, if we express this in our table:&amp;lt;br&amp;gt;&lt;br /&gt;
[[File:Picture2.png]]&lt;br /&gt;
&lt;br /&gt;
So, is it Jaela or Jun? Do we have enough data to determine that yet? ( Step 1: Identify if enough data is given to solve the problem) Turns out we do. Jun cannot be Suzan’s turtle’s name, because we already know that Tosh’s cat is called Jun. Therefore, the turtle’s name must be Jaela.&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
That leaves two more unknowns on our table to be determined: the names of Jaela’s parrot and Jun’s snake. They can only be either Tosh / Bianca (because that’s the only two names left – simple!) To find the next clue, we re-visit the original clues – it is important to revisit the question since as you are reading anything, as more information emerges the original material seems to present new meanings as you read it again because now you can read into deeper layers of meaning with additional perspective. So, since the turtle’s name is also the name of the woman who’s pet is Tosh, and Jaela being the turtle’s name, we conclude that the name of Jaela’s parrot is Tosh. That leaves Jun’s pet, whose name must be Bianca.&amp;lt;br&amp;gt;&lt;br /&gt;
[[File:Picture3.png]]&lt;br /&gt;
&lt;br /&gt;
I believe you can now confidently answer the original question, which is “what pet belongs to Suzan’s mother”. We know from the beginning that Suzan’s mother’s pet is Bianca. When we look for Bianca in the table we’ve drawn up to tackle the problem, we can answer with a lot of confidence that Suzan’s mother is Jun, and perhaps more importantly (to answer the question directly), Suzan’s mother’s pet is a snake (&amp;quot;don&#039;t mess with him&amp;quot;)...apparently a boy snake with a girly name!&lt;br /&gt;
&lt;br /&gt;
== Question 2 ==&lt;br /&gt;
&lt;br /&gt;
Bohao, Tim, Dylan, Chan and Stewart&lt;br /&gt;
&lt;br /&gt;
5 players&lt;br /&gt;
&lt;br /&gt;
3 of them are right handed&lt;br /&gt;
2 of them are left handed&lt;br /&gt;
&lt;br /&gt;
3 of them are under 2m &lt;br /&gt;
2 of them are over 2m&lt;br /&gt;
&lt;br /&gt;
We are looking for the centre player who is left handed and also over 2m.&lt;br /&gt;
&lt;br /&gt;
-Tim or Chan must be right handed, because Dylan and Bohao are both right handed and Stewart is left handed.&lt;br /&gt;
-Bohao is over 2m tall so this means that either Dylan or Tim must be the same height as Chan and Stewart who are both under 2m.&lt;br /&gt;
-You can already see a common trend developing, the fact that we are trying to find both the variables for Tim&#039;s height as well as his handedness.&lt;br /&gt;
-This then narrows down to Dylan and TIm to be over 2m&lt;br /&gt;
-Dylan is right handed though&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
This leads us to the conclusion that Tim is the centre player because he is the only valid option, Dylan who is over 2m is right handed and therefor does not fit the description.&lt;br /&gt;
&lt;br /&gt;
== Question 3 ==&lt;br /&gt;
&lt;br /&gt;
Adam, Bobo, Charles, Ed, Hassan, Jason, Mathieu, Pascal, and Sung have formed a basketball team. The facts are in BOLD and their interpretations after them:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Adam does not like the cather,&#039;&#039;&#039;&lt;br /&gt;
-The catcher isnt adam&lt;br /&gt;
&#039;&#039;&#039;Ed&#039;s sister is engaged to the second baseman,&#039;&#039;&#039;&lt;br /&gt;
-ED isnt the second baseman&lt;br /&gt;
&#039;&#039;&#039;The center fielder is taller than the right fielder,&#039;&#039;&#039;&lt;br /&gt;
-Look at last point&lt;br /&gt;
&#039;&#039;&#039;Hassan and the third baseman live in the same building,&#039;&#039;&#039;&lt;br /&gt;
-Hassan aint the third baseman&lt;br /&gt;
&#039;&#039;&#039;Pascal and Charles each won $20 from the pitcher at a poker game,&#039;&#039;&#039;&lt;br /&gt;
-Pascal and Charles are not the pitcher&lt;br /&gt;
&#039;&#039;&#039;Ed and the outfielders play cards during their free time,&#039;&#039;&#039;&lt;br /&gt;
-ED is not an outfielder&lt;br /&gt;
&#039;&#039;&#039;The pitcher&#039;s wife is the third baseman&#039;s sister,&#039;&#039;&#039;&lt;br /&gt;
-The pitcher is married&lt;br /&gt;
&#039;&#039;&#039;All the battery and infield except Charles, Hassan and Adam are shorter than Sung,&#039;&#039;&#039;&lt;br /&gt;
-Charles, Hassan and Adam are not the outfielder but could be the battery or infield&lt;br /&gt;
&#039;&#039;&#039;Pascal, Adam and the shortstop lost $100 each at the race track,&#039;&#039;&#039;&lt;br /&gt;
-Pascal and Adam are not the shortstop&lt;br /&gt;
&#039;&#039;&#039;The second baseman beat Pascal, Hassan, Bobo and the catcher at billiards,&#039;&#039;&#039;&lt;br /&gt;
-So Pascal, Hassan and Bobo are not the second basemen and the catcher&lt;br /&gt;
&#039;&#039;&#039;Sung is in the process of getting a divorce,&#039;&#039;&#039;&lt;br /&gt;
-Sung is married&lt;br /&gt;
&#039;&#039;&#039;The catcher and the third baseman each have two legitimate children,&#039;&#039;&#039;&lt;br /&gt;
-They are both married&lt;br /&gt;
&#039;&#039;&#039;Ed, Pascal, Jason, the right fielder and the center fielder are bachelors, the others are all married,&#039;&#039;&#039;&lt;br /&gt;
-Ed, Pascal, Jason right fielder, center fielder are all not married.&lt;br /&gt;
-Ed, Pascal, Jason are neither the right fielder or center fielder.&lt;br /&gt;
-The pitcher the catcher are married&lt;br /&gt;
-Ed is not the third basemen, the pitcher, or the catcher&lt;br /&gt;
-Jason is not the third basemen, the pitcher, or the catcher&lt;br /&gt;
-Sung is not the right outfield, the out field center, or second basemen &lt;br /&gt;
&#039;&#039;&#039;The shortstop, the third baseman and Bobo all attended the fight,&#039;&#039;&#039;&lt;br /&gt;
-Bobo is neither the shortstop or the third baseman&lt;br /&gt;
&#039;&#039;&#039;Mathieu is the shortest player of the team,&#039;&#039;&#039;&lt;br /&gt;
-So he is obviously not the center fielder&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If you plot all of the above on a table you find out that:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Catcher = Charles&lt;br /&gt;
First Baseman = Ed&lt;br /&gt;
Center Fielder = Bobo&lt;br /&gt;
Pitcher = Hassan&lt;br /&gt;
Second Baseman = Jason&lt;br /&gt;
Right Fielder  = Mathieu&lt;br /&gt;
Left Fielder = Pascal&lt;br /&gt;
Shortstop = Sung&lt;br /&gt;
3rd Baseman = Adam&lt;br /&gt;
&lt;br /&gt;
== Question 4 ==&lt;br /&gt;
&#039;&#039;&#039;Six players - Petra, Carla, Janet, Sandra, Li and Fernanda - are competing in a chess tournament over a period of five days. Each player plays each of the others once. Three matches are played simultaneously during each of the five days. The first day, Carla beats Petra after 36 moves. The second day, Carla was again victorious when Janet failed to complete 40 moves within the required time limit. The third day had the most exciting match of all when Janet declared that she would checkmate Li in 8 moves and succeeded in doing so. On the fourth day, Petra defeated Sandra. Who played against Fernanda on the fifth day?&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
1). First of all we sort out the details given by the question:&lt;br /&gt;
6 players-&amp;gt; P, C, J, S, L and F.&lt;br /&gt;
&lt;br /&gt;
Tournament= 5 days&lt;br /&gt;
&lt;br /&gt;
-&amp;gt;each player plays each of others ONCE.&lt;br /&gt;
&lt;br /&gt;
-&amp;gt;3 matches are played in 5 days&lt;br /&gt;
&lt;br /&gt;
Therefore, we know that 2 people play against each other in each day.&lt;br /&gt;
&lt;br /&gt;
1st day: &#039;&#039;&#039;C&#039;&#039;&#039; vs P  ( C wins)  J,S,L,F&lt;br /&gt;
&lt;br /&gt;
2nd day: &#039;&#039;&#039;C&#039;&#039;&#039; vs J  ( C wins)  P,S,L,F&lt;br /&gt;
&lt;br /&gt;
3rd day: &#039;&#039;&#039;J&#039;&#039;&#039; vs L  (J wins)   P,C,S,F&lt;br /&gt;
 &lt;br /&gt;
4th day: &#039;&#039;&#039;P&#039;&#039;&#039; vs S  (P wins)   C,J,L,F &lt;br /&gt;
&lt;br /&gt;
5th day: F vs ???&lt;br /&gt;
&lt;br /&gt;
Then, we use the info given, try to pair the unknown ones up:&lt;br /&gt;
&lt;br /&gt;
1st day: CP, ( JS, &#039;&#039;L&#039;&#039;F ) &lt;br /&gt;
&lt;br /&gt;
2nd day: CJ, ( PL, &#039;&#039;S&#039;&#039;F) &lt;br /&gt;
&lt;br /&gt;
3rd day: JL, ( &#039;&#039;P&#039;&#039;F, CS)&lt;br /&gt;
&lt;br /&gt;
4th day: PS, ( CL, &#039;&#039;J&#039;&#039;F)&lt;br /&gt;
&lt;br /&gt;
5th day: F havn&#039;t played with C according to the info above.&lt;br /&gt;
&lt;br /&gt;
Therefore, Fernanda is playing against &#039;&#039;&#039;Carla&#039;&#039;&#039; on the 5th day.&lt;br /&gt;
&lt;br /&gt;
== Question 5 ==&lt;br /&gt;
Homer finally had a week off from his job at the nuclear power plant and intended to spend all nine days of his vacation (Saturday through the following Sunday) sleeping late. But his plans were foiled by some of the people who work in his neighbourhood.&lt;br /&gt;
On Saturday, his first morning off, Homer was wakened by the doorbell; it was a salesman of magazine subscriptions.&lt;br /&gt;
On Sunday, the barking of the neighbour&#039;s dog abruptly ended Homer&#039;s sleep.&lt;br /&gt;
On Monday, he was again wakened by the persistent salesman but was able to fall asleep again, only to be disturbed by the construction workers next door.&lt;br /&gt;
In fact, the salesman, the neighbour&#039;s dog and the construction workers combined to wake Homer at least once each day of his vacation, with only one exception.&lt;br /&gt;
The salesman woke him again on Wednesday; the construction workers on the second Saturday; the dog on Wednesday and on the final Sunday.&lt;br /&gt;
No one of the three noisemakers was quiet for three consecutive days; but yet, no pair of them made noise on more than one day during Homer&#039;s vacation. On which day of his holiday was Homer actually able to sleep late?&lt;br /&gt;
First, We notice that:&lt;br /&gt;
Saturday --&amp;gt; Salesman&lt;br /&gt;
Sunday --&amp;gt; Dog&lt;br /&gt;
Monday --&amp;gt; Salesman/Construction&lt;br /&gt;
Tuesday --&amp;gt; ? Unknown?	&lt;br /&gt;
Wednesday - Salesman/Dog&lt;br /&gt;
Thursday --&amp;gt; ? Unknown?	&lt;br /&gt;
Friday --&amp;gt; ?unknown?&lt;br /&gt;
Saturday --&amp;gt; Construction&lt;br /&gt;
Sunday --&amp;gt; Dog&lt;br /&gt;
&lt;br /&gt;
By following the rule : “No one of the three noisemakers was quiet for three consecutive days” and “no pair of them made noise on more than one day”  Tuesday, Thursday and friday are all unknown. &lt;br /&gt;
As we can see we could put it like below. &lt;br /&gt;
&lt;br /&gt;
Saturday --&amp;gt; Salesman&lt;br /&gt;
Sunday --&amp;gt; Dog&lt;br /&gt;
Monday --&amp;gt; Salesman + Construction&lt;br /&gt;
Tuesday --&amp;gt;  Sleep in.&lt;br /&gt;
Wednesday - Salesman + Dog&lt;br /&gt;
Thursday --&amp;gt; Construction	&lt;br /&gt;
Friday --&amp;gt;  Salesman&lt;br /&gt;
Saturday --&amp;gt; Construction&lt;br /&gt;
Sunday --&amp;gt; Dog&lt;/div&gt;</summary>
		<author><name>PeterDabrowski</name></author>
	</entry>
	<entry>
		<id>https://wiki.ubc.ca/index.php?title=Course:MATH110/Archive/2010-2011/003/Groups/Group_15/Homework_4&amp;diff=56519</id>
		<title>Course:MATH110/Archive/2010-2011/003/Groups/Group 15/Homework 4</title>
		<link rel="alternate" type="text/html" href="https://wiki.ubc.ca/index.php?title=Course:MATH110/Archive/2010-2011/003/Groups/Group_15/Homework_4&amp;diff=56519"/>
		<updated>2010-10-20T08:29:00Z</updated>

		<summary type="html">&lt;p&gt;PeterDabrowski: /* Question 3 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&lt;br /&gt;
== Question 1 ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Five persons named their pets after each other. From the following clues, can you decide which pet belongs to Suzan&#039;s mother? Tosh owns a cat, Bianca owns a frog. Jaela owns a parrot. Jun owns a snake. Suzan is the name of the frog. The cat is named Jun. The name by which they call the turtle is the name of the woman whose pet is Tosh. Finally, Suzan&#039;s mother&#039;s pet is Bianca.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
Polya’s law is about ways to tackle a problem successfully so it should apply here as well. Step one: Read the question carefully. The question, when broken down, implicitly asks us two questions in place of one, because they both need to be answered before we can answer the original question. They are:&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
1.	Who is Suzan’s mother?&amp;lt;br&amp;gt;&lt;br /&gt;
2.	What pet does Suzan’s mother own? (which is also the “ultimate” question)&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
From reading the question we are already given a useful clue. That is, Suzan’s mother, must not be Suzan. We can forget about Suzan and narrow the list of five candidates down to four (though this doesn&#039;t prove particularly useful for the problem at hand as you will be able to see). We then work down the list of other clues, basically taking them, a better description wanting, at face value (and easy, too!). By simple logic we know that Suzan’s pet is a turtle (because it is the only pet left without an owner). So we get the following data in the form of a sorted table (Polya’s Step 2: Plan and map out your strategy in a chart, table, graph, etc.). &amp;lt;br&amp;gt;&lt;br /&gt;
[[File:Picture1.png]]&lt;br /&gt;
&lt;br /&gt;
We then try to find out the name of Suzan’s turtle. It is the name of the person whose pet is called Tosh. Tosh can be Jaela’s parrot or Jun’s snake, but not Tosh’s cat nor Bianca’s frog. (It cannot be Suzan’s turtle either unless the question is playing tricks with our head... A rather dumb trick that would be too, wouldn’t it?) So, if we express this in our table:&amp;lt;br&amp;gt;&lt;br /&gt;
[[File:Picture2.png]]&lt;br /&gt;
&lt;br /&gt;
So, is it Jaela or Jun? Do we have enough data to determine that yet? ( Step 1: Identify if enough data is given to solve the problem) Turns out we do. Jun cannot be Suzan’s turtle’s name, because we already know that Tosh’s cat is called Jun. Therefore, the turtle’s name must be Jaela.&amp;lt;br&amp;gt;&lt;br /&gt;
&lt;br /&gt;
That leaves two more unknowns on our table to be determined: the names of Jaela’s parrot and Jun’s snake. They can only be either Tosh / Bianca (because that’s the only two names left – simple!) To find the next clue, we re-visit the original clues – it is important to revisit the question since as you are reading anything, as more information emerges the original material seems to present new meanings as you read it again because now you can read into deeper layers of meaning with additional perspective. So, since the turtle’s name is also the name of the woman who’s pet is Tosh, and Jaela being the turtle’s name, we conclude that the name of Jaela’s parrot is Tosh. That leaves Jun’s pet, whose name must be Bianca.&amp;lt;br&amp;gt;&lt;br /&gt;
[[File:Picture3.png]]&lt;br /&gt;
&lt;br /&gt;
I believe you can now confidently answer the original question, which is “what pet belongs to Suzan’s mother”. We know from the beginning that Suzan’s mother’s pet is Bianca. When we look for Bianca in the table we’ve drawn up to tackle the problem, we can answer with a lot of confidence that Suzan’s mother is Jun, and perhaps more importantly (to answer the question directly), Suzan’s mother’s pet is a snake (&amp;quot;don&#039;t mess with him&amp;quot;)...apparently a boy snake with a girly name!&lt;br /&gt;
&lt;br /&gt;
== Question 2 ==&lt;br /&gt;
&lt;br /&gt;
Bohao, Tim, Dylan, Chan and Stewart&lt;br /&gt;
&lt;br /&gt;
5 players&lt;br /&gt;
&lt;br /&gt;
3 of them are right handed&lt;br /&gt;
2 of them are left handed&lt;br /&gt;
&lt;br /&gt;
3 of them are under 2m &lt;br /&gt;
2 of them are over 2m&lt;br /&gt;
&lt;br /&gt;
We are looking for the centre player who is left handed and also over 2m.&lt;br /&gt;
&lt;br /&gt;
-Tim or Chan must be right handed, because Dylan and Bohao are both right handed and Stewart is left handed.&lt;br /&gt;
-Bohao is over 2m tall so this means that either Dylan or Tim must be the same height as Chan and Stewart who are both under 2m.&lt;br /&gt;
-You can already see a common trend developing, the fact that we are trying to find both the variables for Tim&#039;s height as well as his handedness.&lt;br /&gt;
-This then narrows down to Dylan and TIm to be over 2m&lt;br /&gt;
-Dylan is right handed though&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
This leads us to the conclusion that Tim is the centre player because he is the only valid option, Dylan who is over 2m is right handed and therefor does not fit the description.&lt;br /&gt;
&lt;br /&gt;
== Question 3 ==&lt;br /&gt;
&lt;br /&gt;
Adam, Bobo, Charles, Ed, Hassan, Jason, Mathieu, Pascal, and Sung have formed a basketball team. The facts are in BOLD and their interpretations below them:&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Adam does not like the cather,&#039;&#039;&#039;&lt;br /&gt;
-The catcher isnt adam&lt;br /&gt;
&#039;&#039;&#039;Ed&#039;s sister is engaged to the second baseman,&#039;&#039;&#039;&lt;br /&gt;
-ED isnt the second baseman&lt;br /&gt;
&#039;&#039;&#039;The center fielder is taller than the right fielder,&#039;&#039;&#039;&lt;br /&gt;
-Look at last point&lt;br /&gt;
&#039;&#039;&#039;Hassan and the third baseman live in the same building,&#039;&#039;&#039;&lt;br /&gt;
-Hassan aint the third baseman&lt;br /&gt;
&#039;&#039;&#039;Pascal and Charles each won $20 from the pitcher at a poker game,&#039;&#039;&#039;&lt;br /&gt;
-Pascal and Charles are not the pitcher&lt;br /&gt;
&#039;&#039;&#039;Ed and the outfielders play cards during their free time,&#039;&#039;&#039;&lt;br /&gt;
-ED is not an outfielder&lt;br /&gt;
&#039;&#039;&#039;The pitcher&#039;s wife is the third baseman&#039;s sister,&#039;&#039;&#039;&lt;br /&gt;
-The pitcher is married&lt;br /&gt;
&#039;&#039;&#039;All the battery and infield except Charles, Hassan and Adam are shorter than Sung,&#039;&#039;&#039;&lt;br /&gt;
-Charles, Hassan and Adam are not the outfielder but could be the battery or infield&lt;br /&gt;
&#039;&#039;&#039;Pascal, Adam and the shortstop lost $100 each at the race track,&#039;&#039;&#039;&lt;br /&gt;
-Pascal and Adam are not the shortstop&lt;br /&gt;
&#039;&#039;&#039;The second baseman beat Pascal, Hassan, Bobo and the catcher at billiards,&#039;&#039;&#039;&lt;br /&gt;
-So Pascal, Hassan and Bobo are not the second basemen and the catcher&lt;br /&gt;
&#039;&#039;&#039;Sung is in the process of getting a divorce,&#039;&#039;&#039;&lt;br /&gt;
-Sung is married&lt;br /&gt;
&#039;&#039;&#039;The catcher and the third baseman each have two legitimate children,&#039;&#039;&#039;&lt;br /&gt;
-They are both married&lt;br /&gt;
&#039;&#039;&#039;Ed, Pascal, Jason, the right fielder and the center fielder are bachelors, the others are all married,&#039;&#039;&#039;&lt;br /&gt;
-Ed, Pascal, Jason right fielder, center fielder are all not married.&lt;br /&gt;
-Ed, Pascal, Jason are neither the right fielder or center fielder.&lt;br /&gt;
-The pitcher the catcher are married&lt;br /&gt;
  - Ed is not the third basemen, the pitcher, or the catcher&lt;br /&gt;
  - Jason is not the third basemen, the pitcher, or the catcher&lt;br /&gt;
  - Sung is not the right outfield, the out field center, or second basemen &lt;br /&gt;
&#039;&#039;&#039;The shortstop, the third baseman and Bobo all attended the fight,&#039;&#039;&#039;&lt;br /&gt;
-Bobo is neither the shortstop or the third baseman&lt;br /&gt;
&#039;&#039;&#039;Mathieu is the shortest player of the team,&#039;&#039;&#039;&lt;br /&gt;
-So he is obviously not the center fielder&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
If you plot all of the above on a table you find out that:&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
Catcher = Charles&lt;br /&gt;
First Baseman = Ed&lt;br /&gt;
Center Fielder = Bobo&lt;br /&gt;
Pitcher = Hassan&lt;br /&gt;
Second Baseman = Jason&lt;br /&gt;
Right Fielder  = Mathieu&lt;br /&gt;
Left Fielder = Pascal&lt;br /&gt;
Shortstop = Sung&lt;br /&gt;
3rd Baseman = Adam&lt;br /&gt;
&lt;br /&gt;
== Question 4 ==&lt;br /&gt;
&#039;&#039;&#039;Six players - Petra, Carla, Janet, Sandra, Li and Fernanda - are competing in a chess tournament over a period of five days. Each player plays each of the others once. Three matches are played simultaneously during each of the five days. The first day, Carla beats Petra after 36 moves. The second day, Carla was again victorious when Janet failed to complete 40 moves within the required time limit. The third day had the most exciting match of all when Janet declared that she would checkmate Li in 8 moves and succeeded in doing so. On the fourth day, Petra defeated Sandra. Who played against Fernanda on the fifth day?&#039;&#039;&#039; &lt;br /&gt;
&lt;br /&gt;
1). First of all we sort out the details given by the question:&lt;br /&gt;
6 players-&amp;gt; P, C, J, S, L and F.&lt;br /&gt;
&lt;br /&gt;
Tournament= 5 days&lt;br /&gt;
&lt;br /&gt;
-&amp;gt;each player plays each of others ONCE.&lt;br /&gt;
&lt;br /&gt;
-&amp;gt;3 matches are played in 5 days&lt;br /&gt;
&lt;br /&gt;
Therefore, we know that 2 people play against each other in each day.&lt;br /&gt;
&lt;br /&gt;
1st day: &#039;&#039;&#039;C&#039;&#039;&#039; vs P  ( C wins)  J,S,L,F&lt;br /&gt;
&lt;br /&gt;
2nd day: &#039;&#039;&#039;C&#039;&#039;&#039; vs J  ( C wins)  P,S,L,F&lt;br /&gt;
&lt;br /&gt;
3rd day: &#039;&#039;&#039;J&#039;&#039;&#039; vs L  (J wins)   P,C,S,F&lt;br /&gt;
 &lt;br /&gt;
4th day: &#039;&#039;&#039;P&#039;&#039;&#039; vs S  (P wins)   C,J,L,F &lt;br /&gt;
&lt;br /&gt;
5th day: F vs ???&lt;br /&gt;
&lt;br /&gt;
Then, we use the info given, try to pair the unknown ones up:&lt;br /&gt;
&lt;br /&gt;
1st day: CP, ( JS, &#039;&#039;L&#039;&#039;F ) &lt;br /&gt;
&lt;br /&gt;
2nd day: CJ, ( PL, &#039;&#039;S&#039;&#039;F) &lt;br /&gt;
&lt;br /&gt;
3rd day: JL, ( &#039;&#039;P&#039;&#039;F, CS)&lt;br /&gt;
&lt;br /&gt;
4th day: PS, ( CL, &#039;&#039;J&#039;&#039;F)&lt;br /&gt;
&lt;br /&gt;
5th day: F havn&#039;t played with C according to the info above.&lt;br /&gt;
&lt;br /&gt;
Therefore, Fernanda is playing against &#039;&#039;&#039;Carla&#039;&#039;&#039; on the 5th day.&lt;br /&gt;
&lt;br /&gt;
== Question 5 ==&lt;br /&gt;
Homer finally had a week off from his job at the nuclear power plant and intended to spend all nine days of his vacation (Saturday through the following Sunday) sleeping late. But his plans were foiled by some of the people who work in his neighbourhood.&lt;br /&gt;
On Saturday, his first morning off, Homer was wakened by the doorbell; it was a salesman of magazine subscriptions.&lt;br /&gt;
On Sunday, the barking of the neighbour&#039;s dog abruptly ended Homer&#039;s sleep.&lt;br /&gt;
On Monday, he was again wakened by the persistent salesman but was able to fall asleep again, only to be disturbed by the construction workers next door.&lt;br /&gt;
In fact, the salesman, the neighbour&#039;s dog and the construction workers combined to wake Homer at least once each day of his vacation, with only one exception.&lt;br /&gt;
The salesman woke him again on Wednesday; the construction workers on the second Saturday; the dog on Wednesday and on the final Sunday.&lt;br /&gt;
No one of the three noisemakers was quiet for three consecutive days; but yet, no pair of them made noise on more than one day during Homer&#039;s vacation. On which day of his holiday was Homer actually able to sleep late?&lt;br /&gt;
First, We notice that:&lt;br /&gt;
Saturday --&amp;gt; Salesman&lt;br /&gt;
Sunday --&amp;gt; Dog&lt;br /&gt;
Monday --&amp;gt; Salesman/Construction&lt;br /&gt;
Tuesday --&amp;gt; ? Unknown?	&lt;br /&gt;
Wednesday - Salesman/Dog&lt;br /&gt;
Thursday --&amp;gt; ? Unknown?	&lt;br /&gt;
Friday --&amp;gt; ?unknown?&lt;br /&gt;
Saturday --&amp;gt; Construction&lt;br /&gt;
Sunday --&amp;gt; Dog&lt;br /&gt;
&lt;br /&gt;
By following the rule : “No one of the three noisemakers was quiet for three consecutive days” and “no pair of them made noise on more than one day”  Tuesday, Thursday and friday are all unknown. &lt;br /&gt;
As we can see we could put it like below. &lt;br /&gt;
&lt;br /&gt;
Saturday --&amp;gt; Salesman&lt;br /&gt;
Sunday --&amp;gt; Dog&lt;br /&gt;
Monday --&amp;gt; Salesman + Construction&lt;br /&gt;
Tuesday --&amp;gt;  Sleep in.&lt;br /&gt;
Wednesday - Salesman + Dog&lt;br /&gt;
Thursday --&amp;gt; Construction	&lt;br /&gt;
Friday --&amp;gt;  Salesman&lt;br /&gt;
Saturday --&amp;gt; Construction&lt;br /&gt;
Sunday --&amp;gt; Dog&lt;/div&gt;</summary>
		<author><name>PeterDabrowski</name></author>
	</entry>
	<entry>
		<id>https://wiki.ubc.ca/index.php?title=Course:MATH110/Archive/2010-2011/003/Groups/Group_15&amp;diff=54466</id>
		<title>Course:MATH110/Archive/2010-2011/003/Groups/Group 15</title>
		<link rel="alternate" type="text/html" href="https://wiki.ubc.ca/index.php?title=Course:MATH110/Archive/2010-2011/003/Groups/Group_15&amp;diff=54466"/>
		<updated>2010-10-13T08:32:11Z</updated>

		<summary type="html">&lt;p&gt;PeterDabrowski: /* Question 21 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Group members:&lt;br /&gt;
* Danny Choi&lt;br /&gt;
* Peter David Dabrowski&lt;br /&gt;
* Allie Miller&lt;br /&gt;
* Anabelle Tory&lt;br /&gt;
* Vivian Zhang&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
Homework 3&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 1&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;A bus traveled from the terminal to the airport at an average speed of 30 mi/hr and the trip took an hour and 20 min. The bus then traveled from the airport back to the terminal and again averaged 30 mi/hr. However, the return trip required 80 min. Explain. &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
1hour and 20min is identical to 80min, there is nothing else to explain.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 2&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 3&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 4&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 5&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 6&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 7&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 8&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 9&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 10&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 11&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 12&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;A Manhattan fellow had a girlfriend in the Bronx and a girlfriend in Brooklyn. He decided which girlfriend to visit by arriving randomly at the train station and taking the first of the Bronx or Brooklyn trains that arrived. The trains to Brooklyn and the Bronx each arrived regularly every 10 minutes. Not long after he began his scheme the man&#039;s Bronx girlfriend left him because he rarely visited. Give a (logical) explanation.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The Manhattan fellow likely has a daily schedule along with a set time allotted to visiting his girlfriends. The trains also have a schedule so statistically speaking there will be a point of where both schedules meet up in favor of the Brooklyn train.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 13&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 14&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 15&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Alex says to you, “I&#039;ll bet you any amount of money that if I shuffle this deck of cards, there will always be as many red cards in the first half of the deck as there are black cards in the second half of the deck.” Should you accept his bet?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
That depends if we are using the Jokers in the deck (54 cards), if we are then I would accept his bet, if we are not (52 cards) then I would not accept his bet. This is because if we were using the jokers, they are both black cards so the total ratio of black to red is 28Black to 26Red as a result it is only possible to have a different amount of black cards to red cards in each half of the deck. However if there were no jokers in the deck, then there would be a perfect ratio of 26Black to 26Red cards. If you were to shuffle them and split them in half there will be different amounts of red and black in each stack, however the amount of one color in one stack will always be the same as the opposite color in the opposite stack. The scenario without jokers is explained below.&lt;br /&gt;
&lt;br /&gt;
There are 52 cards in total and &amp;lt;math&amp;gt; \tfrac{52}{2}=26 &amp;lt;/math&amp;gt; cards in each half. Half of all cards are red and half of all cards are black.&lt;br /&gt;
&lt;br /&gt;
In the first half there are &#039;&#039;x&#039;&#039; red cards and &#039;&#039;y&#039;&#039; black cards.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;x&#039;&#039;+&#039;&#039;y&#039;&#039;=26&lt;br /&gt;
&lt;br /&gt;
where&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;x&#039;&#039;=26-&#039;&#039;y&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
and&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;y&#039;&#039;=26-&#039;&#039;x&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
In the second half there are the red cards which are not in the first half 26-&#039;&#039;x&#039;&#039; which is equal to &#039;&#039;y&#039;&#039;. And there are the black cards which are not in the first half 26-&#039;&#039;y&#039;&#039; which is equal to &#039;&#039;x&#039;&#039;. Therefore there will always be as many red cards in the first half of the deck as there are black cards in the second deck.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 16&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 17&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 18&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 19&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 20&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 21&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Sven placed exactly in the middle among all runners in a race. Dan was slower than Sven, in 10th place, and Lars was in 16th place. How many runners were in the race?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
There were 17 runners in the race. This is because Sven must be in less then 10th place (this is given). So assuming that he is in 9th place there are 8 people ahead of him, and because he is exactly in the middle there would have to be 8 people behind him all the way to 17th place (9+8) which would satisfy the given statement that there was somebody in 16th place. It would be impossible for Sven to place any lower then 9th place because then there would not be a 16th place for Lars to take.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 22&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 23&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 24&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 25&#039;&#039;&#039; ==&lt;/div&gt;</summary>
		<author><name>PeterDabrowski</name></author>
	</entry>
	<entry>
		<id>https://wiki.ubc.ca/index.php?title=Course:MATH110/Archive/2010-2011/003/Groups/Group_15&amp;diff=54419</id>
		<title>Course:MATH110/Archive/2010-2011/003/Groups/Group 15</title>
		<link rel="alternate" type="text/html" href="https://wiki.ubc.ca/index.php?title=Course:MATH110/Archive/2010-2011/003/Groups/Group_15&amp;diff=54419"/>
		<updated>2010-10-13T07:48:29Z</updated>

		<summary type="html">&lt;p&gt;PeterDabrowski: /* Question 15 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Group members:&lt;br /&gt;
* Danny Choi&lt;br /&gt;
* Peter David Dabrowski&lt;br /&gt;
* Allie Miller&lt;br /&gt;
* Anabelle Tory&lt;br /&gt;
* Vivian Zhang&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
Homework 3&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 1&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;A bus traveled from the terminal to the airport at an average speed of 30 mi/hr and the trip took an hour and 20 min. The bus then traveled from the airport back to the terminal and again averaged 30 mi/hr. However, the return trip required 80 min. Explain. &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
1hour and 20min is identical to 80min, there is nothing else to explain.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 2&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 3&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 4&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 5&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 6&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 7&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 8&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 9&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 10&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 11&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 12&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;A Manhattan fellow had a girlfriend in the Bronx and a girlfriend in Brooklyn. He decided which girlfriend to visit by arriving randomly at the train station and taking the first of the Bronx or Brooklyn trains that arrived. The trains to Brooklyn and the Bronx each arrived regularly every 10 minutes. Not long after he began his scheme the man&#039;s Bronx girlfriend left him because he rarely visited. Give a (logical) explanation.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The Manhattan fellow likely has a daily schedule along with a set time allotted to visiting his girlfriends. The trains also have a schedule so statistically speaking there will be a point of where both schedules meet up in favor of the Brooklyn train.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 13&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 14&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 15&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Alex says to you, “I&#039;ll bet you any amount of money that if I shuffle this deck of cards, there will always be as many red cards in the first half of the deck as there are black cards in the second half of the deck.” Should you accept his bet?&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
That depends if we are using the Jokers in the deck (54 cards), if we are then I would accept his bet, if we are not (52 cards) then I would not accept his bet. This is because if we were using the jokers, they are both black cards so the total ratio of black to red is 28Black to 26Red as a result it is only possible to have a different amount of black cards to red cards in each half of the deck. However if there were no jokers in the deck, then there would be a perfect ratio of 26Black to 26Red cards. If you were to shuffle them and split them in half there will be different amounts of red and black in each stack, however the amount of one color in one stack will always be the same as the opposite color in the opposite stack. The scenario without jokers is explained below.&lt;br /&gt;
&lt;br /&gt;
There are 52 cards in total and &amp;lt;math&amp;gt; \tfrac{52}{2}=26 &amp;lt;/math&amp;gt; cards in each half. Half of all cards are red and half of all cards are black.&lt;br /&gt;
&lt;br /&gt;
In the first half there are &#039;&#039;x&#039;&#039; red cards and &#039;&#039;y&#039;&#039; black cards.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;x&#039;&#039;+&#039;&#039;y&#039;&#039;=26&lt;br /&gt;
&lt;br /&gt;
where&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;x&#039;&#039;=26-&#039;&#039;y&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
and&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;y&#039;&#039;=26-&#039;&#039;x&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
In the second half there are the red cards which are not in the first half 26-&#039;&#039;x&#039;&#039; which is equal to &#039;&#039;y&#039;&#039;. And there are the black cards which are not in the first half 26-&#039;&#039;y&#039;&#039; which is equal to &#039;&#039;x&#039;&#039;. Therefore there will always be as many red cards in the first half of the deck as there are black cards in the second deck.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 16&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 17&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 18&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 19&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 20&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 21&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 22&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 23&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 24&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 25&#039;&#039;&#039; ==&lt;/div&gt;</summary>
		<author><name>PeterDabrowski</name></author>
	</entry>
	<entry>
		<id>https://wiki.ubc.ca/index.php?title=Course:MATH110/Archive/2010-2011/003/Groups/Group_15&amp;diff=54407</id>
		<title>Course:MATH110/Archive/2010-2011/003/Groups/Group 15</title>
		<link rel="alternate" type="text/html" href="https://wiki.ubc.ca/index.php?title=Course:MATH110/Archive/2010-2011/003/Groups/Group_15&amp;diff=54407"/>
		<updated>2010-10-13T07:37:54Z</updated>

		<summary type="html">&lt;p&gt;PeterDabrowski: /* Question 12 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Group members:&lt;br /&gt;
* Danny Choi&lt;br /&gt;
* Peter David Dabrowski&lt;br /&gt;
* Allie Miller&lt;br /&gt;
* Anabelle Tory&lt;br /&gt;
* Vivian Zhang&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
Homework 3&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 1&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;A bus traveled from the terminal to the airport at an average speed of 30 mi/hr and the trip took an hour and 20 min. The bus then traveled from the airport back to the terminal and again averaged 30 mi/hr. However, the return trip required 80 min. Explain. &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
1hour and 20min is identical to 80min, there is nothing else to explain.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 2&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 3&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 4&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 5&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 6&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 7&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 8&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 9&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 10&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 11&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 12&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;A Manhattan fellow had a girlfriend in the Bronx and a girlfriend in Brooklyn. He decided which girlfriend to visit by arriving randomly at the train station and taking the first of the Bronx or Brooklyn trains that arrived. The trains to Brooklyn and the Bronx each arrived regularly every 10 minutes. Not long after he began his scheme the man&#039;s Bronx girlfriend left him because he rarely visited. Give a (logical) explanation.&#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
The Manhattan fellow likely has a daily schedule along with a set time allotted to visiting his girlfriends. The trains also have a schedule so statistically speaking there will be a point of where both schedules meet up in favor of the Brooklyn train.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 13&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 14&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 15&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 16&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 17&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 18&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 19&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 20&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 21&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 22&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 23&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 24&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 25&#039;&#039;&#039; ==&lt;/div&gt;</summary>
		<author><name>PeterDabrowski</name></author>
	</entry>
	<entry>
		<id>https://wiki.ubc.ca/index.php?title=Course:MATH110/Archive/2010-2011/003/Groups/Group_15&amp;diff=54402</id>
		<title>Course:MATH110/Archive/2010-2011/003/Groups/Group 15</title>
		<link rel="alternate" type="text/html" href="https://wiki.ubc.ca/index.php?title=Course:MATH110/Archive/2010-2011/003/Groups/Group_15&amp;diff=54402"/>
		<updated>2010-10-13T07:34:33Z</updated>

		<summary type="html">&lt;p&gt;PeterDabrowski: /* Question 1 */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Group members:&lt;br /&gt;
* Danny Choi&lt;br /&gt;
* Peter David Dabrowski&lt;br /&gt;
* Allie Miller&lt;br /&gt;
* Anabelle Tory&lt;br /&gt;
* Vivian Zhang&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
----&lt;br /&gt;
&lt;br /&gt;
Homework 3&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 1&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;A bus traveled from the terminal to the airport at an average speed of 30 mi/hr and the trip took an hour and 20 min. The bus then traveled from the airport back to the terminal and again averaged 30 mi/hr. However, the return trip required 80 min. Explain. &#039;&#039;&#039;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
1hour and 20min is identical to 80min, there is nothing else to explain.&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 2&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 3&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 4&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 5&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 6&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 7&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 8&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 9&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 10&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 11&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 12&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 13&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 14&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 15&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 16&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 17&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 18&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 19&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 20&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 21&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 22&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 23&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 24&#039;&#039;&#039; ==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== &#039;&#039;&#039;Question 25&#039;&#039;&#039; ==&lt;/div&gt;</summary>
		<author><name>PeterDabrowski</name></author>
	</entry>
	<entry>
		<id>https://wiki.ubc.ca/index.php?title=User:PeterDabrowski&amp;diff=48302</id>
		<title>User:PeterDabrowski</title>
		<link rel="alternate" type="text/html" href="https://wiki.ubc.ca/index.php?title=User:PeterDabrowski&amp;diff=48302"/>
		<updated>2010-09-20T08:04:43Z</updated>

		<summary type="html">&lt;p&gt;PeterDabrowski: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Hi, I&#039;m Peter and i&#039;m majoring in economics!&lt;br /&gt;
&lt;br /&gt;
Pythagorean Theorem:&lt;br /&gt;
&lt;br /&gt;
The Pythagorean theorem is named after the Greek mathematician Pythagoras. Which is probably due to the convenience that we know his name as there is much evidence that this theory was known by the human race in the time of the Babylonian and Mesopotamian empires. This theory is very simple yet an extremely important accomplishment of the human race and a tribute to the power of the human mind to comprehend such ideas. It applies strictly to right triangles as opposed to the wrong ones and states that the longest side times itself is equal to the sum the the other two sides multiplied by themselves. c^2=a^2+b^2. this formula can also be rearranged algebraically to find the lengths of the other two sides. This formula has applications in a wide range of fields that include architecture, engineering, physics, mathematics etc. And I should be at 150 words right about now!&lt;/div&gt;</summary>
		<author><name>PeterDabrowski</name></author>
	</entry>
	<entry>
		<id>https://wiki.ubc.ca/index.php?title=User:PeterDabrowski&amp;diff=48294</id>
		<title>User:PeterDabrowski</title>
		<link rel="alternate" type="text/html" href="https://wiki.ubc.ca/index.php?title=User:PeterDabrowski&amp;diff=48294"/>
		<updated>2010-09-20T07:20:32Z</updated>

		<summary type="html">&lt;p&gt;PeterDabrowski: Created page with &amp;#039;Hi, I&amp;#039;m Peter and i&amp;#039;m majoring in economics!&amp;#039;&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Hi, I&#039;m Peter and i&#039;m majoring in economics!&lt;/div&gt;</summary>
		<author><name>PeterDabrowski</name></author>
	</entry>
</feed>