<?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=CRN_10459%3A_HW_5</id>
		<title>CRN 10459: HW 5 - 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=CRN_10459%3A_HW_5"/>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_10459:_HW_5&amp;action=history"/>
		<updated>2026-05-12T07:04:55Z</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=CRN_10459:_HW_5&amp;diff=5352&amp;oldid=prev</id>
		<title>HelmutKnaust at 16:43, 28 October 2025</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_10459:_HW_5&amp;diff=5352&amp;oldid=prev"/>
				<updated>2025-10-28T16:43:44Z</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 16:43, 28 October 2025&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 15:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 15:&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;'''Problem 25.''' Let $f:D\to \mathbb{R}$, and $x_0$ be an accumulation point of $D$. Suppose that $f$ has a limit at $x_0$. Show that there is a $\delta&amp;gt;0$ and an $M&amp;gt;0$ such that &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 25.''' Let $f:D\to \mathbb{R}$, and $x_0$ be an accumulation point of $D$. Suppose that $f$ has a limit at $x_0$. Show that there is a $\delta&amp;gt;0$ and an $M&amp;gt;0$ such that &amp;#160;&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;$|f(x)|\leq M$ for all $x\in D$ satisfying |x-x_0|&amp;lt; &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;$&lt;/del&gt;\delta$.&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;$|f(x)|\leq M$ for all $x\in D$ satisfying &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;$&lt;/ins&gt;|x-x_0|&amp;lt; \delta$.&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=CRN_10459:_HW_5&amp;diff=5351&amp;oldid=prev</id>
		<title>HelmutKnaust at 16:42, 28 October 2025</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_10459:_HW_5&amp;diff=5351&amp;oldid=prev"/>
				<updated>2025-10-28T16:42:42Z</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 16:42, 28 October 2025&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;#Show that the product of two positive Cauchy sequences is positive.&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;#Show that the product of two positive Cauchy sequences is positive.&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 23.''' For a set of real numbers $A$, let $A'$ denote the set of its accumulation points. Find a set $A&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;$ such that $(A')'=\emptyset$, but $A'\neq\emptyset$. Then find a set $B&lt;/del&gt;$ such that&amp;#160; $((&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;B&lt;/del&gt;')')'=\emptyset$, but $(&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;B&lt;/del&gt;')'\neq\emptyset$.&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 23.''' For a set of real numbers $A$, let $A'$ denote the set of its accumulation points. Find a set $A$ such that&amp;#160; $((&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;A&lt;/ins&gt;')')'=\emptyset$, but $(&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;A&lt;/ins&gt;')'\neq\emptyset$.&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;'''Problem 24.''' Let the function $f:\mathbb{R}\to\mathbb{R}$ be given by $f(x)=\sqrt[3]{x}$.&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 24.''' Let the function $f:\mathbb{R}\to\mathbb{R}$ be given by $f(x)=\sqrt[3]{x}$.&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=CRN_10459:_HW_5&amp;diff=5350&amp;oldid=prev</id>
		<title>HelmutKnaust at 16:40, 28 October 2025</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_10459:_HW_5&amp;diff=5350&amp;oldid=prev"/>
				<updated>2025-10-28T16:40:33Z</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 16:40, 28 October 2025&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 15:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 15:&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;'''Problem 25.''' Let $f:D\to \mathbb{R}$, and $x_0$ be an accumulation point of $D$. Suppose that $f$ has a limit at $x_0$. Show that there is a $\delta&amp;gt;0$ and an $M&amp;gt;0$ such that &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 25.''' Let $f:D\to \mathbb{R}$, and $x_0$ be an accumulation point of $D$. Suppose that $f$ has a limit at $x_0$. Show that there is a $\delta&amp;gt;0$ and an $M&amp;gt;0$ such that &amp;#160;&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;$f(x)\leq M$ for all $x\in D$ satisfying |x-x_0|&amp;lt; $\delta$.&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;ins class=&quot;diffchange diffchange-inline&quot;&gt;|&lt;/ins&gt;f(x)&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;|&lt;/ins&gt;\leq M$ for all $x\in D$ satisfying |x-x_0|&amp;lt; $\delta$.&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=CRN_10459:_HW_5&amp;diff=5349&amp;oldid=prev</id>
		<title>HelmutKnaust at 16:36, 28 October 2025</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_10459:_HW_5&amp;diff=5349&amp;oldid=prev"/>
				<updated>2025-10-28T16:36: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 16:36, 28 October 2025&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&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 21.''' Two Cauchy sequences $(a_n)$ and $(b_n)$ are said to be ''equivalent'' if $\lim_{n\to\infty} |a_n-b_n|=0$. Show that &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;this &lt;/del&gt;indeed defines an equivalence relation on the set of all Cauchy sequences. &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 21.''' Two Cauchy sequences $(a_n)$ and $(b_n)$ are said to be ''equivalent'' if $\lim_{n\to\infty} |a_n-b_n|=0$. &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;We then write $(a_n)\sim (b_n)$.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&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;ins class=&quot;diffchange diffchange-inline&quot;&gt;#&lt;/ins&gt;Show that &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;$\sim$ &lt;/ins&gt;indeed defines an equivalence relation on the set of all Cauchy sequences&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;. &lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&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;ins class=&quot;diffchange diffchange-inline&quot;&gt;#Show: If $(a_n)\sim(b_n)$ and $(c_n)\sim(d_n)$, then $(a_n+c_n)\sim (b_n+d_n)$.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&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;ins class=&quot;diffchange diffchange-inline&quot;&gt;#Show: If $(a_n)\sim(b_n)$ and $(c_n)\sim(d_n)$, then $(a_n\cdot c_n)\sim (b_n\cdot d_n)$&lt;/ins&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;'''Problem 22.''' A Cauchy sequence $(a_n)$ is said to be ''positive'', if for all $k\in\mathbb{N}$ there is an $N\in\mathbb{N}$ such that $a_n&amp;gt;-\frac{1}{k}$ for all $n\geq N$. &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 22.''' A Cauchy sequence $(a_n)$ is said to be ''positive'', if for all $k\in\mathbb{N}$ there is an $N\in\mathbb{N}$ such that $a_n&amp;gt;-\frac{1}{k}$ for all $n\geq N$. &amp;#160;&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=CRN_10459:_HW_5&amp;diff=5348&amp;oldid=prev</id>
		<title>HelmutKnaust at 16:33, 28 October 2025</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_10459:_HW_5&amp;diff=5348&amp;oldid=prev"/>
				<updated>2025-10-28T16:33:44Z</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 16:33, 28 October 2025&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 1:&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 21.''' Two Cauchy sequences $(a_n)$ and $(b_n)$ are said to be equivalent if $\lim_{n\to\infty} |a_n-b_n|=0$. Show that this indeed defines an equivalence relation on the set of all Cauchy sequences. &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 21.''' Two Cauchy sequences $(a_n)$ and $(b_n)$ are said to be &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;''&lt;/ins&gt;equivalent&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;'' &lt;/ins&gt;if $\lim_{n\to\infty} |a_n-b_n|=0$. Show that this indeed defines an equivalence relation on the set of all Cauchy sequences. &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;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background: #eee; color:black; font-size: smaller;&quot;&gt;&lt;div&gt;'''Problem 22.''' A Cauchy sequence $(a_n)$ is said to be ''positive'', if for all $k\in\mathbb{N}$ there is an $N\in\mathbb{N}$ such that $a_n&amp;gt;-\frac{1}{k}$ for all $n\geq N$. &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 22.''' A Cauchy sequence $(a_n)$ is said to be ''positive'', if for all $k\in\mathbb{N}$ there is an $N\in\mathbb{N}$ such that $a_n&amp;gt;-\frac{1}{k}$ for all $n\geq N$. &amp;#160;&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=CRN_10459:_HW_5&amp;diff=5347&amp;oldid=prev</id>
		<title>HelmutKnaust at 22:07, 27 October 2025</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_10459:_HW_5&amp;diff=5347&amp;oldid=prev"/>
				<updated>2025-10-27T22:07:06Z</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 22:07, 27 October 2025&lt;/td&gt;
			&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 5:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 5:&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;#Show that the product of two positive Cauchy sequences is positive.&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;#Show that the product of two positive Cauchy sequences is positive.&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 23.''' For a set of real numbers $A$, let $A'$ denote the set of its accumulation points. Find a set $A$ such that $(A')'=\emptyset$, but $A'\neq\emptyset$. &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;Find &lt;/del&gt;a set $B$ such that&amp;#160; $((B')')'=\emptyset$, but $(B')'\neq\emptyset$.&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 23.''' For a set of real numbers $A$, let $A'$ denote the set of its accumulation points. Find a set $A$ such that $(A')'=\emptyset$, but $A'\neq\emptyset$. &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;Then find &lt;/ins&gt;a set $B$ such that&amp;#160; $((B')')'=\emptyset$, but $(B')'\neq\emptyset$.&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;'''Problem 24.''' Let the function $f:\mathbb{R}\to\mathbb{R}$ be given by $f(x)=\sqrt[3]{x}$.&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 24.''' Let the function $f:\mathbb{R}\to\mathbb{R}$ be given by $f(x)=\sqrt[3]{x}$.&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=CRN_10459:_HW_5&amp;diff=5346&amp;oldid=prev</id>
		<title>HelmutKnaust: Created page with &quot;'''Problem 21.''' Two Cauchy sequences $(a_n)$ and $(b_n)$ are said to be equivalent if $\lim_{n\to\infty} |a_n-b_n|=0$. Show that this indeed defines an equivalence relation ...&quot;</title>
		<link rel="alternate" type="text/html" href="http://helmut.knaust.info/mediawiki/index.php?title=CRN_10459:_HW_5&amp;diff=5346&amp;oldid=prev"/>
				<updated>2025-10-27T21:36:29Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot;&amp;#039;&amp;#039;&amp;#039;Problem 21.&amp;#039;&amp;#039;&amp;#039; Two Cauchy sequences $(a_n)$ and $(b_n)$ are said to be equivalent if $\lim_{n\to\infty} |a_n-b_n|=0$. Show that this indeed defines an equivalence relation ...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;'''Problem 21.''' Two Cauchy sequences $(a_n)$ and $(b_n)$ are said to be equivalent if $\lim_{n\to\infty} |a_n-b_n|=0$. Show that this indeed defines an equivalence relation on the set of all Cauchy sequences. &lt;br /&gt;
