For example, find the gcd of $2x^5 + 4x^3 + 2x^2 + 5x+ 1$ and $x^6 + 3x^5 + 4x^3 + 3x + 1$ in $\mathbb{Z}/7\mathbb{Z}$.
Suppose I know that I can find the $\gcd$ of two integers with the Euclidean algorithm. What is the 'extension' so I can use this method also for polynomials?  Edit: I found an easy answer with less rigor which is approachable without knowledge of matrices:    also the first 3 subchapters of
My new laptop came preinstalled with Windows 8. Naively, as I am, I just formatted the harddrive and installed fine old Ubuntu. Now I want to install Windows 8 for dual boot again, but I have no DVD and do download the ISO one needs a product key. That key is not on the back of the laptop anymore but somewhere on the mainboard.  Is there any way to recover the product key from the mainboard using Ubuntu? My question is whether $x/x$ is always equal to $1$. I am mostly intersted in real numbers and particularly wonder whether $x/x$ is defined at $x=0$.  On one hand the division should simplify to $1$, on the other hand you should not be allowed to divide by zero.   I have been trying to find whether the simplification 'goes first' or whether the division causes trouble first, but it has proven impossible for me to find usefull search terms.     Note that this question arose after reading  and its first comment. Do messages in archive count to your inbox space? Pretty much as the title says, do messages in archive count to your total inbox space? Android: fragments overlapping issue Should an adverb go before or after a verb? For example:     The word rarely turns up outside of those contexts.      The word turns up rarely outside of those contexts.   Which one is correct and why? How to install specific Ubuntu packages, with exact version? Suppose you want to ask someone to do something, say to tell you the way to a station. Which is more polite, "Would you tell me the way to the station?" or "Could you tell me the way to the station?"? I have a final exam tomorrow for fluid mechanics and I was just looking over the practice exam questions. They do not provide solutions. But pretty much I have to define pressure at a point and also say why pressure is scalar instead of a vector.  I am thinking pressure at a point is $P=\lim_{\delta A \to 0} \frac{\delta F}{\delta A}$. Please let me know if I am wrong.   But I do not know at all why pressure is a scalar instead of a vector. I know it has something to do with $d \mathbf{F}=-Pd \mathbf{A}$ Segmentation fault error occurs for a simple function I have coded What constitutes protons? When I see pictures, I can't understand. Protons are made of quarks, but some say that they are made of 99% empty space. Also, in this illustration from Wikipedia, what's between the quarks? I'm working through Rotman (1994). It's the 2nd chapter where my curiosity lead me to a question that is not from the book. Here's the problem that inspired the question:      2.8. Imbed $S_n$ as a subgroup of $A_{n+2}$, but show, for $n\ge2$, that $S_n$ cannot be imbedded in $A_{n+1}.$    Since the alternate subgroup has the property of even parity, I thought that a little investigation of parity for the second and third symmetric groups was in order. So I constructed a table for each of them, grouped by even and odd number of disjoint products.   I'll forego writing the actual table and simply provide the answers. In symmetric groups with an even idegree, two even permutations come together under composition to produce an even permutation. Two odds also make an even. Two different parities produce odd elements.   When the symmetric group has an odd degree, e.g. $S_3$, two odds make an odd, two evens make an odd, and two different parities make an even element. Exactly the opposite results from the symmetric groups with even index.   Two questions: is this enough to prove the $A_{n+1}$ case? And can this be generalized modulo 2 e.g. $A_{2n+1}$? How to make a char string from a C macro's value? For example, how to avoid writing the 'func_name' twice?  #ifndef TEST_FUN #  define TEST_FUN func_name #  define TEST_FUN_NAME "func_name" #endif   I'd like to follow the  rule.  Version of C preprocessor:  $ cpp --version cpp (GCC) 4.1.2 20070626 (Red Hat 4.1.2-14) Is conservation of momentum and energy valid for non-inertial frames? End of javascript sidebar workarounds? (Salesforce Classic / Aloha) Reading through this doc:      We replaced the rich text editor in HTML Area home page components   with a new version that supports more markup but doesn’t allow HTML to   be manually entered.      In Summer ’15 we will start removing unsupported code from HTML Area   home page components. As a result, components that contain JavaScript,   CSS, iframes, or other unsupported markup might stop working properly.   To use JavaScript or other advanced HTML elements in your home page   component, we recommend that you use a Visualforce Area component   instead.   With Visualforce homepage component the best we could do is design fancy home page components, which has not been the big use of sidebar amongst developers. How do we do the fancy hack we do today using html components since visualforce is hosted in a different domain will the sidebar hacks even work after summer 15?     You can include JavaScript in your Visualforce page, but because the   component is rendered in an iframe on the home page layout, the   JavaScript can’t interact with the page that contains the component.   Finally why this move :(? Filling a conical tank I have been working on this problem for about 2 hours and I can't seem to get it, here is exactly what the question reads. "Water is poured into the top of a conical tank at the constant rate of 1 cubic inch per second and flows out of an opening at the3 bottom at a rate of .5 cubic inches per second. The tank has a height of 4 inches, and a radius of 2 inches at the top. How fast is the water level changing when the water is 2 inches high?" I have an unused copy of Mass Effect 2 Collector's Edition bought via Amazon.com in the US, including a special code for Inferno Armour (also unused).  Will it work fine if I install and start playing the game in the UK? Does geographical location matter?  Thanks! How can I prevent Chrome from offsetting newly opened Window? When I open a new Window in Chrome on Windows 7 (by pressing CTRL+N), the new window does not exactly overlap the existing window.   Instead it is offset to the right slightly.   So, immediately after opening a new window I have to manually move it to the left so that it uses the full screen real estate.   Is there a way to prevent this offset? Prove that $a^2 + b^2 \geq 8$ if $ x^4 + ax^3 + 2x^2 + bx + 1 = 0 $ has at least one real root. If it is known that the equation $$ x^4 + ax^3 + 2x^2 + bx + 1 = 0 $$ has a (real) root, prove the inequality $$ a^2 + b^2 \geq 8. $$  I am stuck on this problem, though, it is a very easy problem for my math teacher. Anyway, I can't figure out. Is there a bijection of the natural numbers which swaps $\frac{1}{n}$-summable subsets with $\frac{1}{\sqrt{n}}$-summable subsets? Let me start with a precise statement of the question.  For a subset $A\subseteq \mathbb{N}$ and a series of positive real numbers $\sum_{n=0}^\infty a_n$, I'll use the notation $\sum_A a_n$ as a shorthand for $\sum_{n\in A} a_n$.  Is there a bijection $f:\mathbb{N}\rightarrow \mathbb{N}$ with the property that for every $A\subseteq \mathbb{N}$, $\sum_A \frac{1}{n}$ converges iff $\sum_{f(A)} \frac{1}{\sqrt{n}}$ converges?  Background: Fix a series of positive terms $\sum_{n=0}^\infty a_n$.  Given a subset $A\subseteq \mathbb{N}$, call it $a_n$-small if $\sum_A a_n$ converges.  The following proposition is easy to prove:  Proposition:  The set $\{A\subseteq \mathbb{N}: A\text{ is } a_n\text{-small}\}\cup \{\mathbb{N}\}$ is a topology of closed sets on $\mathbb{N}$.  I will use the notation $(\mathbb{N},a_n)$ to refer to this topology.  Then one can ask how topological properties of $(\mathbb{N},a_n)$ are related to series properties of $\sum a_n$.  For example, I can show:  Proposition:  The following are equivalent.  $\sum a_n$ converges.  $(\mathbb{N},a_n)$ is discrete.  $(\mathbb{N},a_n)$ is disconnected.  $(\mathbb{N},a_n)$ is Hausdorff    And there are other nice things.  For example, $(\mathbb{N},a_n)$ is compact iff $(\mathbb{N},a_n)$ is cofinite iff $\liminf a_n &gt; 0$. With this language, my question can be reformulated as...  Are $\left(\mathbb{N}, \frac{1}{n}\right)$ and $\left(\mathbb{N}, \frac{1}{\sqrt{n}}\right)$ homeomorphic?  I have made very little progress on this.  Of course, the identity function $i:(\mathbb{N}, \frac{1}{\sqrt{n}})\rightarrow (\mathbb{N}, \frac{1}{n})$ is a continuous bijection, but the inverse map is not continuous.  Also, if there is such a bijection, there there is such a bijection with agrees with $i$ on any preassigned finite set. Edit  I thought I add in a slightly suprising (to me, at least) example when things work out to be homeomorphic. Begin with a convergent series $\sum c_n$. and divergent series $\sum a_n$ with $\lim a_n = 0$.  Create a new series $b_n$ using all the terms of $c_n$ and $a_n$ (in whatever order you wish).  Then $(\mathbb{N}, a_n)$ and $(\mathbb{N}, b_n)$ are homeomorphic.  The idea is that since $\lim a_n = 0$, there is a convergent infinite subseries $\sum_A a_n$.  Then we use a bijection which with $A$ and $A\cup \{\text{indices of }c_n\}$ to &quot;squeeze&quot; the $c_n$ in without changing the topology.  Of course, I am glossing over many details, but I can include them if desired. Several badge descriptions contain raw HTML I was reading through some badge descriptions and noticed that Synonymizer's description needs to be updated. As it stands, there is raw HTML (an href) in the description:    EDIT: after reading comments by @ColeJohnson, I have come to the understanding that this post comes off as whiny. I want to make it very clear that I wasn't ever trying to complain. My first reaction was to fix the perceived error myself. When I realized I was unable to do so, I figured the best course of action would be to find someone who would be able to make the necessary edits. Hence the post here.