When partitioning from scratch a USB Flash drive (8GB or larger) under Windows (diskpart) or Linux (gparted, fdisk) as Master Boot Record with a single partition, that partition usually starts at byte 1048576 (1MiB). To non-destructively display that value under Windows try (lowercase characters optional)  DISKPART LISt DISk SELect DISk !      (use appropriate disk number) SELect PARtition 1 DETail PARtition   (among other things, tells where the partition starts) EXIt   The value is down to 65536 (64kIB) for 1GB to 4GB drives. Under diskpart, the (DESTRUCTIVE) CLEan then CREate PARtition PRImary OFFSET=32 is supposed to reduce that to 32kiB, but instead is silently ignored if below the minimum value diskpart wants (1024 or 64 depending on drive). Lower values cause an error.  When partitioning under OS X (Disk Utility) and asking for MBR, one gets the first partition at 1024 (1kiB). That's about 1MiB more usable space (for an 8GB drive). I have not found any drawback.  Granted, that habit of Windows and Linux partitioning tools looses at most 0.012% of the space. But: what is the rationale?
I had two drives partitioned the same and running two RAID partitions on each.  One died and I replaced it under warranty for the same model.  While trying to partition it, the first partition can only start on sector 2048, instead of 63 that was before. Drive have different geometry as previous and remaining ones. (Fewer heads/more cylinders)  Old drive:  $ sudo fdisk -c -u -l /dev/sdb   Disk /dev/sdb: 2000.4 GB, 2000398934016 bytes 255 heads, 63 sectors/track, 243201 cylinders, total 3907029168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0x000aa189     Device Boot      Start         End      Blocks   Id  System /dev/sdb1   *          63   174080339    87040138+  83  Linux /dev/sdb2       174080340   182482334     4200997+  82  Linux swap / Solaris /dev/sdb3       182482335  3907024064  1862270865   fd  Linux raid autodetect   Remanufactured drive received from warranty:  $ sudo fdisk -c -u -l /dev/sda  Disk /dev/sda: 2000.4 GB, 2000398934016 bytes 81 heads, 63 sectors/track, 765633 cylinders, total 3907029168 sectors Units = sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disk identifier: 0x000d0b5d     Device Boot      Start         End      Blocks   Id  System /dev/sda1            2048  ...   Why is that?
What constitutes protons? When I see pictures, I can't understand. Protons are made of quarks, but some say that they are made of 99% empty space. Also, in this illustration from Wikipedia, what's between the quarks? Consider a sequence of $n$ Bernoulli trials with $P(\text{success})=p$. Let $X_i$ and $X_j$ be indicator variables of the number of "success" in $i$th and $j$th runs. Given the total number of success was $m$, $m&lt;n$. I am asked to compute the correlation coefficient for $X_i$ and $X_j$.  Now I know the formula for correlation coefficient, but to compute the co-variance I will need to find $E(X_i)$ and $E(X_j)$ first. By definition does $E(X_i)=p_i$ and $E(X_j)=p_j$? I feel this seems a bit too easy but I can't see whats wrong with it. Ubuntu 17.10 Upgrade Broke VMWare Workstation 12.5 Hi after upgrading to Ubuntu 17.10, vmware is now not starting.    I get the message:    /usr/lib/vmware/bin/vmware-modconfig: Relink `/lib/x86_64-linux-gnu/libbsd.so.0' with `/lib/x86_64-linux-gnu/librt.so.1' for IFUNC symbol `clock_gettime'   I am aware that there are patches available and I am attempting to apply these and recompile. I have run from the solution at :    cd ~   #Copy the vmmon source tar ball to your temporary location cp /usr/lib/vmware/modules/source/vmmon.tar .    #Extract the tar ball tar xf vmmon.tar    #Download the modified file that mkubecek posted and overwrite the one from the tar ball for VMware Workstation 12.5: wget -O ./vmmon-only/linux/hostif.c https://raw.githubusercontent.com/mkubecek/vmware-host-modules/b50848c985f1a6c0a341187346d77f0119d0a835/vmmon-only/linux/hostif.c     #Wrap up the newly modified files into a tar ball replacing the original one sudo tar cf /usr/lib/vmware/modules/source/vmmon.tar vmmon-only    #Rebuild the VMware kernel modules sudo vmware-modconfig --console --install-all   Failed to get gcc information.  gcc --version gcc (Ubuntu 7.2.0-8ubuntu3) 7.2.0 ...   Unforunately, vmware-modconfig is failing because of a dependency it seems on a particular gcc version. Am I on the right track? Any help with this issue would be much appreciated.  EDIT Thank you Steve, the below has gotten vmware going again. I've included minor correction. Tested and confirmed I could run a virtual machine.   sudo su    # do all below as root cd /usr/lib/vmware/modules/source tar xvf vmmon.tar  tar xvf vmnet.tar wget -O ./vmmon-only/linux/hostif.c https://raw.githubusercontent.com/mkubecek/vmware-host-modules/b50848c985f1a6c0a341187346d77f0119d0a835/vmmon-only/linux/hostif.c vim vmnet-only/bridge.c cd vmmon-only/ make cd ../vmnet-only/ make cd .. mkdir /lib/modules/4.13.0-16-generic/misc cp *.o /lib/modules/4.13.0-16-generic/misc insmod /lib/modules/4.13.0-16-generic/misc/vmmon.o insmod /lib/modules/4.13.0-16-generic/misc/vmnet.o rm /usr/lib/vmware/lib/libz.so.1/libz.so.1 ln -s /lib/x86_64-linux-gnu/libz.so.1 /usr/lib/vmware/lib/libz.so.1/libz.so.1 vmware-networks --start exit  # run vmware as normal user /usr/lib/vmware/bin/vmware Elastic net penalty I have a question about the elastic net penalty as implemented in glmnet in R compared to the original paper by Zou and Hastie (2005). In glmnet the penalty is listed as   $$ (1-\alpha)/2||\beta||_2^2+α||\beta||_1. $$  but in the paper it is  $$(1-\alpha)||\beta||_1 + \alpha||\beta||_2^2.  $$  Does anyone know where the factor $\frac12$ some from? (Never mind the fact that the $\alpha$'s were swapped between the two parameterisations.) In both cases the penalties are multiplied by $\lambda$, but what are the mathematical/technical arguments for not using a simple convex combination of the lasso and ridge penalties? What does the 'static' keyword do in a class? To be specific, I was trying this code:  package hello;  public class Hello {      Clock clock = new Clock();      public static void main(String args[]) {         clock.sayTime();     } }   But it gave the error      Cannot access non-static field in static method main   So I changed the declaration of clock to this:  static Clock clock = new Clock();   And it worked. What does it mean to put that keyword before the declaration? What exactly will it do and/or restrict in terms of what can be done to that object? What does character set and collation mean exactly? I can read the MySQL documentation and it's pretty clear. But, how does one decide which character set to use? On what data does collation have an effect?  I'm asking for an explanation of the two and how to choose them. There are numerous (, , ) questions concerning this problem. I realize this is a borderline duplicate, but I'll re-iterate the futility of this particular filter and why it should be outright removed from Stack Overflow.  Do you know how effective this is in preventing users who just don't care from posting questions with bad titles? 100% ineffective. What do these users do?   Replace it with a synonym: "issue," "trouble," "predicament," "botheration" or what have you. Or worse, they simply work around the filter by deliberately misspelling the word or inserting space or punctuation:    () ?    and the coup de grâce:      I mean, even Jeff . This adds zero value to the title. In fact, it looks worse. Why, oh why are people  to scrap a bad feature? All this does is:   Prevent people who have a  to use the word "problem" in the title from posting questions with an appropriate title. Break the search feature because of workarounds or the need to use less descriptive titles than the error itself   This is an extraordinarily useless (and harmful) feature. Please, for the love of Cthulhu,  remove, eliminate, abolish, eradicate, extirpate this "feature" from Stack Overflow.    Bonus:     So I can't mention the Halting Problem in the title? – Keith Thompson Nov 1 at 19:05      @KeithThompson Maybe it's a "Halting Issue". Or "Need help with Halting". Or the "Halting thing in Computability Theory". – slhck Nov 1 at 19:14 Show for prime numbers of the form $p=4n+1$,  $x=(2n)!$ solves the congruence $x^2\equiv-1 \pmod p$. $p$ is therefore not a gaussian prime. I need to show that for prime numbers of the form $p=4n+1$, $x=(2n)!$ solves the congruence $x^2 \equiv-1\pmod p$. I then need to show this implies p isn't a gaussian prime.   I have started to solve this using Wilson's theorem that a number $z$ is prime iff $(z-1)!\equiv-1\pmod z$. Therefore the endpoint of my proof should be that $(p-1)!\equiv-1\pmod p$.  As $p$ is of the form $p=4n+1$, I only need to prove that $4n!$ is congruent to $-1$ modulo $p$.   Here is my working so far: Starting with the congruence $x^2 \equiv -1\pmod p$:    $$\eqalign{x^2 = -1\pmod p&amp;\implies   x^2 + 1 = kp \implies (x-i)(x+i) = kp\cr &amp;\implies ((2n)!-i)((2n!)+i))=kp \implies 4n!- 1 =kp\cr}$$   This is where I start to run out of any ideas that seem to get me anywhere. Any tips would be greatly appreciated! How do I get started playing Dungeons and Dragons 4th edition by myself? I've been wanting to start playing D&amp;D for some time, and I was wondering how I could get started by myself with relative ease. I own the first two player handbooks, and a set of dice. What is the difference between class and instance attributes? Problem  I have various footnotes, which are hyperlinked from the text to the bottom of their respective pages. When I click on the hyperlinks (in the main text), they always take me to the first page of my document. I also have footnotebackref which puts a hyperlink at the footnote to take the reader back to the main body of text and these links for fine.   Edited MWE  After a lot of deletion, I have managed to reduce the document to the following lines. One might say that I have found the problem, since the removal of \usepackage[hang, flushmargin]{footmisc} stops the problem, but I would still like to have non-indented footnotes.  \documentclass{article}  \usepackage[usenames,dvipsnames]{color} \usepackage[colorlinks=true]{hyperref}  \usepackage[hang, flushmargin]{footmisc}         %Problem line. \usepackage{footnotebackref}  \begin{document} \tableofcontents             \newpage                 \section{Section} This is some text\footnote{This is a footnote.}. \end{document} Recently I switched from Google to DuckDuckGo and so far I am very pleased with the experience. "The Internet" tells me that one of DuckDuckGo's best features is the possibility to directly search on specific pages using bangs (defined prefixes). E.g. search for "!so [duck-duck-go]" on DuckDuckGo to get duck-duck-go tagged questions on Stackoverflow.  I was searching for a comprehensive list of all available bangs, but the only thing I found was the official  wich offers a search box and categorized lists, but no complete list of all 7,447* bangs.  Is there a possibility to find all bangs without clicking through all the categories on the bang-page?    (*) by time of writing, 2015-12-15 Customizing tray/taskbar date display in Ubuntu with GNOME 3 Show that the quotient space is homeomorphic to the n-disc mysql database no space available I was restoring a 200 GB database into a newly installed RHEL machine. However, while restoring I ran into no space available issue.   Is it possible to change the directory where the databases are stored? Let $N$ be a normal subgroup of $G$. Let $G/N = \{gN : g \in G \}$. Show that the $(G/N, \circ, 1_{G/N})$ is a group, where:  $\circ : G/N \times G/N \rightarrow G/N$ is defined by $(gN \circ hN) = ghN$ and $1_{G/N} = 1*N$.  Thanks for your help. 12.04 GPU lockup I was able to install Ubuntu 12.04 using the alternative version of the image, (64 bit) but when I start the system it tells me the GPU  locked up, and instead presents a text only screen.  I understand that this site is not for bug reports, but at the same time, I know that there are some versions of the installer than have to be compatible with my graphics card (Nvidia GTS 360M).  I assumed that the mere fact that the alternative installer ran was an indication that I could get some sort of graphical interface running after the install.  Is there some way of getting some type of graphical interface running on my machine? Even better would be is there a way to get the rest of the system running as normal (i.e. GPU up and running)?  If an internet connection is required to download driver support or something similar, directions for how to configure a wireless connection with WPA2-Personal protection from the text-only interface (bash).  Any help would be appreciated.  Note: I was able to find  which tells me that the card is supported.  Note 2: In the install software stage of the install, I was unable to install anything (no internet connection)  Update: The exact error message is [8.591394] [drm] 0000:01:00.0: GPU Lockup - switching to software fbcon  Update 2: If I try to install with the regular version of Ubuntu, the screen goes staticy. This also happens if I install with Wubi (distasteful I know) and then try to use Ubuntu.  Update 3: I've tried xforcevesa, nomodeset and xforcevesa nomodeset as my wubi boot options.  Update 4: Thanks to jokerdino, I can now connect to the internet, so internet tools would now be a possibility. Assume that $M$ and $N$ are two finitely generated $R$-modules. Then $\operatorname{Hom}_{R}(M,N)$ is a finitely generated $\mathbb Z$-module and/or $R$-module (in this case, assume that $R$ is commutative)?   Note that $R$ is not Noetherian ring. Is there any counterexample (for any cases)? Correct usage of will and would Isomorphism between $\mathbb{C}^* $ under multiplication with $\mathbb{C}$ under addition. Does there exists an Isomorphism between $\mathbb{C}^* $ under multiplication with $\mathbb{C}$ under addition.  Attempt In my opinion It does not exists.  If there exists such an isomorphism say $\phi :\mathbb{C}^* \to \mathbb{C}$ then, from the fact that Isomorphism takes identity to identity we have $$\phi \left( 1 \right)=0$$  From the fact      Given $\phi:G \to H$ be an isomorphism, then For a fixed integer $k$ and a fixed group element $b$ in $G$, the   equation $x^k=b$ has the same number of solutions in $G$ as does   the equation $x^k=\phi\left(b\right)$ in $H$.   We have $x^4=1$ and $x^4=0$ must have same number of solutions, but the solutions to these equations are 4 and 1 only.