I am looking for the best questions that have both the tags  and .  I get back a  sorted by votes. Why wasn't  returned to me, this was the one I was looking for and I could not find it. Why didn't it appear? Is it because it is a Wiki? If so, how am I supposed to find it?   EDIT: The reason this bothers me slightly is because this question is actually  in the IDE section. Reading it once and then looking for it on SO and not finding it is quite disconcerting! If it is considered a useless question, why is it linked?
Historical locks are sometimes applied to questions.   What is a historical lock? What is the purpose of a historical lock? How are questions affected by historical locking? When is it appropriate to lock a question for historical reasons?  When is it not appropriate? How do I request a historical lock for a question? What should I do if I notice a serious problem with a historically-locked question or one of its answers?
Possible Duplicate:          I sometimes work outside and are using a 3G usb connection with quite a limited data allowance.  I want some fast and easy way to temporary block all incoming and outgoing traffic in windows firewall except for chrome to be sure that Dropbox or something else is not using up my data.  I've tried to set Windows Firewall Properties to "Block" which gives "Outgoing/Incoming connections that do not match a rule are blocked".  Problem: There are many allow-rules like Dropbox that would "override" the block. And I don't want to disable all rules and then enable them, since there are some that I want disabled even when I get to the office...  Any suggestions?  Thanks! I just spilt coffee on my laptop, what should I do? Iterate enum values using java generics Unable to uninstall Universal Apps through PowerShell Do two beams of light attract each other in general theory of relativity? In general relativity, light is subject to gravitational pull.  Does light generate gravitational pull, and do two beams of light attract each other? I've been reading the  and it mentions about virtual terminals which, if I understood it correctly, it is a Linux-specific feature (not in Unix) to allow multiple login consoles in a non X11 system. You create virtual terminals by pressing ALT-F2. I'm running Linux Mint and in my /dev folder though I see many tty devices and I don't know what they are for. Here is the grepped output:  crw-rw-rw-  1 root tty       5,   0 Jan  2 19:45 tty crw--w----  1 root tty       4,   0 Jan  2 19:10 tty0 crw-rw----  1 root tty       4,   1 Jan  2 19:10 tty1 crw--w----  1 root tty       4,  10 Jan  2 19:10 tty10 crw--w----  1 root tty       4,  11 Jan  2 19:10 tty11 crw--w----  1 root tty       4,  12 Jan  2 19:10 tty12 crw--w----  1 root tty       4,  13 Jan  2 19:10 tty13 crw--w----  1 root tty       4,  14 Jan  2 19:10 tty14 crw--w----  1 root tty       4,  15 Jan  2 19:10 tty15 crw--w----  1 root tty       4,  16 Jan  2 19:10 tty16 crw--w----  1 root tty       4,  17 Jan  2 19:10 tty17 crw--w----  1 root tty       4,  18 Jan  2 19:10 tty18 crw--w----  1 root tty       4,  19 Jan  2 19:10 tty19 crw-rw----  1 root tty       4,   2 Jan  2 19:10 tty2 crw--w----  1 root tty       4,  20 Jan  2 19:10 tty20 crw--w----  1 root tty       4,  21 Jan  2 19:10 tty21 crw--w----  1 root tty       4,  22 Jan  2 19:10 tty22 crw--w----  1 root tty       4,  23 Jan  2 19:10 tty23 crw--w----  1 root tty       4,  24 Jan  2 19:10 tty24 crw--w----  1 root tty       4,  25 Jan  2 19:10 tty25 crw--w----  1 root tty       4,  26 Jan  2 19:10 tty26 crw--w----  1 root tty       4,  27 Jan  2 19:10 tty27 crw--w----  1 root tty       4,  28 Jan  2 19:10 tty28 crw--w----  1 root tty       4,  29 Jan  2 19:10 tty29 crw-rw----  1 root tty       4,   3 Jan  2 19:10 tty3 crw--w----  1 root tty       4,  30 Jan  2 19:10 tty30 crw--w----  1 root tty       4,  31 Jan  2 19:10 tty31 crw--w----  1 root tty       4,  32 Jan  2 19:10 tty32 crw--w----  1 root tty       4,  33 Jan  2 19:10 tty33 crw--w----  1 root tty       4,  34 Jan  2 19:10 tty34 crw--w----  1 root tty       4,  35 Jan  2 19:10 tty35 crw--w----  1 root tty       4,  36 Jan  2 19:10 tty36 crw--w----  1 root tty       4,  37 Jan  2 19:10 tty37 crw--w----  1 root tty       4,  38 Jan  2 19:10 tty38 crw--w----  1 root tty       4,  39 Jan  2 19:10 tty39 crw-rw----  1 root tty       4,   4 Jan  2 19:10 tty4 crw--w----  1 root tty       4,  40 Jan  2 19:10 tty40 crw--w----  1 root tty       4,  41 Jan  2 19:10 tty41 crw--w----  1 root tty       4,  42 Jan  2 19:10 tty42 crw--w----  1 root tty       4,  43 Jan  2 19:10 tty43 crw--w----  1 root tty       4,  44 Jan  2 19:10 tty44 crw--w----  1 root tty       4,  45 Jan  2 19:10 tty45 crw--w----  1 root tty       4,  46 Jan  2 19:10 tty46 crw--w----  1 root tty       4,  47 Jan  2 19:10 tty47 crw--w----  1 root tty       4,  48 Jan  2 19:10 tty48 crw--w----  1 root tty       4,  49 Jan  2 19:10 tty49 crw-rw----  1 root tty       4,   5 Jan  2 19:10 tty5 crw--w----  1 root tty       4,  50 Jan  2 19:10 tty50 crw--w----  1 root tty       4,  51 Jan  2 19:10 tty51 crw--w----  1 root tty       4,  52 Jan  2 19:10 tty52 crw--w----  1 root tty       4,  53 Jan  2 19:10 tty53 crw--w----  1 root tty       4,  54 Jan  2 19:10 tty54 crw--w----  1 root tty       4,  55 Jan  2 19:10 tty55 crw--w----  1 root tty       4,  56 Jan  2 19:10 tty56 crw--w----  1 root tty       4,  57 Jan  2 19:10 tty57 crw--w----  1 root tty       4,  58 Jan  2 19:10 tty58 crw--w----  1 root tty       4,  59 Jan  2 19:10 tty59 crw-rw----  1 root tty       4,   6 Jan  2 19:10 tty6 crw--w----  1 root tty       4,  60 Jan  2 19:10 tty60 crw--w----  1 root tty       4,  61 Jan  2 19:10 tty61 crw--w----  1 root tty       4,  62 Jan  2 19:10 tty62 crw--w----  1 root tty       4,  63 Jan  2 19:10 tty63 crw--w----  1 root tty       4,   7 Jan  2 19:10 tty7 crw--w----  1 root tty       4,   8 Jan  2 19:10 tty8 crw--w----  1 root tty       4,   9 Jan  2 19:10 tty9 I am executing my ./shell.sh which contains   eval "$(pyenv init -)" pyenv shell 3.8.2   But nothing happens. If i run this code in bash manually it works fine and shell version of python switches from 2.7.10 to 3.8.2.  I am in the right directory and I gave the .sh file execution permissions. Taking a skyline photo with a person closer to the camera during night time How can I take a photo which shows the skyline and the person who is standing around six feet away from the camera with proper lighting at night?   For taking just the skyline I've used long shutter speed and it turned out great, but when including a person on it, the person becomes  blurry because it's impossible for a person to remain static for that long.   Ps.  I do have two flashes, 35mm prime lens as well as 18-300mm zoom lenses as well. The camera I use is Nikon D7200. Classical car collision I have a very confusing discussion with a friend of mine.  2 cars ($car_a$ and $car_b$) of the same mass $m$ are on a collision course. Both cars travel at $50_\frac{km}{h}$ towards each other.  They collide. Ignoring any shreds and collateral damage, what is the speed of collision that the driver of $car_a$ felt?  What I mean is, if $car_a$ were to be driven into an infinite mass wall, what would the velocity be to replicate the damage caused by the initial collision? Is there any way to fix the wavy lines that appear when photographing a striped dress?   It's not just in viewing online: when it was printed at wallet size, the wavy lines showed up. How to set system-wide environment variables on OS X Mavericks I remember that a couple of years ago a friend showed me and some other people the following expression:  $$\lim_{n\to \infty}\frac{1^n+2^n+\cdots+(n-1)^n}{n^n}.$$  As shown below, I can prove that this limit exists by the monotone convergence theorem. I also remember that my friend gave a very dubious "proof" that the value of the limit is $\frac{1}{e-1}$. I cannot remember the details of the proof, but I am fairly certain that it made the common error of treating $n$ as a variable in some places at some times and as a constant in other places at other times. Nevertheless, numerical analysis suggests that the value my friend gave was correct, even if his methods were flawed. My question is then:  What is the value of this limit and how do we prove it rigorously?  (Also, for bonus points, What might my friend's original proof have been and what exactly was his error, if any?)  I give my convergence proof below in two parts. In both parts, I define the sequence $a_n$ by $a_n=\frac{1^n+2^n+\cdots+(n-1)^n}{n^n}$ for all integers $n\ge 2$. First, I prove that $a_n$ is bounded above by $1$. Second, I prove that $a_n$ is increasing.   (1) The sequence $a_n$ satisfies $a_n&lt;1$ for all $n\ge 2$.  Note that $a_n&lt;1$ is equivalent to $1^n+2^n+\cdots+(n-1)^n&lt;n^n$. I prove this second statement by induction. Observe that $1^2=1&lt;4=2^2$. Now suppose that $1^n+2^n+\cdots+(n-1)^n&lt;n^n$ for some integer $n\ge 2$. Then  $$1^{n+1}+2^{n+1}+\cdots+(n-1)^{n+1}+n^{n+1}\le(n-1)(1^n+2^n+\cdots+(n-1)^n)+n^{n+1}&lt;(n-1)n^n+n^{n+1}&lt;(n+1)n^n+n^{n+1}\le n^{n+1}+(n+1)n^n+\binom{n+1}{2}n^{n-1}+\cdots+1=(n+1)^{n+1}.$$  (2) The sequence $a_n$ is increasing for all $n\ge 2$.  We must first prove the following preliminary proposition. (I'm not sure if "lemma" is appropriate for this.)  (2a) For all integers $n\ge 2$ and $2\le k\le n$, $\left(\frac{k-1}{k}\right)^n\le\left(\frac{k}{k+1}\right)^{n+1}$.  We observe that $k^2-1\le kn$, so upon division by $k(k^2-1)$, we get $\frac{1}{k}\le\frac{n}{k^2-1}$. By , we may find:  $$\frac{k+1}{k}\le 1+\frac{n}{k^2-1}\le\left(1+\frac{1}{k^2-1}\right)^n=\left(\frac{k^2}{k^2-1}\right)^n.$$  A little multiplication and we arrive at $\left(\frac{k-1}{k}\right)^n\le\left(\frac{k}{k+1}\right)^{n+1}$.  We may now first apply this to see that $\left(\frac{n-1}{n}\right)^n\le\left(\frac{n}{n+1}\right)^{n+1}$. Then we suppose that for some integer $2\le k\le n$, we have $\left(\frac{k}{n}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}$. Then:  $$\left(\frac{k-1}{n}\right)^n=\left(\frac{k}{n}\right)^n\left(\frac{k-1}{k}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}\left(\frac{k}{k+1}\right)^{n+1}=\left(\frac{k}{n+1}\right)^{n+1}.$$  By backwards (finite) induction from $n$, we have that $\left(\frac{k}{n}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}$ for all integers $1\le k\le n$, so:  $$a_n=\left(\frac{1}{n}\right)^n+\left(\frac{2}{n}\right)^n+\cdots+\left(\frac{n-1}{n}\right)^n\le\left(\frac{2}{n+1}\right)^{n+1}+\left(\frac{3}{n+1}\right)^{n+1}+\cdots+\left(\frac{n}{n+1}\right)^{n+1}&lt;\left(\frac{1}{n+1}\right)^{n+1}+\left(\frac{2}{n+1}\right)^{n+1}+\left(\frac{3}{n+1}\right)^{n+1}+\cdots+\left(\frac{n}{n+1}\right)^{n+1}=a_{n+1}.$$  (In fact, this proves that $a_n$ is strictly increasing.) By the monotone convergence theorem, $a_n$ converges.  I should note that I am not especially well-practiced in proving these sorts of inequalities, so I may have given a significantly more complicated proof than necessary. If this is the case, feel free to explain in a comment or in your answer. I'd love to get a better grip on these inequalities in addition to finding out what the limit is.  Thanks! How does a Windows 10 'digital license' activate the OS? Where does the extra kinetic energy come from in a gravitational slingshot? I read in  in this site that the KE a free-falling ball acquires is not originated by the attracting body but that energy was actually stored in the ball when it had been lifted to the height it dropped from.  In this way, it was said, gravity is subject to the conservation of energy principle and cannot change the total energy of an object.  Consider now the maneuver known as a  (also gravity assist) used by space probes such as the . A space probe approaches a planet with velocity $v$, slingshots around, and ends up with velocity $v+2U$, where $U$ is the velocity of the planet.  Consider the energy of the probe. Before, it was $E_i=\frac{1}{2} mv^2$ and after it is $E_f=\frac{1}{2} m(v+2U)^2$. It looks like $E_f$ is much bigger than $E_i$ - but where did the additional energy come from?   Is this not a violation of the conservation of energy principle? Why must I wait two days before accepting my own answer? I got this message today while trying to accept my answer on my own question.  Why must I wait this time, if I am sure that the answer I answered is the right one, just want to understand the point of view?  I faced that just today on Super user and didn't get this message before. RSA, DES, AES, etc., all use (relatively) complicated mathematics to encrypt some message with some key. For each of these methods, there have been several documented vulnerabilities found over the years. Some even believe that there is a vulnerability in AES known only to the NSA.  On the other hand, the one-time pad is not only ridiculously simple, but also has been shown to be impossible to crack (if used appropriately).  Say you have some message to be encrypted with length n. Simply generate a random string with length m where m is at least as large as n, and perform modular addition of the random string onto the message.  As long as the random string is generated with a high-enough-quality random number generator, and as long as the same one-time pad isn't reused, it should be impossible to crack.  If this is true, all we would need to perfect are fast, cryptographically secure deterministic random number generators. Use the key as a starting seed for the RNG and you have a powerful uncrackable encryption scheme which is simple to understand and implement.  Blum-Blum-Shub is a fast, cryptographically secure PRNG, and there are others too.  I have written a C++ program which uses two 2048-bit primes (which match the necessary criteria) for Blum-Blum-Shub and uses a password which the user enters - converted into a starting seed - to run byte-wise modular addition. The process is fast, deterministic, and if the literature I have read is correct then it should be very secure.  So why is so much time and effort invested in coming up with convoluted encryption cyphers when mathematics shows that the simplest is often the best? What is the difference between Reduce and Solve? Create a book cover with spine, rear page and flaps Can you identifiy this short about teenagers on a raft getting swallowed up by an oil slick? What is the difference between image size and image quality? I have a Casio EX-S12. It has a setting for image size, but also a separate setting for what it calls "image quality". There are three image quality values: "Fine", "Normal", and "Economy".  The Casio manual is not clear on what image "quality" actually means -- specifically how it's different from image size. All they say is that the "Fine" setting "helps to bring out details when shooting a finely detailed image of nature that includes dense tree branches or leaves, or an image of a complex pattern." I'm confused because isn't this what image size is all about (more pixels = more detail)?  In terms of memory usage, the manual also says that for a 5 megapixel picture, a "Fine" image takes up 2.99 MB, a "Normal" image takes up 1.62 MB, and an "Economy" image takes up 1.12 MB, so this "image quality" setting of theirs is certainly having a significant impact on memory usage.  My question is, what exactly is "image quality", if it's not image size? What is the "thing" that is taking up additional memory?  Thank you.