What's the cheapest SIM card with Internet for smartphone in Czech Republic?
How can I find the cheapest prepaid SIM card for a given country?
How does damage dealt increase as you level up I've recently taken over as GM in my group.  We are all new to RPGs except for our original GM, so they decided to run an adventure path so it would be easier to change GMs if they had to stop playing.  Along this path, we had one CR 4 encounter that took us an hour, almost killed our bloodrager and knocked our brawler unconscious. When we leveled up, our GM told us to increase the damage we did by "one level," so my 1d6 became 2d6 and my friend's 2d6 became 4d6.  I saw no problem with this as a player, but I was looking over the adventure path and later encounters that also have a CR of 4 could be ended in one turn by our bloodrager. This would make encounters really boring, and my goal is to avoid boredom.  My question is: As you level up, how does the damage you do increase? Does it go up like my GM said so that at level 3 my rapier does 3d6 and the bloodrager's earth breaker does 6d6, or does it go up by some other method?  I have read the PHB and I don't think that what the GM was saying is correct, but being a first-time player I wasn't sure if had just missed something, so I figured I should ask elsewhere. I am wondering if there is a modifier or tool that will essentially undo a subsurf or subdivide command. Autosegmental Representation in tikz-qtree This is what I want to achieve    and this:    But all I've been able to make with tikz-qtree is the following:  \documentclass[12pt,a4]{article} \usepackage[utf8]{inputenc} \usepackage{tipa,tikz,tikz-qtree} \begin{document}  \begin{tikzpicture} [baseline] \tikzset{frontier/.style={distance from root=90pt}} \Tree [.$\sigma$ [.O [ p ] ] [.R [.$\mu$ a ] [.$\mu$ : ] ] ] \end{tikzpicture} \begin{tikzpicture} [baseline] \tikzset{frontier/.style={distance from root=90pt}} \Tree [.$\sigma$ [.O [ p ] ] [.R [.$\mu$ a ]  ] ] \end{tikzpicture}   And this:  \begin{tikzpicture}[baseline] \tikzset{frontier/.style={distance from root=90pt}} \Tree [.$\sigma$ [.O [ l ] ] [.R [.$\mu$ a ] [.$\mu$ l ] ] ] \end{tikzpicture} \begin{tikzpicture} [baseline] \tikzset{frontier/.style={distance from root=90pt}} \Tree [.$\sigma$ [.O [ : ] ] [.R [.$\mu$ a ] [ l ] ] ] \end{tikzpicture} \end{document}   Which renders:    and    The important part here is the linking from the leaves to more than one parent (it would be nice if I had the option of making the line dashed too). Now, pst-asr doesn't quite achieve what I want it to. It's important that I have the moras ('mu's). (Also it's a pstricks package, which means I must typeset it in DVIPSPDF.) I have tried a bit of the forest-package (especially forest-GP1), but I can't make that work as I want either. Lastly, some have recommended xyling, but I find that package very difficult to use.  Any recommendations?  Thanks. $ d_1,d_2\mid n\iff {\rm lcm}(d_1,d_2)\mid n\ $ [LCM Universal Property] How to use inotifywait to watch a directory for creation of files of a specific extension I have seen .      You should consider using inotifywait, as an example:  inotifywait -m /path -e create -e moved_to |     while read path action file; do         echo "The file '$file' appeared in directory '$path' via '$action'"         # do something with the file     done    My question is that, the above script watches a directory for creation of files of any type, but how do I modify the inotifywait command to report only when a file of certain type/extension is created (or moved into the directory) - e.g. it should report when any .xml file is created.  WHAT I TRIED:  I have run the inotifywait --help command, and have read the command line options. It has --exclude &lt;pattern&gt; and --excludei &lt;pattern&gt; commands to EXCLUDE files of certain types (by using regEx), but I need a way to INCLUDE just the files of a certain type/extension. If I have $10$ apples, but you have $5$ apples, then I have $2$ times more apples than you. But what if I have $10$ apples, but you don't have any apples?   If you look at the graph $f(x)=\frac{10}{x}$, it shows that when $x$ approaches $0$, $f(x)$ approaches infinity. So it means I have infinity times more apples than you? Noncoalescing and bouncing droplets if you set a dish filled with water onto a loudspeaker or other vibrator and make vibration, When it oscillates, it is possible to hold small droplets on its surface for a long time. I mean, when you put a droplet of water on vibrating water surface, it doesn't coalesce with the water and bounce on the surface of water.( see this video  )  As we know, drop reaches its minimal potential when coalescing with water ( that's why drops coalesce)  what exactly cause this? why doesn't the drop coalesce with the water? What is the limit of series $\frac{1}{2 \cdot 3 \cdot 4} + \frac{1}{4 \cdot 5 \cdot 6} + \frac{1}{6 \cdot 7 \cdot 8} + \cdots $?  The $n$th summand is $\frac{1}{(2n)(2n + 1)(2n+2)} = \frac{1}{4} \frac{1}{n(2n+1)(n+1)}$.  I have tried expressing this as a telescoping sum, or as the limit of Riemann sums of a partition (the usual methods I normally try when doing this type of question- what are some other strategies?) I can't think of a decent reason to allow editing audit messages (like  or ). I have abused it for fun before but it really has no purpose other than joking or obfuscating your actions. For that I think that such messages should be untouchable. Please make them so. How to run Visual Studio post-build events for debug build only How can I limit my post-build events to running only for one type of build?  I'm using the events to copy DLL files to a local IIS virtual directory, but I don't want this happening on the build server in release mode. Difference between Hashing a Password and Encrypting it Check whether an array is a subset of another Any idea on how to check whether that list is a subset of another?  Specifically, I have  List&lt;double&gt; t1 = new List&lt;double&gt; { 1, 3, 5 }; List&lt;double&gt; t2 = new List&lt;double&gt; { 1, 5 };   How to check that t2 is a subset of t1, using LINQ? What should one look for when buying a used film camera? I'm planning to buy a used Nikon F5.   I have no experience with a film camera and I want to know what all should one be careful of before buying a used film camera and more specifically a Nikon F5. Subsetting a 2D numpy array `apt update` failed on Debian Linux Attempting to upgrade testing/stretch Debian Linux:  $ sudo apt update  Ign:1 http://dl.google.com/linux/talkplugin/deb stable InRelease Hit:2 http://dl.google.com/linux/talkplugin/deb stable Release                                                                    ... Get:25 http://mirror.vorboss.net/debian unstable/main i386 Packages 2016-03-25-1456.28.pdiff [15.0 kB]              Fetched 686 kB in 7s (89.5 kB/s)                                                                                                                                                         Reading package lists... Done W: gpgv:/var/lib/apt/lists/dl.google.com_linux_talkplugin_deb_dists_stable_Release.gpg: The repository is insufficiently signed by key 4CCA1EAF950CEE4AB83976DCA040830F7FAC5991 (weak digest) W: gpgv:/var/lib/apt/lists/deb.opera.com_opera_dists_stable_InRelease: The repository is insufficiently signed by key 419D0ACF314E8E993F7F92E563F7D4AFF6D61D45 (weak digest) W: Failed to fetch http://dl.google.com/linux/talkplugin/deb/dists/stable/Release  No Hash entry in Release file /var/lib/apt/lists/dl.google.com_linux_talkplugin_deb_dists_stable_Release, which is considered strong enough for security purposes E: Some index files failed to download. They have been ignored, or old ones used instead.  What's wrong? How to fix it? Why is "union" an exception to the "a/an" rule? How can I attach a file to a question? I want to attach a code file to my question, but I am not able to find a link to do it. Is attaching files possible at all? If $f \in \mathcal{L}^1(\mathbb{R})$ then $\lim_{h\rightarrow 0}\int_{-\infty}^\infty |f(x+h)-f(x)|dx\rightarrow 0$ I am working on some past prelim problems and one of them is the following: If $f \in \mathcal{L}^1(\mathbb{R})$ then $\lim_{h\rightarrow 0}\int_{-\infty}^\infty |f(x+h)-f(x)|dx\rightarrow 0$   Update: Following Jackie Chong's advice, I am attempting this problem with the dominated convergence theorem. Since $f\in L^1(\mathbb{R})$, $f$ can be approximated from below by a sequence of continuous functions $f_n$. Then, I believe I can say that, for all $n$ sufficiently large, $|f_n(x+\frac{1}{n})-f_n(x)|\le 2|f(x)|$. (I'm not sure of this part thought). Then $2|f(x)|$ is integrable and hence a dominating function for $|f_n(x+\frac{1}{n})-f_n(x)|$. So by the dominated convergence theorem we can take the limit inside $\lim_{n\rightarrow \infty}\int|f_n(x+\frac{1}{n})-f(x)|dx=\int \lim_{n\rightarrow \infty}|f_n(x+\frac{1}{n})-f(x)|dx=0$ Is this on the right track?  Another approach that I thought may work, but which I'm less certain of is the following: If $f$ can be approximated by $C^1$ functions (I have no real justification for this, so please correct me if its wrong), then for each $n$ and each $x$ there is some $y(x,n)\in B_{1/n}(x)$ such that $|f(x+\frac{1}{n}-f(x)|=\frac{1}{n}|f'(y(x,n)|$ but from here I don't see how to proceed, because just because $|f|$ is integrable, I can't justify $|f'|$ being integrable, but if there is some way to fix this approach, hints would be appreciated.   Another thing I was thinking was to first approximate $f$ from below by continuous functions $f_n$ then to define $g_{m,n}=|f_n(x+\frac{1}{m})-f_n(x)| \chi_{[-m,m]}$. Then, for each $n$, the function $g_{m,n}$ is continuous on its support, and since it support is compact, it is uniformly continuous there. Can this be used to justify bringing the limit $\lim_{n\rightarrow \infty}$ inside the integral? Then apply the monotone convergence theorem? I know this idea is probably even more sketchy than my previous one, but if it can be fixed please let me know :)  Thanks! Are there any tools for merging CSS? I have a couple CSS files with overlapping CSS selectors that I'd like to programmatically merge (as in not just appending one file to the end of the other). Is there any tool to do this online? or a Firefox extension perhaps? Necessary and Sufficient conditions for $(i \, j)$ and $(1 \, 2 \, \dotsc \, n)$ generate $S_n$. I have a homework question that asks     Find necessary and sufficient conditions on $1 \leq i &lt; j \leq n$ so that $(i \, j)$ and $(1 \, 2 \, \dotsc \, n)$ generate $S_n$.   Here is what I have done so far.  Call $c = (1 \, 2 \, \dotsc \, n)$.  I made the observation that $$ \overbrace{c c \dotsb c}^{n - j + 1} (i \, j) \overbrace{c^{-1} c^{-1} \dotsb c^{-1}}^{n - j + 1} = (1 + i - j + n \, 1). $$ Thus, $\langle (i \, j), c \rangle = \langle (1 \, i - j + n + 1), c \rangle$, so it suffices to look at $\langle (1 \, k), c \rangle$ for positive integers $2 \leq k \leq n$.  I've checked that, for the value $k=2$, $\langle (1 \, 2), c \rangle = S_n$.  This immediately implies $\langle (1 \, n), c \rangle = S_n$.  I suspect that no other values of $k$ will work, but am not sure how to prove it.