&lt;br /&gt;
'''Problem 22.''' A Cauchy sequence $(a_n)$ is said to be ''positive'', if for all $k\in\mathbb{N}$ there is an $N\in\mathbb{N}$ such that $a_n&amp;gt;-\frac{1}{k}$ for all $n\geq N$. &lt;br /&gt;
#Show that the sum of two positive Cauchy sequences is positive.&lt;br /&gt;
#Show that the product of two positive Cauchy sequences is positive.&lt;br /&gt;
&lt;br /&gt;
'''Problem 23.''' For a set of real numbers $A$, let $A'$ denote the set of its accumulation points. Find a set $A$ such that $(A')'=\emptyset$, but $A'\neq\emptyset$. Find a set $B$ such that  $((B')')'=\emptyset$, but $(B')'\neq\emptyset$.&lt;br /&gt;
&lt;br /&gt;
'''Problem 24.''' Let the function $f:\mathbb{R}\to\mathbb{R}$ be given by $f(x)=\sqrt[3]{x}$.&lt;br /&gt;
# Show that $f$ has a limit at $0$.&lt;br /&gt;
# Show that $f$ has a limit at any $x_0\neq 0$. (The identity $a^3-b^3=(a-b)(a^2+ab+b^2)$ will be helpful.)&lt;br /&gt;
&lt;br /&gt;
'''Problem 25.''' Let $f:D\to \mathbb{R}$, and $x_0$ be an accumulation point of $D$. Suppose that $f$ has a limit at $x_0$. Show that there is a $\delta&amp;gt;0$ and an $M&amp;gt;0$ such that &lt;br /&gt;
$f(x)\leq M$ for all $x\in D$ satisfying |x-x_0|&amp;lt; $\delta$.&lt;/div&gt;</summary>
		<author><name>HelmutKnaust</name></author>	</entry>

	</feed>