Why/how does Luke happen to land on Dagobah so close to Yoda's home?
How did Luke know where to land on Dagobah?
When I installed my SSD I just mounted with discard and didn't sweat it. However today I was reading about the pros and cons of using fstrim instead and decided to run the program to get an idea of how long it would actually take (still with my partitions mounted with discard). The command took several minutes on both my root and home partitions. For my home partition I used -v and got this:  $ sudo fstrim -v /home /home: 137494052864 bytes were trimmed   This is more than the amount of free space on the partition!  $ df -h /home Filesystem      Size  Used Avail Use% Mounted on /dev/sda2       206G   78G  118G  40% /home   Subsequent runs finish in less than a second, eg:  $ sudo fstrim -v /home /home: 0 bytes were trimmed   Surely if I have always had the partition mounted with discard, fstrim should not trim a large amount of data like that? The discard option is definitely enabled, here are the relevant fstab lines:  UUID=xxxxxxxx...    /          ext4   noatime,discard,errors=remount-ro  0      1 UUID=xxxxxxxx...    /home      ext4   noatime,discard,errors=remount-ro  0      2   And mount output lines:  /dev/disk/by-uuid/xxxxxxxx... on / type ext4 (rw,noatime,discard,errors=remount-ro,stripe=128,data=ordered) /dev/sda2 on /home type ext4 (rw,noatime,discard,errors=remount-ro,stripe=128,data=ordered)   The SSD is a TOSHIBA THNSNS256GMCP. Why does this happen? What does "Could not find or load main class" mean? I overseasoned my food, what can I do to remove the strong smell? Uninstall, Activate, Deactivate a plugin: typical features & how-to I'm making a WordPress plugin. What are typical things I should include in the uninstall feature?  For example, should I delete any tables I created in the install function?  Do I clean up my option entries?  Anything else? Voltage Controlled Current Source integrated circuit? Exists? Does anyone know of a Voltage Controlled Current Source IC? Or do you know how I can build one with as few other components as possible taking up a minimal amount of space?  current range needed is from 0mA to 350mA Can I travel to Australia in less than 2 weeks if I transfer my visa to my new passport? I transferred my visa to my new passport and it’s saying it takes 2 weeks to come, my flight is Sunday I arrive in Sydney Monday at night, I still have my old passport! If I bring that will they let me go into the country because my new one literally arrived two days ago! And the visa will be transferred in 2 weeks! Will I have to push my flight or will I be left? Is voting to balance in the spirit of the site? The other day I saw an answer which was ok. Not great but not bad. So no reason to upvote or downvote. However the answer already had a single downvote. I felt this was unfair so upvoted the answer to keep it at what I felt was a fair score. It wasn't until afterward that it occurred to me that I should have perhaps solely voted on the content of the answer.  Is this a reasonable reason for an upvote or should I have left the answer alone? How can I randomise the output of a redstone circuit? How to get the list of properties of a class? HTML from advertisement not rendered correctly I have many times found CSS written on my screen besides images from Stack OverFlow.   It is associated with the advert from Rackspace  Here is a screenshot: Using processing.runandload in QGIS 3 Is there any way to solve this problem using the diagonalization method? I know there's the proof that uses $\mathcal{P}(\mathbb{N})$ = set of all finite subsets $\cup$ set of all infinite subsets, but I'm trying to solve it using the diagonalization method specifically. I was thinking that we can assume the two have the same cardinality and arrive at a contradiction, but I don't know how to get there. How can we show there has to be some infinite set in the set of all infinite subsets that cannot match 1-1 with a natural number? My question is pretty simple.  Since $n! \gt n!!$, it's clear by the comparison test that $\sum_{n=0}^\infty \frac {1}{n!!}$ converges.      But what value does the sum converge to? How does one go about determining its value (if possible)? How to solve a difference equation? So I have the difference equation $4y_{k+1} = 2y_k$.  I need to solve this equation, first with the initial condition $y_0 = 0$ and then with the initial condition $y_0 = 2$.  The professor wrote on the answer sheet that applying iteratively the recurrence relation it is easy to check that:  $y_k= (1/2)^k y_0 $.  Since I missed the lecture where he explained this, can somebody explain how to come about with this question?  I imagine that once I get the equation, then the initial condition $y_0 = 0$ gives us the particular solution $y_k = 0$. Thus the other initial condition $y_0 = 2$ is verified by the solution $y_k = 2(1/2)^k$.  Any help on how to get to the equation $y_k= (1/2)^k y_0$ will be appreciated. Intuition/Real-life Examples: Pairwise Independence vs (Mutual) Independence Would someone please advance/discuss some real-life situations falsities $1, 2$? I'd like to intuit why these are false. As a neophyte, since I still need to compute the probabilities for the examples in the two answers to apprehend them, I haven't naturalised these concepts yet. Thus, I beg leave to ask about other real-life examples which require less or no computations.  I tried and would appreciate less numerical examples than  and , and  Examples 1.22 and 1.23 on P39 of Introduction to Pr by Bertsekas.  $1.$ Pairwise Independence $\require{cancel} \cancel{\implies}$ (Mutual) Independence.      $2.$ Pairwise Independence $\require{cancel} \cancel{\Longleftarrow}$ (Mutual) Independence.         P38 defines (Mutual) Independence :    For all $S \subseteq \{1, ..., n - 1, n\} $ and events $A_i$, $Pr(\cap_{i \in S} A_i) = \Pi_{i \in S} A_i.$ Fortran IF statement with numbers/labels rather than another statement Fastest way to move Collection from Sharded MongoDB Cluster to a another Sharded MongoDB Cluster I have to move a MongoDB Collection (Size: 1TB+) from Sharded MongoDB Cluster to another[5 shards on both clusters]. During this operation, it is assumed that the accompanying program will be offline, so no need to worry about inconsistent data, but I need to minimize the downtime.  I've tried testing it with mongodump and mongorestore, but looks like that is taking ages to finish.  Please share your experiences for such kind of scenarios.  Note: Cluster has only one collection, so I am open at cluster level sync as well. How can the following inequation be proven?  $$a^2 + b^2 + c^2 \ge ab + bc + ca$$ Remove "Show Desktop" button next to the clock in Windows 7 What is DOCTYPE and why do I want to use it? What are the different DOCTYPEs I can use? What is the difference between standards and quirks mode, and what are some quirks I may run into with differently set DOCTYPEs?   Lastly, what is the proper DOCTYPE that I should be using?