What is the best free software for OS X Mountain Lion for enabling write support for FAT32 and NTFS?
What is the best, easiest, preferably cheapest way to make OS X write to NTFS-formatted drives in Mac OS X?
How do I create a completely unattended install of Ubuntu? I need a CD or USB stick, that will install Ubuntu on a completely headless machine. Stick CD in and restart, no keyboard or screen should be involved.  There are a few obstacles:   The language selection menu when you first boot the CD. The fact that the CD menu waits. The installer's asking questions during installation. I read about Java's type erasure .  When does type erasure occur? At compile time or runtime? When the class is loaded? When the class is instantiated?  A lot of sites (including the official tutorial mentioned above) say type erasure occurs at compile time. If the type information is completely removed at compile time, how does the JDK check type compatibility when a method using generics is invoked with no type information or wrong type information?  Consider the following example: Say class A has a method, empty(Box&lt;?&nbsp;extends&nbsp;Number&gt;&nbsp;b). We compile A.java and get the class file A.class.  public class A {     public static void empty(Box&lt;? extends Number&gt; b) {} }     public class Box&lt;T&gt; {}   Now we create another class B which invokes the method empty with a non-parameterized argument (raw type): empty(new Box()). If we compile B.java with A.class in the classpath, javac is smart enough to raise a warning. So A.class has some type information stored in it.  public class B {     public static void invoke() {         // java: unchecked method invocation:         //  method empty in class A is applied to given types         //  required: Box&lt;? extends java.lang.Number&gt;         //  found:    Box         // java: unchecked conversion         //  required: Box&lt;? extends java.lang.Number&gt;         //  found:    Box         A.empty(new Box());     } }   My guess would be that type erasure occurs when the class is loaded, but it is just a guess. So when does it happen? So I know the basic gist is that fusion power's main issue is sustaining the fusion. I also know that there are two methods. The Torus method and the laser method. The torus magnetically contains plasma and heats it with radiation and accelerates the plasma around to make strong enough collisions that protons fuse. The laser method uses 192 lasers and focuses it on tiny frozen hydrogen pellets and aims to initiate fusion each time pellets are dropped.  The though struck me when we could sorta combine the two designs together. The torus doesn't have to worry about making fusion happen at a specific location but it has issues in that the plasma is unevenly heated and leaks. On the other hand, the laser design is extremely complicated in the level of precision needed and would have to repeat this for every pellet. This lead me to think to make something precise and contained at the same time.  I see that particle colliders are able to direct two beams of protons and have them collide at a specific spot with a very precise energy. Couldn't we tune the energy of the two beams of protons to the energy required for them to fuse? We have the ability to smash them into bits, surely we have the ability to have them fuse. (I'm thinking about the type of collider that circles two beams in opposite directions)  It would be at much lower energies than normal colliders and would be very precise and it would be possible to fuse at a specific location that has greater leeway because for protons that missed collision, they'd just circle around again! Thus protons would efficiently be used and very little would be wasted. There wouldn't be problems of plasma leakage because we are focusing them in a thin tight beam.   It seems that this idea has girth, or I feel this way at least, can someone back me up by offering some calculations on how to calculate the efficiency? How would I go about calculating the two circling beams of protons and at what specific velocity would be needed? etc. update line based on previous line If $\mathrm{Tr}(A)=0$ then $T=R^{-1}AR$ has all entries on its main diagonal equal to $0$ Prove that if $A$ is a square matrix and $\mathrm{Tr}(A)=0$, then there exists an invertible matrix $R$ such that the matrix $T=R^{-1}AR$ has all entries on its main diagonal equal to $0$.   It seems like the formula $A=S\Lambda S^{-1}$, but maybe it does not help.  Thanks so much. How does the twitter bot work? I heard that there was a twitter bot which automatically posted questions and asked for answers for specific questions on every site. How do they work? Is there an algorithm for doing this or is it purely random? I know that it doesn't tweet closed questions, but that's it. Local DNS server I've used git clone to make a local copy of a GitHub repository containing a  I'd like to use. The local copy contains all of the source for the program; but as a newbie to Ubuntu, I've no idea of what tools or steps are involved in compiling and installing the driver.   I'd really appreciate if anyone could provide a step-by-step guide? Write down the sum of sum of  sum of digits of $4444^{4444}$ Let $A = 4444^{4444}$;  Then sum of digits of $A = B$; Then sum of digits of $B = C$; Then sum of digits of $C = D$;  Find $D$.  What should be the approach here? How many triples $(x,y,n)$ are there such that $x^n - y^n = 2^{100}$ The definition for marker below is from tcolorbox.doc.s_main.sty. With earlier versions of Texlive (and tcolorbox), this worked fine, but with updated Texlive, it does not.  \documentclass{article} \usepackage{xcolor,tikz,tcolorbox} \usetikzlibrary{shadows} \tcbuselibrary{skins,hooks} \makeatletter % from tcolorbox.doc.s_main.sty \newtcolorbox{marker}[1][]{enhanced,   before skip=2mm,after skip=3mm,   boxrule=0.4pt,left=5mm,right=2mm,top=1mm,bottom=1mm,   colback=yellow!50,   colframe=yellow!20!black,   sharp corners,rounded corners=southeast,arc is angular,arc=3mm,   underlay={%     \path[fill=tcbcol@back!80!black] ([yshift=3mm]interior.south east)--++(-0.4,-0.1)--++(0.1,-0.2);     \path[draw=tcbcol@frame,shorten &lt;=-0.05mm,shorten &gt;=-0.05mm] ([yshift=3mm]interior.south east)--++(-0.4,-0.1)--++(0.1,-0.2);     \path[fill=yellow!50!black,draw=none] (interior.south west) rectangle node[white]{\Huge\bfseries !} ([xshift=4mm]interior.north west);     },   drop fuzzy shadow,#1} \makeatother   \begin{document} \begin{marker}   Hylo! \end{marker}  \end{document}   This gives the following error  ! Package xcolor Error: Undefined color `tcbcol@back'.  See the xcolor package documentation for explanation. Type  H &lt;return&gt;  for immediate help.  ...                                                l.34 \end{marker}  ?   Why are tcbcol@back and tcbcol@frame undefined if they work in the code for the package's documentation? Alternatively, what are the correct names for the colours which were tcbcol@back and tcbcol@frame?  My version of tcolorbox is 2019-09-19. How to configure splash screen after plymouth I have configured my splash screen for plymouth - and it works perfectly. I've also configured the display manager (I'm using gdm). In between these two I get a very brief splash screen - a kind of swirl of multi-coloured ubuntu like colours. Where does this splash screen get set, and how do I change it?  Edit: Here is a video of my boot sequence, showing the screen in question: A customer of mine wants to pay me from the usa to my account with N26 bank.N26 Bank is a German online bank with no branches but available to customers in the euro-zone.I opened my account online in Portugal.When my customer made the transfer and sent me the slip,i discovered the beneficiary name was completely wrong but the Iban and Swift was correct.Will the wire transfer go through with correct Iban and Swift but incorrect beneficiary name? Is there any difference between "offense" and "offence"? How do I prove this using question using Cauchy-Schwarz inequality? Can somebody help me understanding the fouries series coefficients?  I know that if we have:  $$f(t) = \sum_{n=1}^N A_n \sin(2\pi nt + Ph_n) \tag{where $Ph_n$ = phase}$$  And because of the $\sin(a+b)$ formula: $$ f(t) = \sin(2\pi nt + Ph) = \sin(2\pi nt )\cos(Ph_n) + \cos(2\pi nt )\sin(Ph_n)$$ Then:  $$\sum_{n=1}^N A_n \sin(2\pi nt + Ph) = \sum_{n=1}^N (A_n\sin(2\pi nt )\cos(Ph_n) + A_n\cos(2\pi nt )\sin(Ph_n))$$ And by definition: $$a_n = A_n\cos(Ph_n)$$ $$b_n = A_n\sin(Ph_n)$$ Then:  $$f(t) = \sum_{n=1}^N A_n \sin(2\pi nt + Ph) = \sum_{n=1}^N (a_n\sin(2\pi nt ) + b_n\cos(2\pi nt ))$$ Where does the $A_n$ in the first formula come from? Could somebody explain me where does the $\frac{a_0}{2}$ in the formula below come from? $$f(x) = \frac{a_0}{2}+\sum_{n=1}^\infty (a_n \cos(nx) + b_n \sin(nx))$$  And the most important:  How can I proof the formulas for the $a_n$ and $b_n$ coefficients?  PLEASE, I'm searchinf for these answers for DAYS. Is floating point math broken? Consider the following code:   0.1 + 0.2 == 0.3  -&gt;  false   0.1 + 0.2         -&gt;  0.30000000000000004   Why do these inaccuracies happen? Suppose you want to ask someone to do something, say to tell you the way to a station. Which is more polite, "Would you tell me the way to the station?" or "Could you tell me the way to the station?"? Is there a way to conveniently define a C-like structure in Python? I'm tired of writing stuff like:  class MyStruct():     def __init__(self, field1, field2, field3):         self.field1 = field1         self.field2 = field2         self.field3 = field3 probability of $k$ boxes contain exactly $1$ ball