Changing my shell
Change default shell for Terminator
Order of automorphism group of cyclic group Let $G$ be a cyclic group of order $m$. What is the order of $\text{Aut}(G)$?  I want to know the proof as well (elementary if possible). I would still accept the proof if one answers with $m = p$, a prime. Or on top of that, I would accept the answer with extra assumption: $q \equiv 1$ mod $p$ with another prime $p$. Lie Algebra of $SL_n(\mathbb H)$ The Lie algebra of $SL_n(\mathbb C)$ are the matrices where the trace is $0$. But what is the Lie algebra of $SL_n(\mathbb H)$ where $\mathbb H$ is the quaternions? How do I get from Terminal 1 to Terminal 5 in Fiumicino Airport? The official site mentions a shuttle bus service, I also googled but the infos are not clear, so I hope to find some firsthand experience.  I have a flight with a stop in Fiumicino, I will arrive in Terminal 1 and the next departure is from Terminal 5, the transfer time is around 5 hours.  Is it correct that I should go to Terminal 3 first (using the internal transfer area) and after exit from Terminal 3 and take the shuttle to Terminal 5?  The terminal 5 has a waiting area with some shops or is just a terminal for departure? In your opinion is better to wait some hours inside Terminal 3 before going out to take the shuttle bus? Plotting an epicycloid Prevent Windows 10 installer from using the preinstalled serial key without disabling UEFI My laptop (a Lenovo Flex 2 15) came preinstalled with Windows 8 Standard (with the serial key preinstalled into the BIOS), and I've since installed an SSD (a Samsung Evo 840 120GB) &amp; upgraded to Windows 10.  When the laptop still had its hard drive, I upgraded it to Professional so I could use the resources provided by the domain on my homeserver; because of this, I can only use the Professional editions of Windows (Home can't join domains).  I bought Windows 10 Professional &amp; completed a fresh-install (complete reinstallation) of Windows, only that it installed Windows 10 Home instead of Professional. I'm guessing this is due to the Windows 8 Standard Edition serial key preinstalled in the BIOS.  I then downloaded an All-In-One ISO image of Windows 10 from MSDN (of which I have limited access to), transferred the installer onto a USB stick, &amp; reinstalled (a clean install again). However it's still installing Windows 10 Home.  If I try to install using the AIO image from within Windows, the installer does not present me with a list of options for the edition I want to install; instead, it assumes that I want to install Home Edition:    I am able to get Windows 10 Professional to install if I disable UEFI &amp; use Legacy instead, but I feel that this is stepping around the issue rather than resolving it.  Is it possible to have the Windows 10 installer ignore any serial keys preinstalled in the BIOS/UEFI? If so, how? If not, is using Legacy mode really the only way around this? Even though I have the latest Adobe Flash player 11.2 for Linux in Firefox -   - a particular online flash game still requests that I update to the latest flash player.  I've tried this online game on my laptop (Windows 8 with Flash Player 11.8) and it has no problems.  Is there a way to trick Ubuntu or this game into thinking Flash Player 11.8 is "installed"? What are the drawbacks with using UUID or GUID as a primary key? I would like to build a distributed system. I need to store data in databases and it would be helpful to use an  or a  as a primary key on some tables. I assume it's a drawbacks with this design since the UUID/GUID is quite large and they are almost random. The alternative is to use an auto-incremented INT or LONG.  What are the drawbacks with using UUID or GUID as a primary key for my tables?  I will probably use Derby/JavaDB (on the clients) and PostgreSQL (on the server) as DBMS. How can I remove duplicate values from a multi-dimensional array in PHP?  Example array:  Array (     [0] =&gt; Array     (         [0] =&gt; abc         [1] =&gt; def     )      [1] =&gt; Array     (         [0] =&gt; ghi         [1] =&gt; jkl     )      [2] =&gt; Array     (         [0] =&gt; mno         [1] =&gt; pql     )      [3] =&gt; Array     (         [0] =&gt; abc         [1] =&gt; def     )      [4] =&gt; Array     (         [0] =&gt; ghi         [1] =&gt; jkl     )      [5] =&gt; Array     (         [0] =&gt; mno         [1] =&gt; pql     )  ) A story where technology is forbidden, but used by priests I am looking for a story I remember reading in the mid-90s. I can't remember if it was a trilogy or just a three part book, but I know it was in paperback book form. I also know it was found in the Young Adult section of the library at that time.  The general premise was that there had been some sort of war in the past and machines were outlawed. People visited priests who used magic. I remember that the main character discovers that the priest aren't using magic but are actually using machines.  I can also remember the main character ends up leaving the nation he is in and ends up in a neighboring nation where machines are allowed. I remember there being a scene where he watches a "movie" which I think was more like an old fashioned moving picture.  For some reason I keep wanting to tie this whole thing back to a sword, or blue sword, or something like that, but I might be mixing stories. Other things I keep linking to it: the character was in training to be a priest, he was forced to leave, he ended up using the neighboring nation to conquer his homeland. Again, still not sure if I am mixing things but they keep popping up.  I do know that it is not The Blue Sword by Robin McKinley, or its prequel, The Hero and the Crown. Prediction based on bayesian model I have created a bayesian model that estimates 6 parameters using rjags from R. Now i want to do some predictions based on new data in R. Can anyone help me with an example.  model {    B.m[1] &lt;- Kb # mean B[1]    B[1] ~ dnorm( B.m[1], tau_B)    for(t in 2 : 10) { # Process model       B.m[t]&lt;- max( B[t-1] + rB[t-1](1 -B[t-1]/K) - C[t-1] , 0.0)       B[t] ~ dnorm(B.m[t], tau_B) } # Observation mode       for (t in 1: 10) {          LogC_mean[t] &lt;- log( max(qsegB[t]Eff[t], 0.000001))          C[t] ~ dlnorm(LogC_mean[t], tau_c) } # Prior          b~dbeta(1, 1)          cv &lt;- 1          K.mean &lt;- 500000          K.v &lt;- pow(cvK.mean, 2)          K.tau &lt;- 1/K.v          K ~ dnorm(K.mean, K.tau)          r ~ dlnorm(0.0, 1.4)          qseg ~ dlnorm(-15.4, 1.44)          tau_c ~ dgamma(0.001,0.001)          tau_B ~ dgamma(0.01,0.01)        }     } What's the function of the ~ bitwise operator (Tilde) Allow people to answer protected questions if they have earned at least some amount of combined SE rep The purpose of protected questions is, according to the message presented on such a question, "to prevent 'thanks!', 'me too!', or spam answers by new users." The more verbose  agrees on the purpose. And the  says this is why protected questions exist:     Some questions are protected because they are expected to attract   either spam or users -- often new users -- who may mistake the site as   a traditional forum, posting "noisy" answers such as "Thank you" or   "This worked for me" or "I'm also having this problem".   Considering this, shouldn't a user be able to answer protected questions if they have gained at least 10 rep on any stack exchange site? If they've already demonstrated one site that they are familiar enough with the SE Q/A format to not be a drive-by useless answerer, shouldn't that confidence in them carry over to other SE sites?  Or maybe at some level of combined SE rep this restriction should be waived. I find it silly that at 15k+ combined network rep, I'm unable to answer a protected question on a SE site I've just started using. What is a good package for displaying algorithms? I found this page with some examples:   I'm wondering which one to use. Any suggestions? I'm using other packages too so whichever is less likely to interfere with them is better for me. Puppet client not connection to master - SSL connect Error I installed the puppet master and agent on the same machine. When the client is started, I got the following error message.  puppet agent --server=agent.com --no-daemonize --debug    err: Could not retrieve catalog from remote server: SSL_connect returned=1 errno=0 state=SSLv3 read server certificate B: certificate verify failed.  This is often because the time is out of sync on the server or client How can I check the actual size used in an NTFS directory with many hardlinks? On a Win7 NTFS volume, I'm using cwrsync which supports --link-dest correctly to create "snapshot" type backups. So I have:  z:\backups\2010-11-28\cygdrive\c\Users\... z:\backups\2010-12-02\cygdrive\c\Users\...   The content of 2010-12-02 is mostly hardlinks back to files in the 2010-11-28 directory, but there are a few new or changed files only in 2010-12-02. On linux, the 'du' utility will tell me the actual size taken by each incremental snapshot. On Windows, explorer and du under cygwin are both fooled by hardlinks and shows 2010-12-02 taking up a little more space than 2010-11-28.   Is there a Windows utility that will show the correct space acutally used? Test the series whose general term is: $$\sqrt{n^2 + 1} - n$$   This is from Higher Algebra by Henry Sinclair. I'm struggling to understand how this series is divergent. If you do the following expansion: $$\sqrt{n^2 + 1} - n$$ $$= n\biggl(1 + \frac{1}{n^2}\biggr)^\frac{1}{2} - n$$ $$= n + \frac{1}{2n} - \frac{1}{8n^3} + ... - n$$ $$= \frac{1}{2n} - \frac{1}{8n^3} + ... $$  The remaining series appears to converge to zero as $n$ approaches infinity.  Their explanation is similar to mine, but at the end they say that the above series approaches $\frac{1}{2n}$. From there they directly say that the series is divergent. Earlier in the chapter, it's proved that the expansion of $(1 + x)^n$ is convergent for $x &lt; 1$. In this case, $\frac{1}{n^2} &lt; 1$ as $n$ approaches infinity, so I would assume that the series converges.  The solution to the problem is given  (number 17)  Any help is appreciated. Thanks. Who would get the longest road? Imagine the following setup. There are 3 (or more) players with an equally long road. What would happen if the longest road was broken? How is it decided who obtains the longest road from there on? Randomly populating procedural shape (or Image Texture) in Cycles TL;DR  How to take a shape or Image Texture and multiply it with random Location, Rotation and Scale along object:    Background  I have created my first procedural shape on my own from this function: $(x^2 + y^2 - 1)^3 - x^2y^3 = 0$   (big yay for math idiot)   Here is the result:    And I want to do something useful with it.  Research  I've tried to find something similar over the web (this is trending right now) and I'm surprised that this question wasn't asked before or I'm looking with wrong terms. I've tried random pattern, duplicating texture, populating image, random tiles, custom tiles and such. There is a lot about tiling textures but each and every Q&amp;A I've stumbled upon are about non overlapping ones. For example:            Tryout:  The only way I can think of this is to duplicate shape as a group and manually change values in Mapping Nodes:    As you can see this is... Well. Bad.  I've tried messing with Modulo, mixing Noise between vectors, using custom node groups for LocRotScale (thanks Gandalf) but results was none, thus nothing even to show.  Question  I want to populate this shape (or any other) along the object with random Location, Rotation and Scale - with control over its number/density and maybe variation strength.  Edit: I'm not looking for alternative methods of creating this setup such as Particles, Image Textures generated in 3rd party software, OSL shaders (CPU only) and such. My intention is to use this in procedural texture generation in Cycles with GPU support.  Blend file  Nothing really needed for this question but here - have this heart from me :) factorization of a^n+1? How to know current name of the database in Django?