How can photons cause charges to attract?
Deriving the Coulomb force equation from the idea of photon exchange?
Why do employers require you to spread your 401(k) contributions throughout the year to get the maximum match? I think the title says it all. I can't see any reason employers have to incentivize employees to contribute to their 401(k) evenly throughout the year. Instead couldn't they use a relatively simple formula that is based on how much of their income the employee has contributed to their 401(k) thus far for the year? If that or their current contribution is over the threshold, they get the match this pay period, even if they didn't contribute anything.  EDIT: To clarify, my employer matches 100% of the first 3% of my contribution and 50% of the next 2%. The match is added every pay period along with my contribution. I am pretty sure there is no "true-up" feature, so if I were to hit the $17.5K limit early, and not be able to contribute at least 5% of my salary, I would not get the full match. So I have to be careful to make my contributions evenly throughout the year to get the maximum match. Just trying to figure out my employer's motivation for requiring this. Prove Equivalence Relation in G Hei, guys!  I'm having some trouble with the next problem:  Let $A$ and $B$ be subgroups of $G$. Show that $\sim$ is an equivalence relation when it is defined as follows: $g\sim g'\Leftrightarrow g' = agb$ for some $a$ from $A$, $b$ from $B$.  Should I prove this is valid for any a and b? It says for some elements a and b. But I might as well take the unit element.   Could you give me a clue on how to solve it?  Cheers! Layout selector missing In the Peter Jackson movie, once the One Ring is thrown into the volcano in Mount Doom, why does the mountain and tower collapse, and the ground disappears everywhere where the orcs are standing but not where the humans are? Where are all the orcs running to, what do they do next? How can I view the camera through an object as a material in Cycles? Show $GCD(a_1, a_2, a_3, \ldots , a_n)$ is the least positive integer that can be expressed in the form $a_1x_1+a_2x_2+ \ldots +a_nx_n$ Given $a_1, a_2, a_3, \ldots , a_n$ not all zero, show $\gcd(a_1, a_2, a_3, \ldots , a_n)$ is the least positive integer that can be expressed in the form $a_1x_1+a_2x_2+ \ldots +a_nx_n$. Also deduce $a_1x_1+a_2x_2+ \ldots +a_nx_n = b$ has solutions $\iff \gcd(a_1, a_2, a_3, \ldots , a_n)|b$.   I know that $ax+by=n$ has integer solutions $\iff \gcd(a,b)|n$. I'll need to use induction to show $a_1x_1+a_2x_2+ \ldots +a_nx_n = \gcd(a_1, a_2, a_3, \ldots , a_n)$ has solutions, and then I will be able to say that as $\gcd(a_1, a_2, a_3, \ldots , a_n) | a_1x_1+a_2x_2+ \ldots +a_nx_n $ for any $x_1,x_2, x_3 \ldots x_n$ then $c \leq \gcd(a_1, a_2, a_3, \ldots , a_n)$ and $c \geq \gcd(a_1, a_2, a_3, \ldots , a_n)$, and thus $c=\gcd(a_1, a_2, a_3, \ldots , a_n)$. When are stopovers permitted on Japan Railways (JR) trains? Suppose f(m,n) is a double sequence in $\mathbb R$. Under what condition do we have $\lim\limits_{n\to\infty}\sum\limits_{m=1}^\infty f(m,n)=\sum\limits_{m=1}^\infty \lim\limits_{n\to\infty} f(m,n)$? Thanks! What are the pros and cons of flip lock vs. twist lock on tripods? I am in search of a tripod. While doing a bit of research myself, I came to know that there are two broad variants of leg locks, viz. flip and twist lock. In many forums, I find people expressing conflicting views preferring each one over the other. This seems to confuse me even more while not being aware of what each type of lock operates. What are the prime considerations in choosing a particular lock system? This was an assertion made in our textbook but I have no idea how to show that either statement is true.  Also would like to show that that $\mathbb{Q}(\sqrt{2})$ is strictly larger than $\mathbb{Q}$, which was the second part of the assertion. Identity involving Euler's totient function: $\sum \limits_{k=1}^n \left\lfloor \frac{n}{k} \right\rfloor \varphi(k) = \frac{n(n+1)}{2}$ Let $\varphi(n)$ be Euler's totient function, the number of positive integers less than or equal to $n$ and relatively prime to $n$.    Challenge: Prove  $$\sum_{k=1}^n \left\lfloor \frac{n}{k} \right\rfloor \varphi(k) = \frac{n(n+1)}{2}.$$   I have two proofs, one of which is partially combinatorial.    I'm posing this problem partly because I think some folks on this site would be interested in working on it and partly because I would like to see a purely combinatorial proof.  (But please post any proofs; I would be interested in noncombinatorial ones, too.  I've learned a lot on this site by reading alternative proofs of results I already know.)  I'll wait a few days to give others a chance to respond before posting my proofs.  EDIT: The two proofs in full are now given among the answers. I'm a committer for the .  It went to the private beta phase sometime in the last 12 hours, but yet to have been invited. When I visit  I get the standard "To log in, you must have commited to the Area 51 site proposal and received the invitation email." message.  However, when I navigate to the Pets site via the Android app, I'm able to view the site in it's entirety (questions, answers and comments). When I attempt to post, I get a message saying my user token isn't allowed to take action on this site.  Same behavior is observed when using the iOS app. Proving Geometric Hahn-Banach Implies Analytic Hahn-Banach I've come across a proof online of the H.B theorem using the goemetric version.   There is a step in the proof which im not sure why is true and it is as follows:   Let $X$ be a linear space and $M \subset X \times \Bbb R$ be a maximal subspace.  Then $M = G(F)$ for $F :X \to \Bbb R$ linear.   Someone can show me why this is true?   Maybe I misunderstood the proof, its the last paragraph of Matrin's answer here -.   Thanks a lot for helping! How do I make a bootable Ubuntu USB? I love R. Courant and F. John's Introduction to Calculus and Analysis because of its wide coverage, precise description and friendly written style.  Are there any classic textbooks like it on ODE/PDE?  thanks. Why the following example prints "0" and what must change for it to print "1" as I expected ?  #include &lt;iostream&gt; struct base {    virtual const int value() const {       return 0;    }    base() {       std::cout &lt;&lt; value() &lt;&lt; std::endl;    }    virtual ~base() {} };  struct derived : public base {    virtual const int value() const {       return 1;    } };  int main(void) {    derived example; } Do the following negations mean the same thing? I don't think you understood me. / I think you misunderstood me.    Do these senteces mean the same thing? If not, what's the difference?  Edit: I just realized that I asked something different from what I originally wanted. So I am also interested in the following comparison:     I don't think you understand me. / I think you don't understand me. What is the sum of the 'second half' of the harmonic series?  $$\lim_{k\to\infty}\sum\limits_{n=k+1}^{2k}{\frac{1}{n}} =~ ?$$  More precisely, what is the limit of the above sequence of partial sums? I often see $I(t)\propto |E(t)|^2$. What is the exact form ? Which constants are missing to make this an equality and why are they so often omitted ? Get three highest values from the array