Firefox 66.0.3 (64-bit) addons broken
FireFox 66 Quantum disabled all my extensions at midnight!
What happened to Yachiru? According to the , Yachiru disappeared leaving her belongings after the fight with Gremmy. She is said to be "gone" by Kenpachi in the penultimate chapter of the original series.  I use "original" because there might be extra chapters announced as the other big announcement.  So, what happened to her? Was she part of his Zanpakutou or something? Run python script when a file has been added to a folder? Is it possible to run a Python script when a file has been added to a folder?  In my scenario I have a folder that contains movies and the Python script gets the details (name, year, plot, rating, etc) from OMDb and puts them into a file, which MySQL uses.   Every time I add a movie I have to run the Python script.  I want to know if it is possible to automatically run the Python script when a file has been added to the folder?  Thanks in advance. Appropriate data transformation How to read numbers separated by space using scanf I believe in Windows Vista, we could use linkd command. However, I cannot find this command in Windows 7. I know I can use Windows Explorer and delete the junction, but I wonder if this can be done in Command Prompt.  I can use mklink command to create a junction from a Command Prompt, so, what is the opposite of it (something like linkd)? How can I make the Logitech Wingman Formula Force steering wheel work in Vista and 64 bit Windows 7? Why Windows sets new created file's "created time" property to old time? Are other players able to see you on their map in Pokemon Go? I am concerned that if I use the game, stalkers and other such people would be able to find me. I have searched for an answer for this question on other forums, but have yet to find the answer. I want to prove with mathematical induction that:  $$\sum_{i=1}^n i \cdot i! = (n+1)! - 1$$  So in the first step we define $n = 1$:  $$\sum_{i=1}^1 i \cdot i! = 1 \cdot 1! = 1 = 2! - 1$$  In the second step we define $n = n + 1$:  $$\sum_{i=1}^{n+1} i \cdot i! = \sum_{i=1}^n i \cdot i! + (n+1)(n+1)!$$ $$\implies (n+1)! - 1 + (n+1)(n+1)!$$  This can now be simplified to $(n+2)(n+1)! - 1$ but I do not see how...  We could do $(n+1)!(-1 + (n+1)) = (n+1)! \cdot n$ but still this will not be the same as above.  What did I miss?  Bodo Is it a scam if the person only wants to deposit into my account, not make a withdrawal? A man in  west  coast  Austria wants to deposit money  into  my account.  I'm in Alabama.  I had to get an online  account.  I did that, but he says his bank manager  needs all this information:   DOB SSN    online access username  online access  password   security  question and answer   bank name   bank address   bank number  person who is on the account     their name their address    account no   routing no     OK. Is it safe  to do this or am I being scammed?  I don't want him  to be able to end up withdrawing all my money instead of depositing money. Proving 'Law of Excluded Middle' in Fitch system I launch a batch which call a lot of scheduled job. But I reach the governor limit :     Maximum number of Apex classes scheduled concurrently : 100   I'm wondering what happens when this limit is reached. The next scheduled jobs are waiting the number of scheduled jobs is lower than 100 for being executed or are they all cancelled ?  And is there to way to manage the number of scheduled jobs to avoir reaching this limit ? For example wait before schedule a new job if we are near the limit. Class of sets of a given infinite cardinality This question was inspired by the question on .  From the discussion in the comments there, it seems there does not exist a set of all sets of a given cardinality.  To me, it seems easy to see that this is true for any nonzero finite cardinality $n$. Given any set $x$, you can always make a set of size $n$ by adding $n-1$ other sets to $x$ to make a set of size $n$, which exists by repeated use of the pairing axiom.   But how would you do this for infinite cardinalities? For suppose $\kappa$ is some given infinite cardinality. To show that the set of all sets of cardinality $\kappa$ does not exist, it seems you would have to show that for any set $x$, there exists a set of that size with $x$ as an element, and then you could take the union of that set to find the set of all sets, and thus a contradiction. But it doesn't seem reasonable to simply say, for a given set of size $\kappa$ if $x$ is in the set, we have no problem. If not, just take an element out of the set and put $x$ in. Something about that seems like it would not be allowed.  So how would you do this for infinite cardinalities? Infinite Cartesian product of countable sets is uncountable Let $\{E_n\}_{n\in\mathbb{N}}$ be a sequence of countable sets and let $S=E_1\times\cdots\times E_n\times\cdots $. Show $S$ is uncountable. Prove that the same statement holds if each $E_n=\{0,1\}$.  By the definition of Cartesian product of sets,   $$\displaystyle S=\Pi_{n\in\mathbb{N}} \{f\colon\mathbb{N}\rightarrow\cup_{n\in\mathbb{N}}E_n\mid\forall n, f(n)\in E_n\}$$  If $E_n=\{ 0,1\}$, then  $$\displaystyle S_{01}=\Pi_{n\in\mathbb{N}}\{0,1\}=E^{\mathbb{N}}$$, where $E=\{0,1\}$.  By a theorem, $\cup_{n\in\mathbb{N}} E_n$ is countable since the sequence is countable.  I'm not sure how to go on from here to show $S$ is uncountable. Can we say anything about the function $f$ that maps a countable $\mathbb{N}$ to another countable union of sequence of countable sets? When the trace of the Frobenius homomorphism is zero? Let's consider an elliptic curve over a finite field $\mathbb F_p$.  The trace of the Frobenius homomorphism is defined as:  $$a_p=p+1-\#E(\mathbb F_p)$$  See for example .  I read that this value is zero if and only if the elliptic curve is supersingular. Unfortunately there is no proof give. So I am looking for a proof of this. (For example a good reference). Wanted: question mark instead of bibtex key for missing citations (biblatex) Instead of having the citation key showing up in the document for missing references, I want to only have [?], as it is the case when using the default bibtex without biblatex. This behavior is driving me crazy, as it messes up all the formatting (especially in tables). I want to focus on writing and only later on deal with the erroneous citations.  This question is related to    and its MWE can be used. However, as pointed out beforehand, I want the question mark in the text instead of the citation key to not mess up the formatting (for missing citations). The boundary of union is the union of boundaries when the sets have disjoint closures Assume $\bar A\cap\bar B=\emptyset$. Is $\partial (A \cup B)=\partial A\cup\partial B$, where $\partial A$ and $\bar A$ mean the boundary set and closure of set $A$?   I can prove that $\partial (A \cup B)\subset \partial A\cup\partial B$ but for proving $\partial A\cup\partial B\subset \partial (A \cup B)$ it seems not trivial. I tried to show that for $x\in \partial A\cup\partial B$ WLOG, $x\in \partial A$ so $B(x)\cap A$ and $B(x)\cap A^c$ not equal to $\emptyset$ but it seems not enough to show the result. How to fix infinite bash loop (bashrc + bash_profile) when ssh-ing into an ec2 server? I mistakenly have source .bash_profile in the bashrc file and vice versa. Now when I tried to ssh into the machine (ec2), it will stuck at loading bash and get connection closed in a second. Is there a way I could fix it? Could I mount the disk to another ec2 instance to fix the bash files?  Update 1: I tried the following: %  ssh -i &quot;my-pem.pem&quot; -t ubuntu@&lt;server_address&gt;.amazonaws.com &quot;/bin/bash --noprofile --norc&quot; Connection to &lt;server_address&gt;.amazonaws.com closed.  Nothing else showed up. Do you have any idea on what was going wrong? For sanity check, if I do ssh -i &quot;my-pem.pem&quot;ubuntu@&lt;server_address&gt;.amazonaws.com, the message will be ...  28 packages can be updated. 0 of these updates are security updates. To see these additional updates run: apt list --upgradable  New release '20.04.2 LTS' available. Run 'do-release-upgrade' to upgrade to it.   Last login: Mon Feb 22 23:17:41 2021 from ip Connection to &lt;server_address&gt;.amazonaws.com closed.  Solution Just ssh onto the machine and immediately do Ctrlc and fix the bash files. Can I test if a regex is valid in C# without throwing exception When are attributive nouns plural?