Worry about oversized check in luggage
Is it safe to knowingly buy an oversized (67-inch) suitcase? Are size limits enforced?
What is the sum of the power series: $\sum_{k=2}^\infty\frac{x^k}{k(k-1)}$? What is the function represented by the power series $$ \sum_{k=2}^\infty\frac{x^k}{k(k-1)}\quad? $$  It looks like $\dfrac1{1-x}$ but I don't know. For bash script, I can use "$@" to access arguments. What's the equivalent when I use an alias? Is this series known to converge, and if so, what does it converge to (if known)?  Where $p_n$ is prime number $n$, and $p_1 = 2$,  $$\sum\limits_{n=1}^\infty \frac{1}{p_n}$$ Can someone pgfplots the following picture concerning confidence intervals? I've been trying to use the following code to produce it, but have no idea how to shade in the tails I am interested in. By the way, the line pointing the (100-C/2)% can be an arrow, does not have to be squiggly as depicted in the picture.   \begin{tikzpicture}[ every pin edge/.style={&lt;-}, every pin/.style={fill=yellow!50,rectangle,rounded corners=3pt,font=\small}] \begin{axis}[every axis plot post/.append style={   mark=none,domain=-3:3,samples=50,smooth}, clip=false, axis y line=none, axis x line*=bottom, ymin=0, xtick=\empty, ] \addplot {\gauss{0}{0.5}}; \addplot {\gauss{0}{1}}; \node[pin=70:{$\hat{\theta}_1$}] at (axis cs:0.57,0.5) {}; \node[pin=270:{$E(\hat{\theta} = 0$}] at (axis cs:0,0) {}; \draw[dashed] (axis description cs:0.5,0) -- (axis description cs:0.5,0.92); \end{axis} \end{tikzpicture} I have 14" 16:9 notebook and would like my Windows 10 taskbar have on the (left) side. Unfortunately, although I set it to small icons the bar is pretty wide. Do not you know how to make it thinner?  This is how I would like to have it: How does rolling two d20 and taking the higher affect the average outcome? D&amp;D 5E has an "advantage" concept where instead of rolling 1d20, you roll 2d20 and take the higher. Likewise, disadvantage means rolling 2d20 and taking the lower.  How does this affect the expected average outcome of the roll? Access images inside jar Earlier today my 2009 iMac emitted I/O errors trying to copy files. So I ran disk utility, verify disk to see if anything was amiss. It was. But as it's my startup disk I couldn't repair it, so I tried safe mode. Safe mode worked the very first time, but when I rebooted it shows the progress bar filling up, before halting. Every time I turn it on now, the same progress bar then crash happens. Booting in verbose mode reveals fsck is failing with signal 8.  Using single-user mode, as that's as far as I'm aware the only way I can get any access to the system, I've been running fsck_hfs. However, it always fails. Below is the output from fsck_hfs -d /dev/disk0s2.  ** /dev/rdisk0s2         Using cacheBlockSize=32K cacheTotalBlock=65536 cacheSize=2097152K. ** Root file system    Executing fsck_hfs (version diskdev_cmds-491.6~3). ** Verifying volume when it is mounted with write access. ** Checking Journaled HFT Plus volume. ** Checking extents overflow file. ** Checking catalog file.    Missing thread record (id = 9931104)    Missing thread record (id = 16434146)    Missing thread record (id = 19370458) disk0s2: I/O error hfs_swap_BTNode: offsets 10 and 11 out of order (0x0000, 0x0000)    Invalid node structure (4, 115897) ** The volume Macintosh HD could not be verified completely.         volume check failed with error 7         volume type is pure HFS+         primary MDB is at block 0 0x00         alternate MDB is at block 0 0x00         primary VHB is at block 2 0x02         alternate VHB is at block 1952491198 0x74622d5e         sector size = 512 0x200         VolumeObject flags = 0x07         total sectors for volume = 1952591200 0x74622d60         total sectors for embedded volume = 0 0x00   I absolutely need to be able to boot to use it as an external monitor. Individual Phase shift provided by Op-Amp in Closed loop configuration I noticed that Synonymizer is only a bronze badge. Yet in order to obtain this badge you need to have 2500 reputation or more to even create tag synonyms. Then, on top of that you also need to be able to find a tag synonym.  Only 514 of these have been awarded... This makes the BRONZE badge Synonymizer rarer to have than most the gold medal badges. So my question is, why is this a bronze badge? IBus methods do not show up in text entry settings I installed both Korean and Japanese using the Language Support window, and expected Korean (Hangul) and Japanese (Anthy) to show up in the input sources for Text Entry Settings (having both packages installed). However, neither shows up. Why and how does C# allow accessing private variables outside the class itself when it's within the same containing class? Saying that refers to not going overboard in solving a problem when a simple solution exists So I know I've heard this saying in American English before but I just can't quite find the original.  I have come up with several made up variations like:   I don't send the Navy (or whole army, or a battalion) when all you need is a diplomat. Don't buy the whole cow when all you need is milk.   What's the more commonly heard saying/phrase for this of expression? Understanding the differential $dx$ when doing $u$-substitution I just finished backing up my system and when I try to upgrade to Utopic Unicorn, I get the error "Cannot Calculate the upgrades." I ran the upgrade by sudo apt-get dist-upgrade, sudo do-release-upgrade after the GUI method failed, they all gave the same error.  The feedback gives some recommendations:  This can be caused by:  * Upgrading to a pre-release version of Ubuntu  * Running the current pre-release version of Ubuntu  * Unofficial software packages not provided by Ubuntu    I am not upgrading to a pre-release version nor coming from one, I'm going from Ubuntu 14.04 LTS to 14.10. I have no broken packages and I have unchecked all my non-official software sources in the 'Software &amp; Updates' manager.  My guess left is the Unofficial software packages not provided by Ubuntu. If anyone could give any help as to how to check for unofficial packages using Synaptic or another, my appreciation.  Are there any other factors that may be causing this error and how would I go about checking/fixing those?  Thanks.  Edit: I have no broken or held packages. Everything is up-to-date, and restarting everything or anything has no effect. Get top results for each group (in Oracle) What is the Euler Totient of Zero? Wolfram MathWorld defines the Euler Totient function as follows:  The totient function phi(n), also called Euler's totient function, is defined     as the number of positive integers &lt;=n that are relatively prime to (i.e., do  not contain any factor in common with) n, where 1 is counted as being  relatively prime to all numbers   By this definition would $\phi(0)=0$? How to get attention to a post on a child meta site If I want to draw people's attention to a post on a child meta site, how can I do that? I want to get people  over at Area 51 to see what they think of the idea, because it requires opinions from the community. However, posts on the discussion zone of Area 51 rarely get activity, so it seems like I'm out of luck, unless something is changed. And from the sounds of , it seems like this is a problem on all child metas.  That post is similar, but while it talks about increasing activity in general, I am talking about how to raise participation to an individual post; the equivalent of a bounty  I can't use bounties because reputation is the same.   Could there be another way of drawing attention to individual posts? Overlapping numbers and titles in toc I'm doing some exercises on Apostol's calculus, on the floor function. Now, he doesn't give an explicit definition of $[x]$, so I'm going with this one:     DEFINITION Given  $x\in \Bbb R$, the integer part of $x$ is the unique $z\in \Bbb Z$ such that $$z\leq x &lt; z+1$$ and we denote it by $[x]$.   Now he asks to prove some basic things about it, such as: if $n\in \Bbb Z$, then $[x+n]=[x]+n$  So I proved it like this: Let $z=[x+n]$ and $z'=[x]$. Then we have that  $$z\leq x+n&lt;z+1$$  $$z'\leq x&lt;z'+1$$  Then $$z'+n\leq x+n&lt;z'+n+1$$  But since $z'$ is an integer, so is $z'+n$. Since $z$ is unique, it must be that $z'+n=z$.  However, this doesn't seem to get me anywhere to prove that  $$\left[ {2x} \right] = \left[ x \right] + \left[ {x + \frac{1}{2}} \right]$$  in and in general that   $$\left[ {nx} \right] = \sum\limits_{k = 0}^{n - 1} {\left[ {x + \frac{k}{n}} \right]} $$  Obviously one could do an informal proof thinking about "the carries", but that's not the idea, let alone how tedious it would be. Maybe there is some easier or clearer characterization of $[x]$ in terms of $x$ to work this out.  Another property is $$[-x]=\begin{cases}-[x]\text{ ; if }x\in \Bbb Z \cr-[x]-1 \text{ ; otherwise}\end{cases}$$  I argue: if $x\in\Bbb Z$, it is clear $[x]=x$. Then $-[x]=-x$, and $-[x]\in \Bbb Z$ so $[-[x]]=-[x]=[-x]$. For the other, I guess one could say:  $$n \leqslant x &lt; n + 1 \Rightarrow  - n - 1 &lt; x \leqslant -n$$  and since $x$ is not an integer, this should be the same as $$ - n - 1 \leqslant -x &lt; -n$$  $$ - n - 1 \leqslant -x &lt; (-n-1)+1$$  So $[-x]=-[x]-1$