How can I create this table format?
Table with multiple merging
Can you use external money to pay trading commissions in tax-free and tax-deferred accounts? Find a plane that passes through a point and is perpendicular to 2 planes Find an equation of a plane that passes through $p(1,5,1)$ and is perpendicular to planes $2x+y-2z = 2$ and $x+3z=4$.  I basically need the 2 other points to make the vector and perform the cross product.  Since $ax+by+cz+d=0$ is the form of a plane. Can I obtain the points as $(a,b,c)$ of the 2 planes given? Also, how can I set them up to obtain the points? Is there any way to attract or repel neutrons? I know that neutrons are neutral and have no charge, but is there any other way to interact with them? I have absolutely no experience with Linux, and I desperately need to get my computer back up and running again with Windows.  How do I remove Ubuntu and reinstall Windows?    Editor's note: many of the answers are about removing Ubuntu from dual-boot but keeping Windows (which is a bit complicated), while other answers are about removing Ubuntu from single-boot (which is easy: basically just format the disk while installing Windows). The question as written is ambiguous between dual-boot or single-boot. I was just wondering about that because it would influence how I deal with closed questions, e.g. whether they need to be improved (tagging, formatting, code samples) after closing, or if some should be deleted altogether.  However, I'm not asking for answers to these questions, I just want to know if Google (and/or other search engines) list closed questions in their search results. (I hope they don't.) Group with order $pq$ has subgroups of order $p$ and $q$ Let G be a group with $o(G)=pq$, $p&gt;q$ are primes.  Prove that $G$ has a subgroup of order $p$ and a subgroup of order $q$.  Remark: I cannot find the topic with this problem.  I have tried different methods but no one of them did not bring result. Please show how to do that. Do not use Sylow's Theorem. If $(X,d)$ is a complete metric space and $A$ is closed then show that for $x \in X$ there exists an element $a_0 \in A$ such that $d(x,A)=d(x,a_0)$ Should you choose the MONEY or DECIMAL(x,y) datatypes in SQL Server? I'm curious as to whether or not there is a real difference between the money datatype and something like decimal(19,4) (which is what money uses internally, I believe).  I'm aware that money is specific to SQL Server. I want to know if there is a compelling reason to choose one over the other; most SQL Server samples (e.g. the AdventureWorks database) use money and not decimal for things like price information.    Should I just continue to use the money datatype, or is there a benefit to using decimal instead? Money is fewer characters to type, but that's not a valid reason :) Tractatus 3.333 and Russell's paradox Can anyone explain to a non-logician how Tractatus 3.333 refutes (or fails to refute) Russell's Paradox? Please explain his use of symbols! Finding minimum-area-rectangle for given points? As you see in the figure,  the question is:    How to find the minimum-area-rectangle (MAR) fitted on the given points?    and a supporting question is:    Is there any analytical solution for the problem?    (A development of the question will be to fit a box (3D) to a cluster of points in a 3D point cloud.)  As a first stage I propose to find the convex-hull for the points which reforms the problem (by removing those points are not involved in the solution) to: fitting a MAR to a polygon.  The required method will provide X (center of rectangle), D (two dimensions) and A (angle).      My proposal for solution:     Find the centroid of the polygon (see )   [S] Fit a simple fitted rectangle i.e., parallel to the axes X and Y   you may use minmax function for X and Y of the given points (e.g., polygon's vertices)  Store the area of the fitted rectangle Rotate the polygon about the centroid by e.g., 1 degree Repeat from [S] until a full rotation done Report the angle of the minimum area as the result   It looks to me promising, however the following problems exist:   choose of a good resolution for the angle change could be challenging, the computation cost is high, the solution is not analytical but experimental. What is a word for a person who uses resources to the maximum? Is there a word (or words) for a person who uses all resources to the maximum; for example, a person who keeps on using pencils even if they are very small? Find the last two digits of $9^{{9}^{9}}$ I have to find the last two decimal digits of the number $9^{{9}^{9}}$.  That's what I did:  $$m=100 , \phi(m)=40, a=9$$ $$(100,9)=1, \text{ so from Euler's theorem,we have :} 9^{40} \equiv 1 \pmod{100}$$  $$9^{{9}^{9}} \equiv 9^{9^{2+2+2+2+1}} \equiv 9^{9^2 \cdot 9^2 \cdot 9^2 \cdot 9^2 \cdot 9} \equiv 9^{81 \cdot 81 \cdot 81 \cdot 81 \cdot 9} \equiv 9^{(40+40+1) \cdot (40+40+1) \cdot (40+40+1) \cdot (40+40+1) \cdot 9} \equiv (9^{(40+40+1)})^{(40+40+1) \cdot (40+40+1) \cdot (40+40+1) \cdot 9} \equiv 9^9 \equiv 9^4 \cdot 9^4 \cdot 9 \equiv 6561 \cdot 6561 \cdot 9 \equiv 3721 \cdot 9 \\ \equiv 21 \cdot 9 \equiv 89 \pmod{100}$$  So,the last two digits are $8 \text{ and } 9$. $$$$But,is there also an other way two calculate the last two digits of $9^{{9}^{9}}$ or is the above the only one? How to write startup script for Systemd? I have 2 graphics cards on my laptop. One is IGP and another discrete.   I've written a shell script to to turn off the discrete graphics card.  How can I convert it to systemd script to run it at start-up? Is it possible to run Microsoft Office 2010? Converting MultiLinestring to Linestring with PostGIS How to prove this $\pi$ formula? I am hoping to find out where the formula  $$\frac{\pi}{2}=\sum_{k=0}^{\infty}\frac{k!}{\left(2k+1\right)!!}$$ comes from. I can't see how one could begin to prove it. How do I install Java? Prove if $n \in \mathbb N$, then $\frac{1}{2!}+\frac{2}{3!}+\frac{3}{4!}+\cdots+\frac{n}{\left(n+1\right)!} = 1-\frac{1}{\left(n+1\right)!}$   So I proved the base case where $n=1$ and got $\frac{1}{2}$  Then since $n=k$ implies $n=k+1$ I setup the problem like so:  $\frac{k}{(k+1)!}+\frac{(k+1)}{(k+2)!}=1-\frac{1}{(k+2)!}$  After trying to simplify it I got the following:  $\frac{k(k+2)!+(k+1)(k+1)!}{(k+1)!(k+2)!}=1-\frac{1}{(k+2)!}$  However, I'm having trouble simplifying it to match the RHS.  Hints? When I parent mesh to an armature (automatic weights), the mesh "jumps" forward a bit. If I select armature and switch to edit mode it "jumps" backward a bit.   Why is it happening and how can I fix it? I already applied location, rotation, and scale to the mesh and armature, but it didn't help.  Thank you in advance! Array index out of bound behavior Why does C/C++ differentiates in case of array index out of bound #include &lt;stdio.h&gt; int main() {     int a[10];     a[3]=4;     a[11]=3;//does not give segmentation fault     a[25]=4;//does not give segmentation fault     a[20000]=3; //gives segmentation fault     return 0; }  I understand that it's trying to access memory allocated to process or thread in case of a[11] or a[25] and it's going out of stack bounds in case of a[20000]. Why doesn't compiler or linker give an error, aren't they aware of the array size? If not then how does sizeof(a) work correctly?