Firefox style left hand bookmarks menu for chrome
Bookmark panel in Chrome/Chromium like in Firefox
SQL Server CE in a multi user scenario - is this really, really stupid? How to prove that any (integer)$^{1/n}$ that isn't an integer, is irrational? Is my proof beneath perfect and complete?  I wanted to prove that for any nth root of an integer, if it's not an integer, than it's irrational: $$\begin{cases} m,n\in \mathbb{N}\\\sqrt[n]{m}\notin \mathbb{N} \end{cases}\implies \sqrt[n]{m}\notin \mathbb{Q}.$$  I start by assuming that $m^{\frac 1n}$ is rational and non-integer. So there exist  co-prime integers $a,b$ so that $$\sqrt[n]{m}=\frac{a}{b}$$ $$\implies  m=\frac{a^n}{b^n}\in\mathbb{N}.$$ But since $a$ and $b$ have no common factor, $a^n$ and $b^n$ also have no common factor. So: $$\frac{a^n}{b^n}\notin\mathbb{N},$$ a contradiction. Using strtok with a std::string I have a string that I would like to tokenize. But the C strtok() function requires my string to be a char*. How can I do this simply?  I tried:  token = strtok(str.c_str(), " ");    which fails because it turns it into a const char*, not a char* I have a 24/7 always-on Debian Jessie based headless home server that has a large 1TB SSD for the OS and all of my frequently accessed files. This same system has 4 larger hard disk drives in a SnapRAID array. These are mainly for archiving infrequently accessed Blu-rays and want those drives to remain spun down in standby unless I actually read or write to them. They are all formatted as ext4 and mounted with noatime and nodiratime enabled.  So even though no process or program should be regularly accessing those drives in any direct way, the hard drives constantly get spun up from standby. It seems to be related to graphical programs that provide a gui file browser, even something like Chromium. If I don't even browse into those drives, I'm thinking that these processes by simply getting a list of available drives spins up the hard disks. Much like blkid does. The problem is, it's hard to determine the root cause of this since none of these processes are actually reading or writing the filesystem on those drives, so no files are actually changing or being touched. Is there some sort of cache that I can populate or a buffer to prevent these programs from spinning up the hard drive simply by getting a list of available disks? This is honestly driving me insane, since I can't find a reliably way to keep these disks spun-down even though there is no direct access of the filesystem.  UPDATE: Thanks to Stephen's answer, I was able to trace the disk activity to gvfs and udisks. It's a real shame that these processes insist on waking up disks in standby when they aren't actually being accessed to do any real I/O with the filesystem. So far I just uninstalled them, knowing that it will remove some functionality from PCManFM and the like. What is the correct pronunciation of the word "solder"? I have been listening to a podcast where the host pronounces the word solder as "sodder" or "sod-der", even "saw-der". Same thing happened when the lecturer of one of my EE classes pronounced the word solder. As for me I pronounce the word solder as "sole-der" with a distinct L and a longish O. Filling NoData gaps in raster using ArcGIS Desktop? Sort by author in Alpha bibliography Using the alpha bibliography style, citations are sorted by the citation key. I'd like to use the same style of authors-year citation keys (e.g., [CP92]) but have the bibliography sorted by the first author's lastname instead of alphabetically by the citation key itself. This would keep the same papers by the same first author together.  For example, alpha would produce the following sorted order:        [Cha81] D. Chaum. Untraceable...   [CL04] J. Camenisch and A. Lysyanskaya. Signature...   [CP92] D. Chaum and T. Pedersen. Wallet...      Whereas, abbr would produce the following sorted order:        [1] J. Camenisch and A. Lysyanskaya. Signature...   [2] D. Chaum. Untraceable...   [3] D. Chaum and T. Pedersen. Wallet...      I am looking for the same sorting as abbr but maintaining the citation key style of alpha.  Is there a way to achieve this hybrid style? How do I permanently allow a website to access my location? In iOS, I only need to be asked once whether I want to allow a website to share my location data. Is it possible to permanently do this in OS X version of Safari as well? I have realized that to pronounce the plural form of words ending in -th, we have to drop the letter "h". e.g. Months is pronounced /mʌnts/. But I have never seen this point mentioned in any context. I just want to make sure that this rule is correct and can be always applied. If $X$ is measurable space, $f : X\to [-\infty,+\infty]$, function such that $f^{-1}([-\infty,r))$ measurable for all rational numbers $r$,prove than $f$ is measurable  I know that $f$ is measurable iff set $\{x\in X : f(x)&lt;a\}$ is measurable for all $a\in \mathbb{R}$ but for $a\in\mathbb{Q}$ I don't know how to proceed. Prove there are no other solutions of functional equation $f(x+y) = \frac{f(x)+f(y)}{1-f(x)f(y)}$ When does $\lim_{n\rightarrow \infty} a_n = 0$ imply $\sum_{n = 0}^{\infty} a_n$ converges? This is just a general question. I know the opposite statement is always true. I'm just asking when the converse holds. I know that the converse is not true in some cases, such as for harmonic series. What additional restrictions are needed to make this statement true? How to flatten a list to return a new list with all the elements? The computer gave me this output in a window:  E: Encountered a section with no Package: header E: Problem with MergeList /var/lib/apt/lists/archive.ubuntu.com_ubuntu_dists_natty_main_binary-i386_Packages E: The package lists or status file could not be parsed or opened.   How can I fix this? Alternating sum of binomial coefficients multiplied by (1/k+1) I'm trying to prove that  $$\sum_{k=0}^n {n \choose k} (-1)^k \frac{1}{k+1} = \frac{1}{n+1}$$  So far I've tried induction (which doesn't really work at all), using well known facts such as  $$\sum_{k=0}^n {n \choose k} (-1)^k = 0$$  and trying to apply identities like  $${n \choose k} = {n-1 \choose k-1} + {n-1 \choose k}$$  Would anyone be able to point me towards the right method? Should I be looking to apply an identity or is there a method I'm missing? Galois Group of $\sqrt{2+\sqrt{2}}$ over $\mathbb{Q}$ So I want to show that $\mathbb{Q}(\sqrt{2+\sqrt{2}})$ is Galois over $\mathbb{Q}$ and determine its Galois group.   My thoughts are as follows:  Define $\alpha := \sqrt{2+\sqrt{2}}$. Then it is easily shown that $\alpha$ satisfies $\alpha^4-4\alpha^2+2=0$.  Define $f(x) := x^4-4x^2+2$. Then $f$ is irreducible over $\mathbb{Q}$ by Eisenstein with $p=2$.  So we have that $f$ is the irreducible polynomial for $\alpha$ over $\mathbb{Q}$.   Further $|\mathbb{Q}(\alpha):\mathbb{Q}|=4$.  For $\mathbb{Q}({\alpha})$ to be Galois, it must contain all roots of $f$.   Define $K=\mathbb{Q}(\alpha)$ for convenience.  Define $\alpha := \alpha_1$.  Since $f$ has only even powers, we know that $-\alpha := \alpha_2$ is a root, and therefore contained in $K$ since $K$ is a field.  We note that the other two roots are $\alpha_3=\sqrt{2-\sqrt{2}}$ and $\alpha_4=-\sqrt{2-\sqrt{2}}$.  So in order to show $K$ is Galois, it must be shown that $\alpha_3$ and $\alpha_4$ lie in $K$.  Now $\alpha_1^2=2+\sqrt2$ and so $\sqrt2 \in K$. Thus $-\sqrt2 \in K$ since $K$ is a field.  Can somebody explain why $\alpha_3$ and $\alpha_4$ lie in $K$?  Next we are to determine the Galois group of $K$.  Assuming $K$ is Galois, since it has degree $4$ over $\mathbb{Q}$ (shown earlier), we know that its Galois group has size $4$. There are only two groups of size $4$, namely $V_4$ and $C_4$, the Klein four group and the cyclic group of order $4$.  How do we determine which of these choice is in fact the Galois Group? I recently got a Windows 10 laptop. Opposite to my Macbook, I must swipe right-to-left to go to the right virtual desktop. Is there a way to reverse this, so I swipe left-to-right to go to the right virtual desktop? Russian SE has a slightly longer and more storied history than Japanese SO Standard purpose of favorites I am wondering if my behavior regarding favorites is typical.  More importantly, if it isn't typical, does my behavior conflict with an internal metric designed to reward favorite'd questions?  I mark a question as a favorite for a few reasons:  A -- I find the question/answer(s) remarkable enough that coming back to them time and time again is of benefit to me.  B -- I am waiting to see if a sub-par quality question is going to be revised enough for me to come back and answer it.  Either way, I eventually remove my favorite.  C -- I have answered a question (of any quality) and am wanting to be notified of any competing answers.    Situations B and C are the most common for me and they typically mean I will go back and remove my favorite star later; I don't remove it because the quality of the question degraded, I merely don't want to be notified any longer.  Even stranger, I am often favoriting questions that are rather low-quality (reason B) making me wonder if low-quality posts are being rewarded via some invisible metric because I (at least temporarily) have given it what looks like a stamp of approval akin to an up-vote.    I suppose the feature being called "Favorite" makes me confused because most of the questions I select are not my favorite.  Am I accidentally messing with an invisible metric that is drawing attention to posts when that isn't desired behavior? Could Muggles enter Diagon Alley from Leaky Cauldron? Courtesy of , I found the a bit of  (currently un-cited):  The Leaky Cauldron The pub serves as a way of entering into Diagon Alley from the Muggle world for Muggle-borns and their parents (both of whom, until the first letter from Hogwarts, have no magical knowledge or means of entering). The rear of The Leaky Cauldron opens onto a chilly little courtyard, in which a particular brick must be tapped three times to open a path to Diagon Alley.  But from what I can see, Muggleborns and their parents wouldn't be able to enter from Leaky Cauldron, because - based on what I can tell - that requires one to use a wand:  He {{Hagrid}} tapped the wall three times with the point of his umbrella. The brick he had touched quivered – it wriggled – in the middle, a small hole appeared – it grew wider and wider – a second later they were facing an archway large enough even for Hagrid, an archway on to a cobbled street which twisted and turned out of sight.  Is there some canon information confirming the Wikipedia assertion that Muggle parents and not-yet-wand-owning Muggleborns could enter Diagon Alley from the courtyard behind Leaky Cauldron?