Want to install Linux so that I can boot to my old windows and another Linux.
Before I start, don't lecture me on the fact that FAT32 is old and hasn't been updated for nearly 20 years. Right now I have sorted that. I am trying to install Ubuntu Linux onto a 64GB flash drive and it wants me to format it to one of the EXT file systems.  The problem is if I put the flash drive into a Windows PC, I can't use it. I also can't install the required software onto every Windows PC that I will use. When I tried to install it on FAT32 I got an error and there is no option for NTFS.  Does anyone know how I could do this? Maybe a Windows based tool? Thanks in advance.
On which Stack Exchange site should I post subjective questions? Is there something similar to sprintf() in C#?  I would for instance like to convert an integer to a 2-byte byte-array.  Something like:  int number = 17; byte[] s = sprintf("%2c", number); Is it possible to upgrade a BGA 1224 CPU? I want to upgrade the CPU of my T430s laptop from i7-3520M to i7-3632QM. I'm sure i7-3632QM is supported (same socket (BGA1224), same TDP (35W) and microcode found in BIOS (306A9.PAT)).  So my question is: 1) is it possible to de-solder the current CPU without damaging it, and to solder the new CPU without damaging it and the motherboard ? 2) if so, what tools are necessary? who can do that at a reasonnable cost?  Until now, I was unable to find anyone able (or willing) to do that (I'm located in France, and I have tried a local fablab, electronics shops, TV repair shops, ...). Any hint would be appreciated. Subadditive sequences and the limit $\sup_{n\to\infty} a_n / n$ Let $\{ a_n, n\geq 1\}$ be a sub-additive sequence, i.e. for any $m,p\geq 1$ $$ a_{m+p} \leq a_m + a_p. $$ .Prove that $$\lim_{n\to\infty} \frac{a_n}{n} = \inf_n \frac{a_n}{n}.$$ I guess the first step is to state $$a_{n} = a_{mp+q} \leq a_{mp} + a_q$$ but I'm not sure where to go from here.... Can't connect to Windows Update Determining best fitting curve fitting function out of linear, exponential, and logarithmic functions Context:  From a question on Mathematics Stack Exchange , someone has a set of $x-y$ points, and wants to fit a curve to it, linear, exponential or logarithmic.  The usual method is to start by choosing one of these (which specifies the model), and then do the statistical calculations.  But what is really wanted is to find the 'best' curve out of linear, exponential or logarithmic.  Ostensibly, one could try all three, and choose the best fitted curve of the three according to the best correlation coefficient.  But somehow I'm feeling this is not quite kosher. The generally accepted method is to pick your model first, one of those three (or some other link function), then from the data calculate the coefficients. And post facto picking the best of all is cherry picking. But to me whether you're determining a function or coefficients from the data it is still the same thing, your procedure is discovering the best...thing (let's say that which function  is -also- another coefficient o be discovered).  Questions:   Is it appropriate to choose the best fitting model out of linear, exponential, and logarithmic models, based on a comparison of fit statistics? If so, what is the most appropriate way to do this? If regression helps find parameters (coefficients) in a function, why can't there be a discrete parameter to choose which of three curve families the best would come from? Show that $\langle x,y\rangle_A = \langle Ax,Ay\rangle$ is an inner product on $\mathbb R^n$ Let $A$ be an $n \times n$ matrix with real enteries. Define $\langle x,y\rangle_A = \langle Ax,Ay\rangle, \quad x,y \in \mathbb R^n$ , where $\langle,\rangle$ is a standard inner product on $\mathbb R^n$. Then  $\langle x,y\rangle_A$ is an inner product iff  1)  $\ker A = \{0\}$.  2) $\operatorname{rank} A= n$.  3) all eigenvalues of $A$ are positive.  4) all eigen value of $A$ are non negative.  Clearly if $\ker A \neq \{0\}$, then there exist $x \neq 0$ such that $Ax =0$, then $\langle Ax, Ax\rangle_A = 0$, then $\langle ,\rangle_A$ is not inner product, so $\ker A = \{0\}$, thus rank of $A$ is $n$.  I am unable to check the 3) and 4) option. Please help to check the other option. Thank you What are the rules for animal mating? Injecting variable values into javascript and HAML in RoR Given this HTML:  &lt;div&gt;foo&lt;/div&gt;&lt;div&gt;bar&lt;/div&gt;&lt;div&gt;baz&lt;/div&gt;   How do you make them display inline like this:     foo bar baz   not like this:     foo   bar   baz How do I change the MAC address of my network card? I have a local network in a Windows system where the Admin gives permission to the PCs by their MAC address. But he is on vacations and I have a new PC.  How can I change the MAC address of my new PC to have the same MAC address as the old one?  I know this can be used for spoofing the address, but this is local, so I don't think I will have a problem. Ubuntu 12.04 comes with Gimp 2.6, so I installed Gimp 2.8 using the instructions below:   sudo apt-get purge gimp*   sudo add-apt-repository ppa:otto-kesselgulasch/gimp   sudo apt-get update   sudo apt-get install gimp    When try to open help, I get the message below. How do I install and configure the help for 2.8 on Ubuntu? Ways to Install and uninstall programs in deb format How do I run a sudo command in Emacs? How to implement Enums in Ruby? Why aren't variables declared in "try" in scope in "catch" or "finally"? In C# and in Java (and possibly other languages as well), variables declared in a "try" block are not in scope in the corresponding "catch" or "finally" blocks.  For example, the following code does not compile:  try {   String s = "test";   // (more code...) } catch {   Console.Out.WriteLine(s);  //Java fans: think "System.out.println" here instead }   In this code, a compile-time error occurs on the reference to s in the catch block, because s is only in scope in the try block.  (In Java, the compile error is "s cannot be resolved"; in C#, it's "The name 's' does not exist in the current context".)  The general solution to this issue seems to be to instead declare variables just before the try block, instead of within the try block:  String s; try {   s = "test";   // (more code...) } catch {   Console.Out.WriteLine(s);  //Java fans: think "System.out.println" here instead }   However, at least to me, (1) this feels like a clunky solution, and (2) it results in the variables having a larger scope than the programmer intended (the entire remainder of the method, instead of only in the context of the try-catch-finally).  My question is, what were/are the rationale(s) behind this language design decision (in Java, in C#, and/or in any other applicable languages)? I have the following sequences $(a_n)$, $(b_n)=(a_{2n})$, and $(c_n) = (a_{2n-1})$.  I have to show that:   if $(b_n)$ and $(c_n)$ both convergence to $a$, then $(a_n)$ also converges to $a$; if $(a_n)$ converges then $(b_n)$ and $(c_n)$ also converge; there exist $(a_n)$ not converging but with $(b_n)$ and $(c_n)$ converging.   I am not sure how to solve this since I only know that $(b_n)$ > $(c_n)$ > $(a_n)$ on the terms how the sequences are defined. Strange set notation (a set as a power of 2)? I am not very well versed on set theory or syntax, but I thought I knew the basics.  However, in a book about databases I am reading now, the author uses $2^x$ to signify "a set of $x$."  For example, $2^{\text{dogs}}$ is a set of $\text {dogs}$, etc.    The author never really explained this or why he does it, I just picked up the meaning from context.    I am not sure why the exponent operator is used, nor am I sure what the number $2$ has to do with it.  The sets being represented are NOT powers of $2$ (in size)... they come in all sizes.  Is this a valid notation?  I have not seen it anywhere before... Why is the well ordering principle counter-intuitive? I read  that while 'The Axiom of Choice agrees with the intuition of most mathematicians; the Well Ordering Principle is contrary to the intuition of most mathematicians'. I don't understand why this is so. According to Wikipedia, 'the well-ordering principle states that every non-empty set of positive integers contains a least element'. This is quite a straightforward definition. Is it the way you derive the equivalence of the Axiom of Choice and well ordering principle that makes it counter-intuitive or the definition of the least element? What do the various dpkg flags like 'ii' 'rc' mean? I frequently need to check which packages are installed, and I use the following command:  dpkg -l | grep foo  which gives the following output  Desired=Unknown/Install/Remove/Purge/Hold | Status=Not/Inst/Cfg-files/Unpacked/Failed-cfg/Half-inst/trig-aWait/Trig-pend |/ Err?=(none)/Reinst-required (Status,Err: uppercase=bad) ||/ Name                       Version         Description ii   foo                       &lt;version&gt;         &lt;description&gt;    What does the ii mean?  What other flags are there? How to read the flags? (because the explanation is quite complicated, IMO)   Thanks.