<?xml version="1.0"?>
<?xml-stylesheet type="text/css" href="http://helmut.knaust.info/mediawiki/skins/common/feed.css?303"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://helmut.knaust.info/mediawiki/index.php?action=history&amp;feed=atom&amp;title=24178%3A_HW_2</id>
		<title>24178: HW 2 - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://helmut.knaust.info/mediawiki/index.php?action=history&amp;feed=atom&amp;title=24178%3A_HW_2"/>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=24178:_HW_2&amp;action=history"/>
		<updated>2026-05-18T17:04:27Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.19.1</generator>

	<entry>
		<id>http://helmut.knaust.info/mediawiki/index.php?title=24178:_HW_2&amp;diff=2030&amp;oldid=prev</id>
		<title>HelmutKnaust at 19:40, 2 February 2017</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=24178:_HW_2&amp;diff=2030&amp;oldid=prev"/>
				<updated>2017-02-02T19:40:54Z</updated>
		
		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class='diff diff-contentalign-left'&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
			&lt;tr valign='top'&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;← Older revision&lt;/td&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;Revision as of 19:40, 2 February 2017&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 8:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 8:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 9.'''&amp;#160; Let $x$ be a natural number. Prove or disprove: If $x^2$ is divisible by 27, then $x$ is divisible by 9. &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 9.'''&amp;#160; Let $x$ be a natural number. Prove or disprove: If $x^2$ is divisible by 27, then $x$ is divisible by 9. &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 10.''' Let $n$ be a natural number. Show that $\sqrt{n} is a natural number if and only if $n=k^2$ for some natural number $k$.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 10.''' Let $n$ be a natural number. Show that $\sqrt{n}&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;$ &lt;/ins&gt;is a natural number if and only if $n=k^2$ for some natural number $k$.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;[[Image:Alice3.gif]]&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;[[Image:Alice3.gif]]&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>HelmutKnaust</name></author>	</entry>

	<entry>
		<id>http://helmut.knaust.info/mediawiki/index.php?title=24178:_HW_2&amp;diff=2029&amp;oldid=prev</id>
		<title>HelmutKnaust at 19:40, 2 February 2017</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=24178:_HW_2&amp;diff=2029&amp;oldid=prev"/>
				<updated>2017-02-02T19:40:17Z</updated>
		
		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class='diff diff-contentalign-left'&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
				&lt;col class='diff-marker' /&gt;
				&lt;col class='diff-content' /&gt;
			&lt;tr valign='top'&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;← Older revision&lt;/td&gt;
			&lt;td colspan='2' style=&quot;background-color: white; color:black;&quot;&gt;Revision as of 19:40, 2 February 2017&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 2:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 2:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;Prove your conjecture.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;Prove your conjecture.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 7.''' Let $&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;A&lt;/del&gt;,&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;B&lt;/del&gt;$ and $&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;C&lt;/del&gt;$ be &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;arbitrary sets&lt;/del&gt;. &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;Recall that $A\setminus B=\{x \ |\ x\in A\ \wedge\ x\not\in B\}$. We define &lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 7.''' Let $&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;x$&lt;/ins&gt;, $&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;y$, &lt;/ins&gt;and $&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;z&lt;/ins&gt;$ be &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;natural numbers&lt;/ins&gt;. Prove or disprove: &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;If &lt;/ins&gt;$&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;x+y&lt;/ins&gt;$ &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;is even and $y+z&lt;/ins&gt;$ &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;is even, then $x+z&lt;/ins&gt;$ &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;is even&lt;/ins&gt;.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;$A\bigtriangleup B:=(A\setminus B)\cup(B \setminus A)$. &lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;Prove or disprove:&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;#&lt;/del&gt;$&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;A \bigtriangleup B= B \bigtriangleup A&lt;/del&gt;$&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;.&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;#&lt;/del&gt;$&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;(A \bigtriangleup B)\bigtriangleup C=A \bigtriangleup (B \bigtriangleup C)&lt;/del&gt;$.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 8.''' Let &lt;del class=&quot;diffchange diffchange-inline&quot;&gt; &lt;/del&gt;$&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;A&lt;/del&gt;$ and $&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;B&lt;/del&gt;$ be &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;arbitrary sets&lt;/del&gt;. Prove or disprove &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;the following power set relations&lt;/del&gt;: &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 8.''' Let $&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;x&lt;/ins&gt;$&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;, $y$, &lt;/ins&gt;and $&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;z&lt;/ins&gt;$ be &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;natural numbers&lt;/ins&gt;. Prove or disprove: &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;If &lt;/ins&gt;$&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;x+y&lt;/ins&gt;$ &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;is odd and $y+z$ is odd, then &lt;/ins&gt;$&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;x+z&lt;/ins&gt;$ &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;is odd&lt;/ins&gt;.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;#&lt;/del&gt;$&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;{\cal P}(A\cap B)\subseteq {\cal P}(A)\cap {\cal P}(B)&lt;/del&gt;$&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;. &lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;#&lt;/del&gt;$&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;{\cal P}(A)\cap {\cal P}(B)\subseteq {\cal P}(A\cap B)&lt;/del&gt;$.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 9.'''&amp;#160; &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;Given two real numbers &lt;/del&gt;$a&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;&amp;lt;b&lt;/del&gt;$&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;, the open interval &lt;/del&gt;$&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;(a&lt;/del&gt;,&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;b)&lt;/del&gt;$ &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;is defined to be the set $\displaystyle{\{x\in\mathbb{R}\ |\ (a&amp;lt;x) \wedge (&lt;/del&gt;x&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;&amp;lt;b)\}}&lt;/del&gt;$.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 9.'''&amp;#160; &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;Let &lt;/ins&gt;$&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;x$ be &lt;/ins&gt;a &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;natural number. Prove or disprove: If &lt;/ins&gt;$&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;x^2&lt;/ins&gt;$ &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;is divisible by 27&lt;/ins&gt;, &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;then &lt;/ins&gt;$x$ &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;is divisible by 9&lt;/ins&gt;. &amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;For $n\in\mathbb{N}$, let $A_n$ be the open interval $\displaystyle{(\frac{1}{2}-\frac{1}{2n}, \frac{1}{2}+\frac{1}{3n})}$. Find $\displaystyle{\bigcup_{n\in\mathbb{N}} A_n}$ and $\displaystyle{\bigcap_{n\in\mathbb{N}} A_n}$. Confirm your conjectures by proofs.&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 10.''' &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;Let $n$ be a natural number&lt;/ins&gt;. &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;Show &lt;/ins&gt;that $&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;\sqrt{n} &lt;/ins&gt;is &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;a natural number &lt;/ins&gt;if and &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;only if &lt;/ins&gt;$&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;n=k^&lt;/ins&gt;2$ for some &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;natural number &lt;/ins&gt;$&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;k&lt;/ins&gt;$.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 10.''' &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;Critique the following proof&lt;/del&gt;. &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;Is the proof correct or flawed? Explain!&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;Recall &lt;/del&gt;that &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;a positive integer $p&lt;/del&gt;$ is &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;''prime'' &lt;/del&gt;if &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;it is divisible by exactly two positive integers, namely $1$ &lt;/del&gt;and $&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;p$. The five smallest primes are &lt;/del&gt;2&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;,3,5,7,11.&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;'''Theorem.''' There are infinitely many primes.&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&amp;#160;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;'''Proof:''' Suppose there are only finitely many primes, say the list of all primes is $\{p_1,p_2,p_3,\ldots, p_n\}&lt;/del&gt;$ for some &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;positive integer &lt;/del&gt;$&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;n&lt;/del&gt;$&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;. Set&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;\[p=1+p_1\cdot p_2 \cdot p_3 \cdots p_n.\]&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;−&lt;/td&gt;&lt;td style=&quot;background: #ffa; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;Then $p$ leaves a remainder of 1 when divided by any of the $p_n$'s and thus $p$ must be a prime not on the list of all primes&lt;/del&gt;.&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;+&lt;/td&gt;&lt;td style=&quot;background: #cfc; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;[[Image:Alice3.gif]]&lt;/div&gt;&lt;/td&gt;&lt;td class='diff-marker'&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;[[Image:Alice3.gif]]&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>HelmutKnaust</name></author>	</entry>

	<entry>
		<id>http://helmut.knaust.info/mediawiki/index.php?title=24178:_HW_2&amp;diff=2028&amp;oldid=prev</id>
		<title>HelmutKnaust: Created page with &quot;'''Problem 6.''' Is the statement $\quad\exists !\,x\in\mathbb{R} : (x-2=\sqrt{x+7}) \quad$ true or false? Prove your conjecture.  '''Problem 7.''' Let $A,B$ and $C$ be arbitr...&quot;</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=24178:_HW_2&amp;diff=2028&amp;oldid=prev"/>
				<updated>2017-02-02T19:35:57Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Problem 6.&amp;#039;&amp;#039;&amp;#039; Is the statement $\quad\exists !\,x\in\mathbb{R} : (x-2=\sqrt{x+7}) \quad$ true or false? Prove your conjecture.  &amp;#039;&amp;#039;&amp;#039;Problem 7.&amp;#039;&amp;#039;&amp;#039; Let $A,B$ and $C$ be arbitr...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''Problem 6.''' Is the statement $\quad\exists !\,x\in\mathbb{R} : (x-2=\sqrt{x+7}) \quad$ true or false?&lt;br /&gt;
