`*` in the `glob.glob(pathname, *, recursive=False)`
What does ** (double star/asterisk) and * (star/asterisk) do for parameters?
Plotting bell shaped curve in TikZ-PGF I want to create some bell shaped curves for demonstrating hypothesis testing in statistics. Can anybody help me drawing curves like shown in the following picture? Suppose we define the following relationship of ordering between propositions in PROP: $$ \phi &lt; \psi := (\models \phi \rightarrow \psi \land \lnot(\models \psi \rightarrow \phi) ) $$ Show that if exists $\phi$ and $\psi$ such that: $$ \phi &lt; \psi $$ Then there is a $\sigma$ such that: $$ \phi &lt; \sigma &lt; \psi $$ I have tried to use valuation to find what $\sigma$ could possibly be, so for all valuations v:  If $v(\phi)=0$ and $v(\psi)=0$ then, since $\models \sigma \rightarrow \psi$, $v(\sigma)=0$  If $v(\phi)=1$ and $v(\psi)=1$ then, since $\models \phi \rightarrow \sigma$, $v(\sigma)=1$  It is impossible that $v(\phi)=1$ and $v(\psi)=0$ since $\models \phi \rightarrow \psi$  If $v(\phi)=1$ and $v(\psi)=0$ then $v(\sigma)$ could be either 0 or 1, and it would satisfy the tautologies, but if:  $v(\sigma)=0$, then the valuation of $\sigma$ would be equal to valuation of $\psi$ for all valuations and thus $\models \psi \rightarrow \sigma$, which is a contraditcion; $v(\sigma)=1$, then the valuation of $\sigma$ would be equal to valuation of $\phi$ for all valuations and thus $\models \sigma \rightarrow \phi$, which is a contraditcion. We should make books of our best content! And that's a good idea!  We have a lot of high quality content here, certainly enough for a small book.   I'm not saying that it necessarily has to be integrated into the main site, but this is just a suggestion if anyone wants to implement it.   Stack Exchange probably could make money selling the physical books though. CC-BY-SA allows selling, as long as you allow others to make copies of your book, and credit the author.  What Wikipedia does is you can custom order any set of articles as a book (it even has a nice set of authors at the end, to satisfy the BY part of CC-BY-SA).  This could even tie into the docs feature. How much meat should I serve per person? Catering a small event tomorrow for twenty people. Serving beef brisket, pulled pork, and veggie lasagna. Question is how much brisket &amp; pork should  allow for each person? also serving  three sides, rolls, etc. How can I delete Facebook messages I've sent to other Facebook users from their inbox?  I have had a conversation with my friend but now I want to delete my messages from that conversation. Can I have them deleted from my friend's inbox? Let $G$ pe a $p$ group. I have to show that         the number of nonnormal subgroups is divisible by $p$       the number of subgroups differs from the number of normal subgroups by a power of $p$.   Are there any theorem that can help me to prove this ? We have discussed the Sylow theorems but I don't know how to apply them - if those are the theorems I need. (Does this theorem also hold for infinite groups $G$ ?) How do I uninstall Pandoc in Ubuntu 19.10 (and install most recent version) I have an old version of Pandoc installed, but I'd like to install the latest version of Pandoc.   To begin I've run the following to get rid of the old version:  sudo apt-get autoremove --purge pandoc  But when I check that everything is uninstalled by running: pandoc --version Then pandoc 2.2.3.2 pops up.  I can't seem to get rid of this old version of pandoc so that I can install a new one.  Could you advise me on how I can get rid of the old version and install the new one please. Can I get SSD rw performance while keeing data security if I combine SSD & HDD in btrfs RAID1 I have 2 storage devices; classical slow HDD (750GB, /dev/sda) and faster SSD (128GB, /dev/sdb). Currently I have installed Ubuntu &amp; Mint on same btrfs partition on SSD (/dev/sdb5). My btrfs pool consists of /dev/sdb5.  What I want to achieve is data replication on HDD while keeping SSD performance: Something like this:  For read case it would be ideal for procedure to go like this:   read from SSD check checksum if it verifies.. awesome, give me the data if not, fetch data from HDD and perform error correction through duplicate data   I'd manually run (some tool I'm not sure which one... btrfs check --repair perhaps?) every month or so to check HDD checksums and correct them via SSD data against bitrot.  For write case:   write to SSD sync to HDD when write requirements are low, thus not slowing down the system.   Is this possible and how would I do it?  Bottom line is, I like btrfs and would like it to duplicate data across HDD &amp; SSD drive automatically while keeping SSD excellent performance.   Using SSD as write cache is not an option since it's missing data duplication and security. When casting a spell as a bonus action, you can't cast another spell on the same turn except a 1-action cantrip - can the order be "reversed"? Can you cast a cantrip first as a bonus action, then any other spell? If not, would it be broken to allow it?  I'm thinking a Sorcerer casting a Quickened true strike, then casting a leveled spell requiring a touch attack. Seems like a great use of the cantrip + Metamagic feature, but it seems like it is not allowed. What is the maximum length of a URL in different browsers? What is the maximum length of a URL in different browsers? Does it differ among browsers? Is a maximum URL length part of the HTTP specification? Importing google-play-services lib into Intellij IDEA 12 (and 13) Remove suggested apps option in iOS 10 As far as I can tell, suggested apps show themselves based on location.  There are two places where these suggested apps show themselves to me:   At the bottom left of the multitask screen when I double press the home button At the bottom left of the lock screen    article describes how to get rid of the small app icon appearing in the bottom left. However, this method is for iOS 8, and I am now on iOS 10, where I am unable to find iTunes and App Store > Suggested Apps.   How can I get rid of these (in my opinion) annoying little things? How to open a PDF file from terminal? I used to work on the Mac terminal before and I used:   open file2open.pdf   and the PDF file would be opened on preview or whatever my default viewer was. When I use it in the terminal in Ubuntu I get this error message:   Couldn't get a file descriptor referring to the console Now that I have Google Chrome all set up, I got myself a new laptop. Does anyone have any idea how to transfer my settings, cookies, favorites, etc?   I checked documents and settings\me\application data, and found nothing. What are some examples of induction where the base case is difficult but the inductive step is trivial? According to :     ...proofs by mathematical induction   have two parts: the "base case" that   shows that the theorem is true for a   particular initial value such as n = 0   or n = 1 and then an inductive step   that shows that if the theorem is true   for a certain value of n, it is also   true for the value n + 1. The base   case is often trivial and is   identified as such, although there are   cases where the base case is difficult   but the inductive step is trivial.   What are some examples of proofs by induction where the base case is difficult but the inductive step is trivial? I have a PHP script that can encode a PNG image to a Base64 string.  I'd like to do the same thing using JavaScript. I know how to open files, but I'm not sure how to do the encoding. I'm not used to working with binary data. This is not a duplicate question because I am looking for an explanation directed to a general audience as to the mistakes (if any) in  (reproduced below). (Numberphile is a YouTube channel devoted to pop-math and this particular video has garnered over 3m views.)   By general audience, I mean the same sort of audience as the millions who watch Numberphile. (Which would mean, ideally, making little or no mention of things that a general audience will never have heard of - e.g. Riemann zeta functions, analytic continuations, Casimir forces; and avoiding tactics like appealing to the fact that physicists and other clever people use it in string theory, so therefore it must be correct.)  Numberphile's Proof.  The proof proceeds by evaluating each of the following:  $S_1 = 1 - 1 + 1 - 1 + 1 - 1 + \ldots$   $S_2 = 1 - 2 + 3 - 4 + \ldots $   $S = 1 + 2 + 3 + 4 + \ldots $   "Now the first one is really easy to evaluate ... You stop this at any point. If you stop it at an odd point, you're going to get the answer $1$. If you stop it at an even point, you get the answer $0$. Clearly, that's obvious, right? ... So what number are we going to attach to this infinite sum? Do we stop at an odd or an even point? We don't know, so we take the average of the two. So the answer's a half."   Next:  $S_2 \ \ = 1 - 2 + 3 - 4 + \cdots$  $S_2 \ \ = \ \ \ \ \ \ \ 1 - 2 + 3 - 4 + \cdots$  Adding the above two lines, we get:  $2S_2 = 1 - 1 + 1 - 1 + \cdots$  Therefore, $2S_2=S_1=\frac{1}{2}$ and so $S_2=\frac{1}{4}$.  Finally, take  \begin{align} S - S_2 &amp; = 1 + 2 + 3 + 4 + \cdots           \\ &amp; - (1 - 2 + 3 - 4 + \cdots)          \\ &amp; =   0 + 4 + 0 + 8 + \cdots           \\ &amp; = 4 + 8 + 12 + \cdots           \\ &amp; = 4S \end{align}  Hence $-S_2=3S$ or $-\frac{1}{4}=3S$.  And so $S=-\frac{1}{12}$. $\blacksquare$ I think that the question is contained in the title. Suppose we begin from something that is false for example $1=0$. Is it possible using only $\Rightarrow$ (and of course $\lnot ,\wedge,\lor$)  to prove any possible statement? It has been ages since i studied logic at the university so i would prefer a simple explanation (if possible) Deriving ordered statistics minimum cdf Assume ${{X}_{1}}$, ${{X}_{2}}$, ${{X}_{3}}$,...,${{X}_{n}}$  are i.i.d. samples from distribution with density f, and cdf F.  Let V=min( ${{X}_{1}}$, ${{X}_{2}}$, ${{X}_{3}}$,...,${{X}_{n}}$)  To find the minimum $${B}_{v}={\{V\ge{v}\}}=\{{X}_{1}\ge{v}\}\cap\{{X}_{2}\ge{v}\}\cap...\cap\{{X}_{n}\ge{v}\}$$  So, $$P(V\ge{v})=[1-F(v)]^{n}$$  The cdf is  $$F_{v}(V)=1-[1-F(v)]^{n}$$   The density is $${f}_{v}(V)=\frac{d}{dv}[1-F(v)]^{n}=nf(v)[1-F(v)]^{n-1}$$   To find the density, why did we use $[1-F(v)]^{n}$ instead of $1-[1-F(v)]^{n}$, shouldn't we used the cdf to derive the pdf? How bad for TeX is omitting braces {}, even if the result is the same? Sometimes writing braces and omitting them produces the same result:  \tilde{\psi}  \mathrm{e}^{\mathrm{i} \pi}   vs  \tilde \psi   \mathrm e^{\mathrm i \pi}   Or (taken from Werner's comment below)   \frac{1}{2} vs \frac12   If that's the case, how bad for the quality of my code is omitting them? Of course, if one compiles a pair of formulas, there is no difference. But, since I ignore how TeX works, my point is: if one writes long codes with these habits,   doesn't TeX go somehow crazy because I'm not writing as it expects?   For instance, does it have any effect on how fast are long documents compiled? Any reason to keep them?