How to add a texture area to an abnormal shape
Add different materials to different parts of a mesh?
Let $G$ be a group, where $(ab)^3=a^3b^3$ and $(ab)^5=a^5b^5$. Prove that $G $ is an abelian group. Let G be a group, where $(ab)^3=(a^3)(b^3)$ and $(ab)^5=(a^5)(b^5)$. Prove that $G$ is abelian group.  Thank you in advance. Any help is appreciated. The following is a rigorous proof of De Moivre's theorem by means of mathematical induction. The theorem put simply is that:  Any complex number, $z = a+bi$, on a cartesian plane can be expressed in polar form, where $a=r\cos\theta$ and $b=r\sin\theta$ and $r$ is the absolute distance from the origin to the point $z$. In light of this, the expression for the complex number $z$ in polar form is $z=r(\cos\theta+i\sin\theta)$ In order to find the $n^{th}$ power of $z$, the following rule applies: $$\displaystyle z^n=(r(\cos\theta+i\sin\theta))^n=r^n(\cos n\theta+i\sin n\theta)$$ where $n\in\mathbb N$ (I have confined $n$ to the natural numbers given that I intend on using mathematical induction to prove the theorem.  Base step: We must prove that what is stated is true for $n=1$, hence $$z^1=r^1(\cos 1\cdot\theta+i\sin1\cdot \theta)$$ $$=r(\cos\theta+i\sin\theta)$$ which is true. Next we assume it is true for $n=k$, and therefore proceed to the inductive step. Inductive step: When calculating $z^{n+1}$, it's the same as calculating $z^nz$, hence $$z^{n+1}=(r^n(\cos n\theta + i\sin n\theta))(r(\cos \theta+i\sin \theta))$$ $$=r^nr(\cos n\theta+i\sin n\theta)(\cos\theta +i\sin \theta)$$ $$=r^{n+1}(\cos n\theta\cdot\cos\theta+\cos n\theta \cdot i\sin\theta+i\sin n\theta\cdot\cos\theta+i^2\sin n\theta\cdot\sin\theta)$$ from here, $i^2=-1$, and therefore $+i^2\sin n\theta\cdot\sin\theta$ becomes $-\sin n\theta\cdot\sin\theta$. In addition to this, the following trigonometric identities will be used: $$\sin(n\theta + \theta) = \sin n\theta\cdot\cos\theta+\cos n\theta\cdot\sin\theta$$ $$or$$ $$k\sin(n \theta+\theta)=k\sin n \theta\cdot\cos \theta + \cos n\theta\cdot k\sin\theta$$ $$and$$ $$\cos(n \theta + \theta)=\cos n\theta\cdot\cos\theta-\sin n\theta\cdot\sin\theta$$ by using these, the original equation has now become $$=r^{n+1}(\cos(n \theta + \theta) + i\sin(n \theta + \theta))$$ then, after factoring out $\theta$, the theorem becomes $$=r^{n+1}(\cos((n+1)\theta)+i\sin((n+1)\theta))$$ which completes the proof. Question: is this proof correct all the way through? Or have I missed any conditions? If all is well in the case of this proof, could somebody aid me in proving it for $\{n|n\in\mathbb R,n\geq1\}$ How can I detect the encoding/codepage of a text file In our application, we receive text files (.txt, .csv, etc.) from diverse sources. When reading, these files sometimes contain garbage, because the files where created in a different/unknown codepage.  Is there a way to (automatically) detect the codepage of a text file?   The detectEncodingFromByteOrderMarks, on the StreamReader constructor, works for UTF8  and other unicode marked files, but I'm looking for a way to detect code pages, like ibm850, windows1252.     Thanks for your answers, this is what I've done.  The files we receive are from end-users, they do not have a clue about codepages. The receivers are also end-users, by now this is what they know about codepages: Codepages exist, and are annoying.  Solution:    Open the received file in Notepad, look at a garbled piece of text. If somebody is called François or something, with your human intelligence you can guess this. I've created a small app that the user can use to open the file with, and enter a text that user knows it will appear in the file, when the correct codepage is used.  Loop through all codepages, and display the ones that give a solution with the user provided text.  If more as one codepage pops up, ask the user to specify more text. How do I hide Thunderbird from the launcher while running? I have a question for you all.  It's possible to "hide" thunderbird from the unity application bar when thunderbird is running?  For my is unhelpfull see thunderbird on the "mail" tray ( near shutdown button) and the unity "running" application.  If i close thunder with the close button, it don't notify me new email. Steganography - How many bytes of information can you hide in a $1024 \times 768$ photo? What's the difference between an argument and a parameter? When verbally talking about methods, I'm never sure whether to use the word argument or parameter or something else. Either way the other people know what I mean, but what's correct, and what's the history of the terms?  I'm a C# programmer, but I also wonder whether people use different terms in different languages.  For the record I'm self-taught without a background in Computer Science. (Please don't tell me to read  because I'm asking this for the benefit of other people who don't already have a copy of 's marvellous book.)  Summary  The general consensus seems to be that it's OK to use these terms interchangeably in a team environment. Except perhaps when you're defining the precise terminology; then you can also use "formal argument/parameter" and "actual argument/parameter" to disambiguate. How to resume baking fluid simulation? It happens sometimes that after finishing bake (e.g., for fluid simulation) we wish we could continue the simulation for two more seconds :(    How to use the cached bake to continue the simulation?  We played with the settings, but with no success. I've been playing the heck out of this game for the past few days, and I noticed some players had some nice shiny golden guns.  What conditions do I need to fulfill in order to unlock these weapons? (Are the they tied to the story mode, Amiibo, etc.)? How can I set an external display (monitor) as the primary one? Currently the MacBook's display works as primary, so every application I open gets open on the 13" and I have to drag it to the 24". I also don't have access to the dock on my 24".  Is is possible to turn off the MacBook screen and use only the one attached via DVI?  (I've just connected my 24" HP LP2475w via Mini DisplayPort to DVI to my MacBook Pro 13", which works great except for this one thing.) Short expression to convey "but consider the source" Heisenberg Uncertainty Principle scientific proof states that:    $$\sigma(x)\sigma(  p_x )\ge \frac {\hbar}{2}.$$  What is the scientific proof of this principle? Endofunctors of $\textsf{FinVec}$ which are not $C^n$ How to count derangements? I was going through .Suppose that there are n persons who are numbered 1, 2, ..., n. Let there be n hats also numbered 1, 2, ..., n. We have to find the number of ways in which no one gets the hat having same number as his/her number. Let us assume that the first person takes hat i. There are n − 1 ways for the first person to make such a choice. There are now two possibilities, depending on whether or not person i takes hat 1 in return:  A) Person i does not take the hat 1. This case is equivalent to solving the problem with n − 1 persons and n − 1 hats: each of the remaining n − 1 people has precisely 1 forbidden choice from among the remaining n − 1 hats (i's forbidden choice is hat 1).  B) Person i takes the hat 1. Now the problem reduces to n − 2 persons and n − 2 hats.  From this, the following relation is derived: !n = (n - 1) (!(n-1) + !(n-2))  I have a hard time understanding point B and the equation derived. I was trying to understand with an example of 4 people named A, B, C and D and the corresponding hats A, B, C and D. Everyone of them are supposed to wear any hat except their own matching hat i.e. A can wear B, C or D.  If suppose A wears B hat so we will be left with only 3 people and 3 hats. So I can understand "(n-1)!(n-1)" part but what i didn't understand is part B(marked above). Can anyone help? I am currently working through the problems in , with the goal of hopefully understanding how magnets work. At the moment I am a little stuck on one of the early problems in the first chapter. And I would like a Hint about how to proceed. The problem is to solve the time derivative of the expectation value of momentum of a particle. ie: $$ \frac{d\left&lt;p\right&gt;}{dt}. $$ My working so far Just prior to that question the text gives an expression for momentum, $$\int\limits_{-\infty}^{+\infty}{\Psi^*\left[-i\hbar \frac{\partial}{\partial x}\right]\Psi}dx, $$ (Where $\Psi$ is a function satisfying Schrödinger's equation, $i$ is the square root of negative 1, and $\hbar$ is Planck's constant divided by $2\pi$.) So my initial approach was to try and differentiate this with respect to $t$. $$ \frac{d}{dt}\int\limits_{-\infty}^{+\infty}{\Psi^*\left[-i\hbar \frac{\partial}{\partial x}\right]\Psi}dx. $$ However I didn't know how to do that, so I asked around in the maths chatroom, and got a lot of help. Specifically  from @RobJohn: $$ \begin{align} \int vv'\,\mathrm{d}x &amp;=vv-\int vv'\,\mathrm{d}x\\ &amp;=\frac12vv+C \end{align} $$ So I suppose it would follow that, $$ \begin{align} \int\limits_{-\infty}^{+\infty}{         \left(             \Psi^*                 \left[                     \frac{\partial}{\partial x}                 \right]             \Psi         \right)         }\,\mathrm{d}x &amp;=  \left[\Psi^* \cdot \Psi\right]_{-\infty}^{+\infty} - \int\limits_{-\infty}^{+\infty} {\Psi\frac{\partial \Psi^*}{\partial x} }\,\mathrm{d}x\\ &amp;= \frac{1}{2}|\Psi|^2 \Big|_{-\infty}^{+\infty}, \end{align} $$ And then, $$ \begin{align} &amp;\frac{d}{dt}\int\limits_{-\infty}^{+\infty}{\Psi^*\left[-i\hbar \frac{\partial}{\partial x}\right]\Psi}dx \\&amp;=-i\hbar \frac{d}{dt}\left( \frac{1}{2}|\Psi|^2 \Big|_{-\infty}^{+\infty} \right). \end{align} $$ But this feels wrong. I'm not sure exactly why. (Maybe it's just because it is the limits of my maths)  For reference, regarding what I understand, my maths is pretty low-level, I took a course in undergrad calculus over 10 years ago and only just passed that at the time, and my physics knowledge is not much further than that of an enthusiastic lay person. What are examples where a "naive bootstrap" fails? How do I ask LaTeX to exactly fill up a page? I understand that I can control interline spacing in LaTeX in a number of ways. The commands like ,  ,  come in handy in controlling the interline spacing. Each has its own speciality and circumstances of usage, as we can find in these discussions (, , ).  If want to go for a ready made solution for controlling line spacing, packages like  come in quite handy (built-in commands like \onehalfspacing or \setstretch for more finer controls).  Anyway, my problem is a bit different. I have some text (both in paragraph and list mode) which I want to fill up exactly one page. To complicate the scenario, it may even contain equations and graphics. (Let us leave aside floats.)   If I want to solve the problem statically, all I will have to is to play with some value of \baselineskip (or  \setstretch) until satisfied. While this works good for most of the cases, I will have to go through the process again when I want to delete or add some texts.  Would it be possible to have a dynamic value for  \baselineskip or  \setstretch so that my text always fills up one page? (Definitely within reasonable limits.)  Another idea will be to use a number of \vfills between some pieces of texts. But I think that this technique is usable for cover pages only.  I am not putting here an MWE. I think that one is not applicable.    The problem is not a theoretical one, I am preparing some kind of handout which I want to fill-up exactly one page. Infinite sum of ideals I've been trying to prove that given a ring $R$ and a collection of ideals $\{I_{\beta}\}_{\beta \in B}$ in $R$, the set $$\sum_{\beta \in B} I_{\beta}=\{f_1+\cdots+f_r:f_j \in I_{\beta_j}, \mbox{ for some } I_{\beta_j}\}$$ is an ideal and is the smallest ideal containing $\cup_{\beta \in B} I_{\beta}$.  I've already proved when I only have two ideals, and so, using induction, I've seen it for finite sums. But I don't see how to generalise that to an arbitrary family of indexes (maybe infinite) $\beta$.   Could someone please give me a hand? Thank you. Does a linear operator obeying Leibniz rule imply it is a differential operator? Is there something I can add to the preamble of my document such that multiple letters without spacing in a Math environment (such as $NP$) do not have extra spacing between them and are not considered multiple distinct variables? Right now, I have to use $\mathit{NP}$ to prevent any extra spacing, but I feel that it is more natural to add a space between the letters if they are a different variable ($N P$). For example, if I want the multi-letter variable NP, I want to be able to say $NP$ which would automatically be replaced by $\mathit{NP}$. If I want N and P to have the proper inter-variable spacing, I want to do that only when they are separated by a space, like so: $N P$. Is there a way to achieve this? Would it break something that I'm unaware of? Edit: Here's a screenshot that shows what I mean:  So basically, is it possible for line 1 to automatically give me line 3 and for line 2 to give me line 2? I receive the error 'grub-install /dev/sda failed' while attempting to install Ubuntu as the computer's only OS. I am attempting to install Ubuntu on a box which was previously running Windows 7.  I have also experienced the dreaded "Unable to install GRUB" error.  I am not attempting to dual boot. I have previously run a Windows boot disk and removed all existing partitions.  If I run the Ubuntu 12.04 install CD and click install after the config screens, I get the error   Executing 'grub-install /dev/sda' failed. This is a fatal error. (It is the same error as this question: )  All the questions I've read while looking for a solution are related to dual boot.  I'm not interested in dual boot, I'm after a clean out the box Ubuntu install. How can I achieve this?  (For my sanity, please use very simple instructions when responding. I don't claim to have any talent either for linux or as a sysadmin)    Additional details copied from comments dated: 2012-05-29 ~15:19Z  After booting from the CD, clicking Try Ubuntu, and then sudo fdisk /dev/sda I get fdisk: unable to seek on /dev/sda: Invalid argument  sudo fdisk /dev/sdb gives   Device contains neither a valid DOS partiion table, nor Sun, SGI or OSF disklabel.  Building a new DOS disklabel with disk identifier 0x15228d1d.  Changes will remain in memory only until you decide to write them.  After that of course, the previous content won't be recoverable.  Warning: invalid flag 0x0000 of partition table 4 will be corrected by w(rite).  Command (m for help):   I should add the Live CD desktop is graphically bad. I've got missing parts of programs and the terminal occasionally reflects to the bottom of the screen. But I can't imagine this is related.