How to specify the locations of executable JAR file and manifest file using maven with pom.xml
How can I create an executable JAR with dependencies using Maven?
Loopy integral $\int xe^x\sin(x)$ How do I install a different Python version using apt-get? How can I install a different version of Python using apt-get?  Obviously I realise I can install using the source tar ball, however I would prefer not to install from source and instead use the package manager, as that's what it's there for. Surely somewhere reputable builds .deb files for the latest Python releases (why python.org don't is beyond me) that I can reference.   What do I need to do to reference them and what issues might it create when upgrading to the next version?  If there is no way except for building from source, is there a (pseudo) package that I can can install that will provide all of the dependencies needed without having to find and install each individually? So that I don't get:  The necessary bits to build these optional modules were not found: _bz2                  _curses               _curses_panel       _dbm                  _gdbm                 _lzma               _sqlite3              _ssl                  _tkinter            readline              zlib Where does gravity get its energy from? I would like to know where gravity gets its energy to attract physical bodies?  I know that the law of conservation states that total energy of an isolated system cannot change. So gravity has to be getting its energy from somewhere, or else things like hydropower plants wouldn't be able to turn the power of the falling water into a spinning rotor.  Just to be clear, Lets create an example:  Lets say we have two objects with equal mass close to each other. So gravity does its job and it pulls each other closer, this gets turned into kinetic energy. This is where I'm lost. According to the law of conservation energy can't be created or destroyed and the kinetic energy comes from the gravitational pull so where does the gravitational pull gets its energy.  If that energy isn't being recycled from some where else then that means you have just created energy, therefore breaking the law of conservation. Do Indian citizens need transit visa for Thailand if going through DMK? I am traveling from Chennai to Don Mueang International Airport, Bangkok, Thailand, and from there to Mandalay, Myanmar. In Bangkok, the layover time is 8 hours. Do I require transit visa? Ubuntu Software not loading categories How do I display PHP code in HTML? This is my attempt to prove that, if $a &gt; 0$, then $\frac{1}{a} &gt; 0$, using just field and order axioms.  $$a &gt; 0 \implies a \cdot \left(\frac{1}{a}\right)^2 &gt; 0 \cdot \left(\frac{1}{a}\right)^2 \implies a \cdot \left(\frac{1}{a}\right)^2 &gt; 0 \implies a \cdot \left(\left(\frac{1}{a}\right) \cdot \left(\frac{1}{a}\right)\right) &gt; 0$$  By associativity of multiplication:  $$\left(a \cdot \left(\frac{1}{a}\right)\right) \cdot \left(\frac{1}{a}\right) &gt; 0$$  We know that $a \cdot \left(\frac{1}{a}\right) = 1$, because one is the multiplication inverse of the other.   So we have:  $$1 \cdot \left(\frac{1}{a}\right) &gt; 0 \implies \frac{1}{a} &gt; 0 $$  Which is what we wanted to prove.   My question are:    In the field axioms, there's no axiom that says that $0$ times another number is $0$, but I have used this property. How would you translate it to field and order axioms? I have assumed that $\left(\frac{1}{a}\right)^2$ is positive, have you noticed? Note that I need a positive number in order not to change the $&gt;$ sign. But this is not present in the field or order axioms. How would you explain this? What is the relationship between size of object with distance? How does the size/length of an object vary with distance?   Is it a logarithmic relationship? exponential? linear?   I plotted a curve of the size/length of an object for different distances from the camera, and the curve looked exponential/logarithmic. I was trying to understand the reasoning behind that. Does the series $\sum\limits_{n=1}^\infty \frac{1}{n\sqrt[n]{n}}$ converge? Does the following series converge? $$\sum_{n=1}^\infty \frac{1}{n\sqrt[n]{n}}$$   As $$\frac{1}{n\sqrt[n]{n}}=\frac{1}{n^{1+\frac{1}{n}}},$$ I was thinking that you may consider this as a p-series with $p&gt;1$. But I'm not sure if this is correct, as with p-series, p is a fixed number, right ? On the other hand, $1+\frac{1}{n}&gt;1$ for all $n$. Any hints ? I've just purchased a new brand laptop with 17 inch size of the screen. I've installed Texmaker and it is messy. The icons are very small and the GUI is not zoomed out automatically to fit the contents of the window. These are pictures         I've already set the size of the icons to medium and the size of apps to 250 (i.e. the recommended size) for  the display.  I'm using Windows 10. Some fonts are blurry and a lot of people are complaining about this problem with no solution from Microsoft. Any suggestions? Consider the Fibonacci numbers $F(0) = 0; F(1)=1; F(n) = F(n-1) + F(n-2)$.  Prove by induction that for all $n&gt;0$,  $$F(n-1)\cdot F(n+1)- F(n)^2 = (-1)^n$$  I assume $P(n)$ is true and try to show $P(n+1)$ is true, but I got stuck with the algebra. How do we reach $P(n+1)$ from $P(n)$? Also, strong induction may be used instead. Why does latex stretch small sections across the whole page vertically? The game  has a very unique intro that I would like to show my friend again for the first time. I'm not sure how to reset all my progress on this game to achieve this though. Any thoughts? How does Cycles work and how is it different from Blender Internal?  Which is better? Assigning strings to arrays of characters I am a little surprised by the following.  Example 1:  char s[100] = "abcd"; // declare and initialize - WORKS   Example 2:  char s[100]; // declare s = "hello"; // initalize - DOESN'T WORK ('lvalue required' error)   I'm wondering why the second approach doesn't work. It seems natural that it should (it works with other data types)? Could someone explain me the logic behind this? Booking travel tickets for visa without paying? On determinants and common divisors Combine multiple results in a subquery into a single comma-separated value I've got two tables:  TableA ------ ID, Name  TableB ------ ID, SomeColumn, TableA_ID (FK for TableA)   The relationship is one row of TableA - many of TableB.  Now, I want to see a result like this:  ID     Name      SomeColumn  1.     ABC       X, Y, Z (these are three different rows) 2.     MNO       R, S   This won't work (multiple results in a subquery):  SELECT ID,        Name,         (SELECT SomeColumn FROM TableB WHERE F_ID=TableA.ID) FROM TableA   This is a trivial problem if I do the processing on the client side. But this will mean I will have to run X queries on every page, where X is the number of results of TableA.   Note that I can't simply do a GROUP BY or something similar, as it will return multiple results for rows of TableA.   I'm not sure if a UDF, utilizing COALESCE or something similar might work? Possible point location algorithm What is the memory layout of a .NET array?  Take for instance this array:  Int32[] x = new Int32[10];   I understand that the bulk of the array is like this:  0000111122223333444455556666777788889999   Where each character is one byte, and the digits corresponds to indices into the array.  Additionally, I know that there is a type reference, and a syncblock-index for all objects, so the above can be adjusted to this:  ttttssss0000111122223333444455556666777788889999         ^         +- object reference points here   Additionally, the length of the array needs to be stored, so perhaps this is more correct:  ttttssssllll0000111122223333444455556666777788889999         ^         +- object reference points here   Is this complete? Are there more data in an array?  The reason I'm asking is that we're trying to estimate how much memory a couple of different in-memory representations of a rather large data corpus will take and the size of the arrays varies quite a bit, so the overhead might have a large impact in one solution, but perhaps not so much in the other.  So basically, for an array, how much overhead is there, that is basically my question.  And before the arrays are bad squad wakes up, this part of the solution is a static build-once-reference-often type of thing so using growable lists is not necessary here.