For any two positive integers ${n_1,n_2}$, the relationship between their greatest common divisor and their least common multiple is given by  $$\text{lcm}(n_1,n_2)=\frac{n_1 n_2}{\gcd(n_1,n_2)}$$  If I have a set of $r$ positive integers ${n_1,n_2,n_3,...,n_r}$, does the same relationship hold? Is it true that  $$\text{lcm}(n_1,n_2,n_3,...,n_r)=\frac{\prod_{i=1}^r n_i}{gcd(n_1,n2,n_3,...,n_r)}$$  I feel like this should be easy to prove, but I'm struggling to get a handle on it.
If I know the GCD of 20 numbers, and know the 20 numbers, is there a formula such that I input the 20 numbers and input their GCD, and it outputs their LCM? I know that $$\frac{\left| a\cdot b\right|}{\gcd(a,b)} = \text{lcm}(a,b).$$ So is it$$\frac{\left| a\cdot b\cdot c\cdot d\cdot e\cdot f\right|}{\gcd(a,b,c,d,e,f)}?$$If not, what is it?
How can I sound proof bathroom walls? I'm trying to figure out the best, least intrusive way of sound proofing the walls of a bathroom. The bathroom shares a wall with my bedroom, and my 3 yea old's bedroom. The main problem is the sound of water running (plus every bump on the counter and everything) echos loud and clear through the wall into my sons room.  I found  and it seems like a good choice. Another option is adding another layer fo drywall with something like  between them. But all the walls and ceilings in the house are textured. So replacing just one or two walls in a room is just not possible.   This is the layout of the two rooms. I've added red box around the wall with the most noise.   Is there anything else I'm missing here that I could do to dampen the noise short of tearing the bathroom apart? Convergence of $\sqrt{n}x_{n}$ where $x_{n+1} = \sin(x_{n})$ How can I clear event subscriptions in C#? Take the following C# class:  c1 {  event EventHandler someEvent; }   If there are a lot of subscriptions to c1's someEvent event and I want to clear them all, what is the best way to achieve this? Also consider that subscriptions to this event could be/are lambdas/anonymous delegates.  Currently my solution is to add a ResetSubscriptions() method to c1 that sets someEvent to null. I don't know if this has any unseen consequences. Prove that the product of a non-zero rational and irrational number is irrational. Could you please confirm if this proof is correct?  Theorem: If $q \neq 0$ is rational and $y$ is irrational, then $qy$ is irrational.  Proof: Proof by contradiction, we assume that $qy$ is rational. Therefore $qy=\frac{a}{b}$ for integers $a$, $b \neq 0$. Since $q$ is rational, we have $\frac{x}{z}y=\frac{a}{b}$ for integers $x \neq 0$, $z \neq 0$. Therefore, $xy = a$, and $y=\frac{a}{x}$. Since both $a$ and $x$ are integers, $y$ is rational, leading to a contradiction. How should I understand "$A$ unless $B$"? Let's say $f$ is an isomorphism $f:G  \rightarrow G'$, where $G$ and $G'$ are multiplicative groups.  Then for $x\in G$, if $f(x) = x' \in G'$. Do we have always have $\text{ord}(x) = \text{ord}(x')$? Why? Windows Media Player 12 shows wrong cover art when playing There are similar questions for  and , but I'm after a Windows solution here.  The problem is as follows: I want to write several (js) script files in a folder, and have a  program monitor that folder for file changes and new files being added, and run a command whenever that happens (to compile them all into one single file).  The solution has to:   Monitor both file changes and new files being added, in a folder. Run a command only if there is any change.   It would be best if it either is a built-in solution (like a JScript or VBscript snippet), or something that does not require installation. Date comparison : which date format? How to list files in a zip without extra information in command line In my bash command line, when I use unzip -l test.zip I get the output like this:  Archive:  test.zip   Length      Date    Time    Name ---------  ---------- -----   ----    810000  05-07-2014 15:09   file1.txt    810000  05-07-2014 15:09   file2.txt    810000  05-07-2014 15:09   file3.txt ---------                     -------   2430000                     3 files   But I am interested only by the lines containing the file details.  I tried to make filtering using grep like this:   unzip -l test.zip | grep -v Length | grep -v "\-\-\-\-" | g -v Archive | grep -v " files"  But it is long and prone to error (e.g a file name Archive in this list will be dropped)  Is there any other options with unzip -l (I checked the unzip man page and did not find any) or another tool to do so?  It is important to me to not really unzip the archive but just to look what files are inside. The is sometimes pronounced &quot;tha&quot; (/ðə/) or &quot;thi&quot; (/ðiː/). Which is the correct pronunciation of this word? Are both correct and used interchangeably at specific places? If the second question is correct, please provide the rule of pronouncing at different places. Convergent or divergent $\sum_{n=1}^{\infty} \frac{e^nn!}{n^n}$? Any suggestion/hint, not the whole solution, how to determine convergence/divergence of $$ \sum_{n=1}^{\infty}\dfrac{e^n \cdot n!}{n^n} $$ I'm currently stuck. A set of elements in a reduced unity ring Let $(A,+,\cdot)$ be a unity ring with the property that if $x \in A$ and $x^2=0$ then $x=0$. Consider the set $M=\{a\in A | a^3=a\}$. Prove that:      a) $2a\in Z(A)$, $\forall a\in M$, where $Z(A)$ denotes the centre of the ring $A$;   b) $ab=ba$, $\forall a,b\in M$.   My attempts revolved around the fact that an idempotent element in a reduced ring is central. So, since for $a\in M$ we have that $(a^2)^2=a^2$, it follows that $a^2\in Z(A)$, $\forall a\in M$. The next thing I wanted to use in order to solve a) was that $Z(A)$ is a subring of $A$, so if I had proved that $(a+1)^2 \in Z(A)$, $\forall a\in M$, then we would have reached the desired conclusion. However, I couldn't prove this and I honestly doubt that it is true. Another idea that I had was to prove that $M$ is a subring of $A$. Of course, this didn't work out because I cannot even prove that $M$ is closed under addition. Again, I don't know if this is true and it most likely isn't. As for b), I think that a) should be of use, but I don't know how. It is a well-known problem that a ring with $x^3=x$ for any $x$ in that ring is commutative, but since $(M,+,\cdot)$ is almost definitely not a ring, this doesn't help. EDIT: Is there any chance that this question is simply wrong? I tended to believe this before asking it here too, but since nobody has made any progress on it until now I am even more inclined to think so. Shorter way to say "conversational partner" I'm looking for a proper English word to say "conversational partner".   Is "interlocutor" a word an average person would understand?  Are there any other words or shorter expressions which could describe a person you are having a conversation with, but who is not your friend and is basically unknown to you? Question list on profile page not vertically aligned There's something wrong with the vertical alignment on the :   (click to enlarge)  On the , which uses a similar list but without the Favorite column, the vertical alignment is correct.  (Tested in the latest Firefox, Safari and Chrome on macOS Catalina.) For a while now I've noticed that if I take a cup of hot tea and pour it into two cups and leave it then both cups will cool faster than the single cup.  How is it that nature cools two cups of tea in parallel more quickly? It's still the same amount of tea but it gets cooled quicker if I have two cups. How do you get JavaScript/jQuery Intellisense Working in Visual Studio 2008? I thought jQuery Intellisense was supposed to be improved with SP1. I even downloaded an annotated version of jQuery 1.2.6, but intellisense will not work in a separate jscript file. I have the jQuery library referenced first on my web page in the &lt;head> tag. Am I doing anything wrong? Continuous function positive at a point is positive in a neighborhood of that point Pretty much the problem asks if a function is continuous at the point $c$ and $f(c) &gt; 0$ then there exists a $d &gt; 0$ such that $\forall x$, $f(x) &gt; 0$ with $|x-c| &lt; d$.   I can understand what the problem means. That if a function is positive at a point then there is another point that's really close that'll also be positive. I can not prove this in a formal way though. I've tried using the intermediate value theorem and I do not know hot to implement it. Any ideas? Polynomials with integer coefficients such that $p(a)=b,p(b)=c,p(c)=a$ While studying polynomials a question struck in my mind that  To have a polynomial $p(x)$ with integer coefficients and $a,b,c$ are three distinct integers, then is it possible to have $$p(a)=b$$$$p(b)=c$$$$p(c)=a$$ There is a button in the "basic math assistant" which wraps highlighted text in chosen brackets. Is there no keyboard command for this?