<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://drorbn.net/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=76.64.136.153</id>
	<title>Drorbn - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://drorbn.net/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=76.64.136.153"/>
	<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=Special:Contributions/76.64.136.153"/>
	<updated>2026-05-04T20:45:35Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.39.6</generator>
	<entry>
		<id>https://drorbn.net/index.php?title=07-401/Homework_Assignment_7&amp;diff=4534</id>
		<title>07-401/Homework Assignment 7</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=07-401/Homework_Assignment_7&amp;diff=4534"/>
		<updated>2007-03-26T00:04:05Z</updated>

		<summary type="html">&lt;p&gt;76.64.136.153: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{07-401/Navigation}}&lt;br /&gt;
&lt;br /&gt;
===Reading===&lt;br /&gt;
Read chapters 20 and 21 of Gallian&#039;s book three times:&lt;br /&gt;
* First time as if you were reading a novel - quickly and without too much attention to detail, just to learn what the main keywords and concepts and goals are.&lt;br /&gt;
* Second time like you were studying for an exam on the subject - slowly and not skipping anything, verifying every little detail.&lt;br /&gt;
* And then a third time, again at a quicker pace, to remind yourself of the bigger picture all those little details are there to paint.&lt;br /&gt;
&lt;br /&gt;
===Doing===&lt;br /&gt;
Solve problems 20 and 27# in Chapter 20 of Gallian&#039;s book and problems 3#, 7, 8#, 9, 10# and 18# in Chapter 21 of the same book, but submit only the solutions the problems marked with a sharp (#).&lt;br /&gt;
&lt;br /&gt;
===Due Date===&lt;br /&gt;
This assignment is due in class on Wednesday March 21, 2007.&lt;br /&gt;
&lt;br /&gt;
===Just for Fun===&lt;br /&gt;
We know that if &amp;lt;math&amp;gt;a&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;b&amp;lt;/math&amp;gt; are algebraic numbers, then so are &amp;lt;math&amp;gt;a+b&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;a-b&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;ab&amp;lt;/math&amp;gt;, &amp;lt;math&amp;gt;a/b&amp;lt;/math&amp;gt; and &amp;lt;math&amp;gt;\sqrt[n]{a}&amp;lt;/math&amp;gt; (for any natural &amp;lt;math&amp;gt;n&amp;lt;/math&amp;gt;). It follows that the number&lt;br /&gt;
{{Equation*|&amp;lt;math&amp;gt;c=\sqrt[3]{7}-\sqrt[4]{\sqrt{5}\left/\sqrt[3]{\sqrt{2}+\sqrt[5]{7}}\right.}&amp;lt;/math&amp;gt;}}&lt;br /&gt;
is algebraic. If so, can you find a polynomial whose roots include &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;? Can you find the minimal polynomial &amp;lt;math&amp;gt;p&amp;lt;/math&amp;gt; of &amp;lt;math&amp;gt;c&amp;lt;/math&amp;gt;? What is &amp;lt;math&amp;gt;\deg p&amp;lt;/math&amp;gt;?&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Warning.&#039;&#039;&#039; &amp;quot;Can you find?&amp;quot; should be interpreted as &amp;quot;How would you find?&amp;quot; and not as &amp;quot;Please find.&amp;quot;. The latter is doable, but not by hand!&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Prize.&#039;&#039;&#039; Though if you do actually find the polynomial &amp;lt;math&amp;gt;p&amp;lt;/math&amp;gt; &#039;&#039;through your own efforts&#039;&#039;, post it on this site along with your computations leading to it (a computer program, I presume), and your final grade for this class will be bounded below by 90. The due date for prize claims is the last day of classes.&lt;br /&gt;
&lt;br /&gt;
&#039;&#039;&#039;Solutions&#039;&#039;&#039;&lt;br /&gt;
1. [[07-401/Andrei Litvin Poly Solution|Andrei Litvin]] (partial, however should be quite close)&lt;/div&gt;</summary>
		<author><name>76.64.136.153</name></author>
	</entry>
	<entry>
		<id>https://drorbn.net/index.php?title=07-401/Andrei_Litvin_Poly_Solution&amp;diff=4533</id>
		<title>07-401/Andrei Litvin Poly Solution</title>
		<link rel="alternate" type="text/html" href="https://drorbn.net/index.php?title=07-401/Andrei_Litvin_Poly_Solution&amp;diff=4533"/>
		<updated>2007-03-26T00:03:59Z</updated>

		<summary type="html">&lt;p&gt;76.64.136.153: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Here is what I have so far in terms of polynomials:&lt;br /&gt;
