Install of Linux Mint recommends drive encryption and uses ecryptfs. Unfortunately, they don't want you of the trouble you are getting into. eCryptfs seems near impossible to remove cleanly. There are "explanations" that are totally unclear on essential steps. The evidence of this is that there continue to be questions on how to remove it.   You can see just what a mess it is by checking out this forum post on Linux Mint Forums, .
Few days back I have installed ecryptfs, created a private directory using it. Now my Ubuntu login became super slow. I have tried removing ecryptfs from Synaptic. I found It, it can not be deleted that way. Somewhere I have read about this command  ecryptfs-setup-private --undo   But this command displays a rather confusing list of commands on terminal. I don't want to mess up my installation, neither want to loose my administrator account.  Now my question is, how can I safely remove /home/user/Private (.Private) and remove ecryptfs encryption ?
AutoFixture with AutoMoq and concrete object injection Strictly Upper Triangular $n\times n$ Matrices form a Nilpotent Lie Algebra over $\mathbb{C}$ for $n\geq 2$ I have been attempting this problem for a while, it is an assignment problem so I don't want somebody to just post the answer, I'm just looking for hints.  Let $\mathfrak{u}(n,\mathbb{C})$ be the Lie algebra of strictly upper triangular $n\times n$ matrices over $\mathbb{C}$.  I am trying to show that $\mathfrak{u}(n,\mathbb{C})$ is a nilpotent Lie algebra for $n\geq 2$.  This is what I have looked at so far.  I have done some explicit calculations (I shall omit the bulk of them and just summarise below) for $n=2,3,4$ and have come up with some ideas.  Let $L=\mathfrak{u}(n, \mathbb{C})$.  If $n=2$,  $L^1 = [L, L] = &lt;0&gt;_{\mathbb{C}}$  So $L$ is nilpotent.  If $n=3$,  $L^1 = [L, L] = &lt;e_{13}&gt;_{\mathbb{C}}$  $L^2 = [L, L^1] = &lt;0&gt;_{\mathbb{C}} = \left\{ 0 \right\}$  So, $L$ is nilpotent.  If $n=3$  $L^1 = [L,L] = &lt;e_{13},e_{14},e_{24}&gt;_\mathbb{C}$  $L^2 = [L,L^1] = &lt;e_{14}&gt;_{\mathbb{C}}$  $L^3 = [L, L^2] = &lt;0&gt;_{\mathbb{C}} = \left\{ 0 \right\}$  So, $L$ is nilpotent.  So my hypothesis so far is that for an arbitrary $m\in\mathbb{N}$, $L^{m-1}=\{0\}$  My instinct is to do this by induction. My base case, $n=2$ has already been shown. Now I assume that $\mathfrak{u}(n,\mathbb{C})$ is nilpotent for $n=k$ ($k\in\mathbb{N}$) and consider the case for n=k+1.  However, I have no idea how to link these two cases together. I have read in Introduction to Lie Algebras and Representation Theory - J.E. Humphreys that $L^k$ should be spanned by basis vectors $e_{ij}$ where $j-i=k+1$ - however in my calculations for $L^1$, I obtain an $e_{14}$ which does not satisfy 4-1=2.  Am I missing something completely obvious? Or have I made a mistake somewhere? (I have checked my calculations numerous times, but cannot find any errors!)  Thanks,  Andy. I am trying to install chrome browser via command line.  I tried this:  $ apt-cache search chrome browser   The results show that the proper term is "chrome-browser," so I tried that:  $ sudo apt-get install chrome-browser   And then "Y" for the Y/n question.  But the installation threw errors.  Does someone see anything wrong with the commands I issued? Maintaining Units of measure across type converstions Why is integration the inverse of differentiation, I mean why do I get the same function when I integrate and then differentiate the result? Is there a way to opt out of Alexa rankings or prevent them from gathering data about my site? My competitor is using Alexa to see what I am doing. I need to get stop Alexa from including my sites in their rankings. How can I do so?   Is it possible to deny access to any visitor with the Alexa toolbar and deny access to Alexa bot requests? If you have to provide some initial troubleshooting support by phone [or email], and you don't have access to the user's PC itself, what is the easiest and most foolproof question one can ask of the user to find out if the 'dumb' user is using either Windows 7 or Windows Vista?  For example: determining if the user has either Windows XP or Windows Vista/7 is easy. Just ask the user if the button at the left bottom corner is (a) either square with the word 'Start' on it, or (b) it is a round button.   But how do you determine the difference between Vista and 7?  Edit: For all the existing answers the user has to type something, and do it correctly. Sometimes even that is already hard for a computer illiterate user. My XP example just requires looking. If it exists (although I am afraid it doesn't), I think a solution that is just based on something this is visually different between Vista and 7 would stand above all others. (Which makes Dan's suggestion to turn over the box and look at the label" not so stupid). Perhaps the small 'show desktop' rectangle at the right side of the task bar (was that present in Vista)? Changing affiliation on publication Find the value of $y(1)$ of the ODE $y'+y=|x|$. Let $y$ be the solution of $$y'+y=|x|$$ for $x\in\mathbb{R}$ and $y(-1)=0$. Then the value of $y(1)$ is    $\frac{2}{e}-\frac{2}{e^2}$ $\frac{2}{e}-2e^2$ $2-\frac{2}{e}$ $2-2e$   I don't know what to do with the absolute value function in this problem. So I started like the regular first order equation by calculating integrating factor, and got $$ye^x=\int |x|e^x dx+C.$$ Now I got stuck as how to tackle the absolute value function? Help me to solve this. Thanks! How to cancel a jquery.load()? I'm planning on re-watching the currently-released 5 Marvel films prior to seeing The Avengers.  Have Marvel released any sort of official viewing order?  Captain America: The First Avenger seems like the hardest one for me to place in order with the rest.  It takes place prior to the other films, but has the greatest number of references to the other films.  So should it be watched first, or last?  The rest of them are relatively clear, as they're chronological in the order they're released, with the possible exception of The Incredible Hulk and Iron Man 2 happening at the same time. How to mathematically evaluate a string like "2-1" to produce "1"? Here's the very dumb way:  def divisorGenerator(n):     for i in xrange(1,n/2+1):         if n%i == 0: yield i     yield n   The result I'd like to get is similar to this one, but I'd like a smarter algorithm (this one it's too much slow and dumb :-)  I can find prime factors and their multiplicity fast enough.  I've an generator that generates factor in this way:  (factor1, multiplicity1) (factor2, multiplicity2) (factor3, multiplicity3) and so on...  i.e. the output of   for i in factorGenerator(100):     print i   is:  (2, 2) (5, 2)   I don't know how much is this useful for what I want to do (I coded it for other problems), anyway I'd like a smarter way to make  for i in divisorGen(100):     print i   output this:  1 2 4 5 10 20 25 50 100     UPDATE: Many thanks to Greg Hewgill and his "smart way" :) Calculating all divisors of 100000000 took 0.01s with his way against the 39s that the dumb way took on my machine, very cool :D  UPDATE 2: Stop saying this is a duplicate of  post. Calculating the number of divisor of a given number doesn't need to calculate all the divisors. It's a different problem, if you think it's not then look for "Divisor function" on wikipedia. Read the questions and the answer before posting, if you do not understand what is the topic just don't add not useful and already given answers. How can I start the Blood on the Ice quest? I am currently part of the Stormcloaks and just finished Rescue from Fort Neugard. The Jarl wants to make me a thane and is telling me to buy a house, but his steward is telling me the house is unavailable due to some unpleasantness. I have already completed the 5 quests to help people of Eastmarch.  From what I can see online, I need to begin the Blood on the Ice quest. It is supposed to begin by walking in the windhelm graveyard at night, however every time I go there I don't see anyone.  Someone online said it's possible to miss the scene that triggers the quest if you go into Windhelm and leave without triggering it, but I am hoping this isn't the case. I am in Windhelm a lot because the Enchanting table, Blacksmith, and Fence are all in one location, so find it very convenient. The lady who is supposed to be murdered in the Graveyard (Susanna) is still alive in Candlehearth Hall, so I think I'm not bugged.  The wiki suggests that you have to "The quest will initiate after you entered Windhelm four times from another hold", however I have entered and left quite a few times during the course of my game and know I've been here way over 4 times.  I tried pickpocketing the key, however I don't automatically get the quest on entering the house, and there are a bunch of "Investigate InvestigationTarget" spots in the house. Also, I was reading the Butcher's journal and he was saying he almost caught Susanna when she left Candlehearth, however I have never seen her leave Candlehearth. Perhaps my glitch is she never leaves? I'll have to head to Windhelm on another character and check it out.  Also, I saw something online saying this quest won't trigger if you go past 245 in-game days. Would someone be able to confirm this for me? (Have the XBox version, so waiting 245 days is annoying)  Can someone tell me the exact steps to begin this quest? New "[tag:" syntax interferes with Markdown links Links in [link text][number] format don't work properly if they follow a tag using the new [tag:tagName] format. Here's the result of [tag:python] [gold badge page][1]:      [gold badge page]   Putting the tag inside the link is worse. Here's the result of [[meta-tag:bug] some text][2], where [2] is google.com:        The part of the link outside the tag just disappears silently.  EDIT: To be more precise, the entire link to [2] disappears. The markup that is produced contains (invalid) nested anchor tags, as shown here from Firefox's "View Source":  &lt;a href="http://google.com" rel="nofollow"&gt;&lt;a href="/questions/tagged/bug" class="post-tag required-tag" title="show questions tagged 'bug'" rel="tag"&gt;bug&lt;/a&gt; some text&lt;/a&gt;   So the tag is still a link, but it is a link to the tag page, which is the behavior it would have if the link to [2] didn't exist at all. The user's desired behavior in this case is... ambiguous, to be charitable.  EDIT 2: I briefly included markup from Firebug here, but it turned out to be irrelevant. It has now been removed to improve readability. See  if you're interested. SF novel about one-way scientific expedition to inhabited planet, where telepathic aliens "talk" sort of ++like this++ and ~*~this~*~ I'm looking for a novel I read in the mid-to-late 1990s. It was a science fiction novel about an expedition of scientists sent at sub-light-speed (maybe in cryo-sleep?) to investigate a star system. Once there they set up a permanent scientific outpost.  There was at least one inhabited planet in the system, with a sentient species that communicated telepathically. The aliens' speech was represented with various symbols instead of quotation marks, with each named character having (I think) its own characteristic set of symbols, as in the title of the question. The scientists are eventually able to communicate with these (generally friendly) aliens.  The thing I remember most clearly is the end of the book. This was a one-way trip for the scientists, so gradually they all die off from various causes. When the next-to-last member of the crew dies of old age, the survivor is looking for an epigraph for her funeral, and (ironically, considering my current plight) can't find it in his search of the electronic library. He finally discovers it under "humor" because it's by Mark Twain: "Wherever she was, there was Eden." (This quote, of course, I found immediately in  and many other sources; it's from Eve's Diary.)  Other pieces of information I'm less sure of:   I don't think the planet was hospitable to humans; it may have been something like a gas giant, with the aliens "swimming" through the gas. I think the scientists stayed in an orbital space station, though they may have made expeditions to the planet in vehicles or protective suits. There may have been a "twin" planet, or a moon in an eccentric orbit, that caused periodic "flares" of some sort on the aliens' planet. There might have been some conflict between the crew early on, maybe because there was a non-scientific (military) commander, or perhaps just because people have conflict. I think the author was of sort of middling fame; respected and known by SF enthusiasts, but not a superstar like Asimov or Clarke. Almost certainly male, and probably with a professional science background. I think the science was fairly authentic, although the first-contact bit was obviously highly speculative. Is it a scam if the person only wants to deposit into my account, not make a withdrawal? How to make partitions mount at startup? How do you make HDDs and partitions mount at startup on Ubuntu?  I always keep my media and data files on separate partitions - one 2tb HDD and a 400 odd gig partition.  I have been trying to swap the default folder location for the home directory to my other drives.  It works when I change the /home/user_name/.config/user-dirs.dirs file to the directories I want, but only until I reboot the system. I am only assuming that the drives not mounting is the problem with it, but it would be helpful either way.  If any one knows another reason for why the directories change back to default each time that would be good also. How does the loopback interface work Jointly Complete Sufficient Statistics: Uniform(a, b) Let $\mathbf{X}= (x_1, x_2, \dots x_n)$ be a random sample from the uniform distribution on $(a,b)$, where $a &lt; b$.   Let $Y_1$ and $Y_n$ be the largest and smallest order statistics.  Show that the statistic $(Y_1, Y_n)$ is a jointly complete sufficient statistic for the parameter $\theta  = (a, b)$.     It is no problem for me to show sufficiency using factorization.   Question: How do I show completeness? Preferably I would like a hint.    Attempt: I can show $\mathbb E[g(T(x))] = 0$ implies $g(T(x)) = 0$ for the one parameter uniform distribution, but I am getting stuck on the two parameter uniform distribution.   I tried playing around with $\mathbb E[g(Y_1, Y_n)]$ and using the joint distribution of $Y_1$ and $Y_n$, but I am not sure if I am going in the correct direction, as the calculus is tripping me up.