What to do with my previous jobs' 401ks? Advice for someone in his 20's
Started new job. Rollover previous employer 401k to new 401k, IRA or Roth IRA?
Splitting a semicolon-separated string to a dictionary, in Python I have a string that looks like this:  "Name1=Value1;Name2=Value2;Name3=Value3"   Is there a built-in class/function in Python that will take that string and construct a dictionary, as though I had done this:  dict = {     "Name1": "Value1",     "Name2": "Value2",     "Name3": "Value3" }   I have looked through the modules available but can't seem to find anything that matches.    Thanks, I do know how to make the relevant code myself, but since such smallish solutions are usually mine-fields waiting to happen (ie. someone writes: Name1='Value1=2';) etc. then I usually prefer some pre-tested function.  I'll do it myself then. I installed Fedora 15 on my laptop and deleted XP (at least I think XP is deleted).  Then I installed Ubuntu as dual boot with Fedora 15.  Now I want to remove Fedora 15 and leave only Ubuntu (and XP if it is still available).  Can anyone help with the steps to uninstall Fedora?  Please give me simple steps to follow, I'm a nooby.  Thanks! Divisibility by 7 rule, and Congruence Arithmetic Laws I have seen other criteria for divisibility by 7. Criterion described below present in the book Handbook of Mathematics for IN Bronshtein (p. 323) is interesting, but could not prove it. Let $n = (a_ka_{k-1}\ldots a_2a_1a_0)_{10} = \displaystyle{\sum_{j=0}^{k}}a_{k-j}10^{k-j}$. The expression $$ Q_{3}^{\prime}(n) = (a_2a_1a_0)_{10} - (a_5a_4a_3)_{10} + (a_8a_7a_6)_{10} -\ldots  $$ are called alternating sum of the digits of third order of $n$. For example,  $$ Q_{3}^{\prime}(123456789) = 789-456+123=456 $$ Proposition: $7 | n \ \Leftrightarrow \ 7 | Q_{3}^{\prime}(n)$.  proof. ??  Thanks for any help. Use $\delta-\epsilon$ to show that $\lim_{n\to\infty} a^{\frac{1}{n}} = 1$? Hope this is a meaningful question, but I'm curious if is possible to show that   $$\lim_{n\to\infty} a^{\frac{1}{n}}=1, \text{where  }a&gt;0$$  using $\delta-\epsilon$ directly or other methods. One method that I am aware of is to use the following:     If $\{s_n\}$ is a nonzero sequence, then $\liminf\bigl|\frac{s_{n+1}}{s_n}\bigr|\le \liminf |s_n|^{\frac{1}{n}}\le \limsup |s_n|^{\frac{1}{n}}\le\limsup\bigl|\frac{s_{n+1}}{s_n}\bigr|$ Which is better: Employer-sponsored HSA or opening an HSA individually? So I know that:   Employer-sponsored HSA's allow you to deduct contributions directly from your paycheck, pre-tax With individual HSAs, you must contribute using post-tax dollars, then deduct those contributions from your taxable income when you do your taxes   Given those facts, I guess it's marginally better to use an employer-sponsored HSA because it means the government doesn't temporarily hold on to your taxed income, only to return it later after you do your taxes; you could theoretically put that money to work in an investment vehicle instead of having the government hold it hostage for a while.  But are there any other benefits (either way) that I'm not aware of? The  kind of threw me with the following statement:     The main advantage of making pre-tax contributions is the Federal Insurance Contributions Act tax (FICA) and Medicare Tax deduction, which amounts to a savings of 7.65% each to the employer and employee (subject to limits of the Social Security Wage Base).   But I'm not really sure what that's telling me.  My employer is offering an HSA, but is not offering to contribute to the HSA or match my contributions. So if it's all pretty much the same, I'd rather use the bank of my choosing and manage it privately.  Thanks. Test of whole distribution for two samples Interaction of Invoke Duplicity and Misty Step 'chmod u+x' versus 'chmod +x' What is the difference between chmod u+x and just chmod +x?  I have seen a ton of tutorials that say to use u+x to make scripts executable.  However, omitting the u doesn't seem to have any effect. How can I remove all duplicates so that NONE are left in a data frame? Total number of solutions of an equation What is the total number of solutions of an equation of the form $x_1 + x_2 + \cdots + x_r = m$ such that $1 \le x_1 &lt; x_2 &lt; \cdots &lt; x_r &lt; N$ where $N$ is some natural number and $x_1, x_2, \cdots, x_r, m$ are integers?  Also, what would be the solution in the relaxed case where $x_1, x_2, x_3, \dots, x_r$ could be equal? How find this $x^3-5x+10=2^y$ let $x,y$ is positive integer,and such $$x^3-5x+10=2^y$$ find all $x,y$.  since $$x=1\Longrightarrow 1^3-5+10=6$$ can't $$x=2,2^3-5\cdot 2+10=8=2^3$$ so $x=2,y=3$  $$x=3,LHS=27-15+10=22$$ $$x=4,LHS=64-20+10=54$$ $$x=5,LHS=125-25+10=110$$ $$x=6,LHS=216-30+10=236$$ $$\cdots$$  I find $$(x,y)=(2,3)$$  I only find $x\le 7$ this solution.  maybe this have other solution.and This problem is from Mathematical olympiad problems Thank you What is the progression route in Terraria? Mounting /cow on root failed: Invalid argument overlay mount failed I am using an xps 13 9365, which was data wiped from bios by a friend who then gave it to me thinking it was dead. I tried booting with a USB (current LTS distro (18.04 or similar)) boot disk and got into the language selection / setup menu. By using the F6 option I selected noapic. In bios sata is set to raid and legacy the secure boot option is off.   But when I try to install I get kicked into a tiny font window with the following message  (initramfs) mount: Mounting /cow on root failed: Invalid argument overlay mount failed  Any ideas? Can I use extra wire from two separate cables to add a washing machine in a garage? I'd like to colorize a cell based on its contents. 0 = red, 100 = green, and linearly interpolated between.  function LinInt(x){       var ss = SpreadsheetApp.getActiveSheet();   var cell = ss.getActiveRange();   var hue;   hue = (x/100)*120;    var color = HSVtoRGB(hue, 40, 100);   cell.setBackground(color);    return x;     }     function HSVtoRGB(h, s, v) {     var r, g, b, i, f, p, q, t;     if (h &amp;&amp; s === undefined &amp;&amp; v === undefined) {         s = h.s, v = h.v, h = h.h;     }     i = Math.floor(h * 6);     f = h * 6 - i;     p = v * (1 - s);     q = v * (1 - f * s);     t = v * (1 - (1 - f) * s);     switch (i % 6) {         case 0: r = v, g = t, b = p; break;         case 1: r = q, g = v, b = p; break;         case 2: r = p, g = v, b = t; break;         case 3: r = p, g = q, b = v; break;         case 4: r = t, g = p, b = v; break;         case 5: r = v, g = p, b = q; break;     }   return '#'+((b | g &lt;&lt; 8 | r &lt;&lt; 16) / 0x1000000).toString(16).substring(2); }   When I do this I get an error saying that I am not allowed to call setBackground. I assume this is because I'm not allowed to change the color of one cell from another because I'm screwing up getting the current cell that the function is running in.  How do I get the cell that the function is running in so that I can call setBackground() on it?  For example, I'd like to type =LinInt(50) into cell A1 and have A1 be yellow and have the number 50 in it. Then when I type =LinInt(100) into cell A2 it is green and has the number 100 in it. Why does my water pressure fluctuate? Limit FTP access only to the /var/www with vsftpd I am running vsftpd as ftp server on my linux (rasbian), I log in to the machine as a root user.  I would like to be still locked to using only /var/www, how can I configure vsftpd conf to accomplish it? Installing QGIS with ECW support on Mac? Can the 'bin size' in a histogram be thought of as a regularity constraint? $\operatorname{Aut}(\mathbb Z_n)$ is isomorphic to $U_n$. I've tried, but I can't solve the question. Please help me prove that:  $\operatorname{Aut}(\mathbb Z_n)$ is isomorphic to  $U_n$.