&lt;br /&gt;
Polynomial with root &amp;lt;math&amp;gt;\sqrt{2}&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;{x}^{2} - 2&amp;lt;/math&amp;gt; (duh)&lt;br /&gt;
&lt;br /&gt;
Polynomial with root &amp;lt;math&amp;gt;\sqrt[5]{7}&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;x^5 - 7&amp;lt;/math&amp;gt; (duh as well)&lt;br /&gt;
&lt;br /&gt;
Polynomial with root &amp;lt;math&amp;gt;\sqrt{2} + \sqrt[5]{7}&amp;lt;/math&amp;gt;:&lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;x^{10} - 10*x^8 + 40*x^6 - 14*x^5 - 80*x^4 - 280*x^3 + 80*x^2 - 280*x + 17&lt;br /&gt;
&amp;lt;/math&amp;gt; (more interesting!)&lt;br /&gt;
&lt;br /&gt;
Polynomial with root &amp;lt;math&amp;gt;\sqrt[3]{\sqrt{2} + \sqrt[5]{7}}&amp;lt;/math&amp;gt;: &lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;x^{30} - 10*x^{24} + 40*x^{18} - 14*x^{15} - 80*x^{12} - 280*x^9 + 80*x^6 - 280*x^3 + 17&lt;br /&gt;
&amp;lt;/math&amp;gt; (similar to the above)&lt;br /&gt;
&lt;br /&gt;
Polynomial with root &amp;lt;math&amp;gt; {1} \over {\sqrt[3]{\sqrt{2} + \sqrt[5]{7}}}&amp;lt;/math&amp;gt;: &lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
17*x^{30} - 280*x^{27} + 80*x^{24} - 280*x^{21} - 80*x^{18} - 14*x^{15} + 40*x^{12} - 10*x^6 + 1&lt;br /&gt;
&amp;lt;/math&amp;gt; (just invert the above .. quite the same as the above 2)&lt;br /&gt;
&lt;br /&gt;
Polynomial with root &amp;lt;math&amp;gt; {\sqrt{5}} \over {\sqrt[3]{\sqrt{2} + \sqrt[5]{7}}}&amp;lt;/math&amp;gt;: &lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
289*x^{60} - 9460000*x^{54} - 2392500000*x^{48} - 190781250000*x^{42} + 1127929687500*x^{36} - 249084472656250*x^{30} + 12817382812500000*x^{24} - 457763671875000000*x^{18} + 10728836059570312500*x^{12} - 149011611938476562500*x^6 + 931322574615478515625&lt;br /&gt;
&amp;lt;/math&amp;gt; (ok .. this is ugly)&lt;br /&gt;
&lt;br /&gt;
Polynomial with root &amp;lt;math&amp;gt; \sqrt[4]{{\sqrt{5}} \over {\sqrt[3]{\sqrt{2} + \sqrt[5]{7}}}}&amp;lt;/math&amp;gt;: &lt;br /&gt;
&lt;br /&gt;
&amp;lt;math&amp;gt;&lt;br /&gt;
289*x^{240} - 9460000*x^{216} - 2392500000*x^{192} - 190781250000*x^{168} + &lt;br /&gt;
1127929687500*x^{144} - 249084472656250*x^{120} + 12817382812500000*x^{96} - &lt;br /&gt;
457763671875000000*x^{72} + 10728836059570312500*x^{48} - 149011611938476562500*x^{24} + 931322574615478515625&lt;br /&gt;
&amp;lt;/math&amp;gt; (very ugly .. especially considering you are not done yet and the next matrix to compute will be quite large)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
This is how far I got so far. The program itself will do others just file (I fiddled with it a lot, so it may still have some bugs, however it works). The problem is working with such large numbers. The reducing part will multiply with 289 each time a &amp;lt;math&amp;gt;x^{240}&amp;lt;/math&amp;gt; is reduced, so we could potentially get coefficients of the order &amp;lt;math&amp;gt;289^{964 - 240}&amp;lt;/math&amp;gt;, which is very large indeed. On my computer, I get about 30% done, when it starts running out of memory and I had to stop. This is why the program just generates the matrices for the last part (and by the way, Maxima crashed when trying to load the matrix to invert, so I will have to find another program that will handle such large sets of data)&lt;/div&gt;</summary>
		<author><name>76.64.136.153</name></author>
	</entry>
</feed>