Prove your conjecture.&lt;br /&gt;
&lt;br /&gt;
'''Problem 7.''' Let $A,B$ and $C$ be arbitrary sets. Recall that $A\setminus B=\{x \ |\ x\in A\ \wedge\ x\not\in B\}$. We define &lt;br /&gt;
$A\bigtriangleup B:=(A\setminus B)\cup(B \setminus A)$. &lt;br /&gt;
Prove or disprove:&lt;br /&gt;
#$A \bigtriangleup B= B \bigtriangleup A$.&lt;br /&gt;
#$(A \bigtriangleup B)\bigtriangleup C=A \bigtriangleup (B \bigtriangleup C)$.&lt;br /&gt;
&lt;br /&gt;
'''Problem 8.''' Let  $A$ and $B$ be arbitrary sets. Prove or disprove the following power set relations: &lt;br /&gt;
#${\cal P}(A\cap B)\subseteq {\cal P}(A)\cap {\cal P}(B)$. &lt;br /&gt;
#${\cal P}(A)\cap {\cal P}(B)\subseteq {\cal P}(A\cap B)$.&lt;br /&gt;
&lt;br /&gt;
'''Problem 9.'''  Given two real numbers $a&amp;lt;b$, the open interval $(a,b)$ is defined to be the set $\displaystyle{\{x\in\mathbb{R}\ |\ (a&amp;lt;x) \wedge (x&amp;lt;b)\}}$.&lt;br /&gt;
&lt;br /&gt;
For $n\in\mathbb{N}$, let $A_n$ be the open interval $\displaystyle{(\frac{1}{2}-\frac{1}{2n}, \frac{1}{2}+\frac{1}{3n})}$. Find $\displaystyle{\bigcup_{n\in\mathbb{N}} A_n}$ and $\displaystyle{\bigcap_{n\in\mathbb{N}} A_n}$. Confirm your conjectures by proofs.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
'''Problem 10.''' Critique the following proof. Is the proof correct or flawed? Explain!&lt;br /&gt;
&lt;br /&gt;
Recall that a positive integer $p$ is ''prime'' if it is divisible by exactly two positive integers, namely $1$ and $p$. The five smallest primes are 2,3,5,7,11.&lt;br /&gt;
&lt;br /&gt;
'''Theorem.''' There are infinitely many primes.&lt;br /&gt;
&lt;br /&gt;
'''Proof:''' Suppose there are only finitely many primes, say the list of all primes is $\{p_1,p_2,p_3,\ldots, p_n\}$ for some positive integer $n$. Set&lt;br /&gt;
\[p=1+p_1\cdot p_2 \cdot p_3 \cdots p_n.\]&lt;br /&gt;
Then $p$ leaves a remainder of 1 when divided by any of the $p_n$'s and thus $p$ must be a prime not on the list of all primes.&lt;br /&gt;
&lt;br /&gt;
[[Image:Alice3.gif]]&lt;/div&gt;</summary>
		<author><name>HelmutKnaust</name></author>	</entry>

	</feed>