Find the least divergent points between a Git repo and a CVS repo
Finding where source has branched from git
I know that SZ0 makes vertices straightened on the z-axis, but I'm wondering if there's a way to make vertices into a complete circle on the z-axis with a hotkey? How to end paragraph text in an inverted pyramid shape? In many old books, the final paragraphs of chapters end in an inverted pyramid shape, like this:    I think this is beautiful, so I would like to imitate this for my book. I've found the code for a triangle in this post   \documentclass{article} \usepackage{microtype,shapepar}  \def\triangleupshape{% {0}% {0}b{0}\\% {8.66}t{-5}{10}\\% {17.32}t{-10}{20}\\% {17.32}e{0}% }      \begin{document} \shapepar{\triangleupshape}A ipsum dolor sit amet, consectetuer    adipiscing elit, sed diam nonummy nibh euismod tincidunt ut laoreet dolore magna aliquam erat volutpat. Ut wisi enim ad minim veniam, quis nostrud exerci tation ullamcorper suscipit lobortis nisl ut aliquip ex ea commodo consequat. Duis autem vel eum iriure dolor in hendrerit in vulputate velit esse molestie consequat, vel illum dolore eu feugiat nulla facilisis at vero eros et accumsan et iusto odio dignissim qui blandit praesent luptatum zzril delenit augue duis dolore te feugait nulla facilisi. Lorem ipsum dolor sit amet, consectetuer adipiscing elit, sed diam nonummy nibh euismod tincidunt ut laoreet dolore magna aliquam erat volutpat. \par \end{document}   Which results in this:    But I'd like it to be inverted and the first part of the paragraph need to be full line width. Only the last few lines should end in an inverted pyramid like in the example above.  Is there a way to do this? Thanks in advance for your help. Computational complexity of Fibonacci Sequence Best way to implement keyboard shortcuts in a Windows Forms application? sum of polynoms of given property How does equality $\mathfrak{m}^\mathfrak{m} = 2^\mathfrak{m}$ in $\sf{ZF}$ relate to the axiom of choice? Usually, the equality $\mathfrak{m}^\mathfrak{m} = 2^\mathfrak{m}$ for infinite cardinal $\mathfrak{m}$ is proved like that: $$ 2^\mathfrak{m} \leqslant \mathfrak{m}^\mathfrak{m} \leqslant (2^\mathfrak{m})^\mathfrak{m} = 2^{\mathfrak{m} \cdot \mathfrak{m}} = 2^\mathfrak{m} $$ The last step relies much on the axiom of choice, because the fact $\mathfrak{m}\cdot\mathfrak{m} = \mathfrak{m}$ does. Moreover,  states that in $\sf{ZF}$ this fact is equivalent to $\sf{AC}$.  Note, by a cardinal I mean an equipollence class of an arbitrary set, not necessarily admitting a well-ordering.  That has motivated my question: what can we say about relationship of the initial equality and the axiom of choice in pure $\sf{ZF}$?    To avoid question about definition of cardinals without $\sf{AC}$, we may consider the following statement instead:     For any infinite set $X$ exists a bijection $\; F \, \colon X^X \rightarrow 2^X$   where $X^X$ is the set of all functions from $X$ to $X$, $\; 2^X = \mathcal P(X)$ is the power set, and an infinite set is such that cannot be bijectively mapped onto a finite ordinal. Show that some monomial ideal is primary Show that $I=(X_{k_1}^{a_1},...,X_{k_s}^{a_s})$ is $(X_{k_1},...,X_{k_s})$-primary.   I noticed  that $$\sqrt{({X_{i_1}}^{a_1},...,{X_{i_k}}^{a_k})}=\sqrt{({X_{i_1}}^{a_1})+\cdots+({X_{i_k}}^{a_k})}=\sqrt{\sqrt{(X_{i_1})^{a_1}}+\cdots+\sqrt{(X_{i_k})^{a_k}}}=\sqrt{(X_{i_1})+\cdots+(X_{i_k})}=\sqrt{(X_{i_1},...,X_{i_k})}=(X_{i_1},...,X_{i_k}).$$ I have to show that $I$ is $P$-primary (where $P=(X_{k_1},...,X_{k_s})$), i.e., if $u v\in I$ then $u\in I$ or $v\in P$. I tried to prove that if $u\notin I$ and $v\notin P$ then $uv\notin I$. (There is a similar question, but the answer is too hard for me.) While all the Hobbits I can think of have a combination of first- and lastname (e.g., Bilbo Baggins, Peregrin Took, the Sackville-Baggins's,...), I can't think of any character* of another race that has a lastname:   Men seem to like to add a reference to their ancestors (e.g., Aragorn, Arathorn's son or Isildur's heir) Dwarves seem to like descriptive or honorary names (e.g., Thorin Oakenshield, Dain Ironfoot). They are not lastnames though, since they do not get passed on to descendants. Elves don't have a need for lastnames, since elvish names are unique. Some nevertheless seem to have an additive (e.g., Legolas Greenleaf). Likewise, I can't find any usage of lastnames among Ents, Eagles, Istari, Orcs, trolls,...   But why would a society that is quite rural and not a leader of modernization be the only one to use a modern naming system with first- and lastnames?  *Except for Tom Bombandil. But he is, well, "special". What is a word/idiom for 'unable to decide'? Let's say I have an important decision to make and I can't decide between two competing things (like break up with a girl or not break up with her). What would be a word/idiom to express that? Can I sync bookmarks between Firefox and Chromium? So, Firefox has turned so resource intensive that my netbook can't run it without making me want to pull my hair out. Thus, I have been trying Chromium with quite some success (I have managed to find proper equivalents for my firefox plugins), the only thing I'm lacking is my bookmarks, which are stored in my Firefox Sync account. Point is I don't want to use Google Bookmarks, mostly because of the whole thing with encryption.  Is there any way to use Firefox Sync with Chromium?, or is there any secure alternative? How can one securely generate an asymmetric key pair from a short passphrase? Background info: I am planning on making a filehost with which one can encrypt and upload files. To protect the data against any form of hacking, I'd like not to know the encryption key ($K$) used for a file, so the user will have to asymmetrically encrypt $K$ and send it as well. The reason for this double encryption is that you can still share (individual!) files with other accounts by encrypting $K$ with the public keys of those users, too.  My problem is: How can a user can get a public and private key without the server saving/knowing the private key and without the user having to remember a passphrase of 250 hex characters?  Question: Is there a way to derive a key pair from a password, like PBKDF-2 does for symmetric encryption? Suggestions on rearranging the cryptographic steps in an easier way are welcome, too.  Alternatively: It is also possible to encrypt the private key with a PBKDF-applied password and store it on the server, but I'd like to keep things 'simple'. ;)  Note: At this point I don't care if it requires RSA, ECC or an obscure cryptography scheme. How do I paste into the Windows CMD prompt by using only the keyboard? My current technique is to right-click in the command prompt and then click paste.  This bugs me - is there a better way? How do I get "restart" option in the shutdown menu in Unity? The dropdown menu I get when I click on the gear link in the top right corner only shows these options:   Lock Computer Logout Suspend Hibernate Shutdown   There is no "restart" or "reboot".  How can I make that option available?  Bonus question: Can I remove Hibernate, Lock, and Suspend? Extracting only the BibTex records relevant to the paper My colleague asked me to write a page for a paper he writes. I wrote the page in LyX, compiled it to LaTeX, and sent him the TeX files. Then he reminded me that I forgot to send the .bib file with all the references.  But, my .bib file is huge - it contains over 1000 references (I have a global BiBTeX file for all my papers). The page I wrote uses only about 20 of them.  Is there an automatic way to extract from the bib file, only the records relevant to the current paper? How do you display the archives of a Custom Post Type by Year &amp; Month? Does OpenSSH support multihop login? Ansible uses OpenSSH as the bottomed network communicative implementation, but does it support multi-hop login?   I mean, if Ansible can login a server directly, but can it log in server_a then from server_a login server_b for config the server_b? How do I show that $\sum_{cyc} \frac {a^6}{b^2 + c^2} \ge \frac {abc(a + b + c)}2?$ Let $a, b, c$ be positive real numbers, show that  $$\frac {a^6}{b^2 + c^2} + \frac {b^6}{c^2 + a^2} + \frac {c^6}{a^2 + b^2} \ge \frac {abc(a + b + c)}2.$$  I think this is likely to turn out to be proved by Hölder, but I can't see how. Any hints will be appreciated. Not packages and not all applications. Just the applications user installed by himself from whatever source (Software Center, manually added PPA, etc.). If the above is not possible - a list of all installed applications or at least a GUI which lists the applications so I can take screenshots of it.  I've read a dozen of similar questions and people posting answers usually don't even get close to OP question merit. Please note that my question includes 'user installed'.   Answer: It is not currently possible in Ubuntu Linux.  (choosing tijybba's answer as the closest one though) Find the smallest value of $c$ such that $(1-x)\ln(1-x)+(1+x)\ln(1+x)\leq c x^2$ holds for $0&lt;x&lt;1$.   I saw the curve and realized this is true for $c=2$. How can I prove it? What is the smallest $c$ that still makes the inequality valid?  I think we should use the Taylor expansions of the $\ln$s. Projectile/orbital motion over very long distance We know the optimum angle for greatest horizontal displacement when launching an object with projectile motion is 45 degrees.  How to solve the angle when it is real long distance around the earth where we cannot assume that gravity is constant but is given by $F=\frac {-GMm}{r^2}$. I use differetial equation to solve it and obtain 45 degrees.   First, for the vertical distance $y$, change $v=u-gt$ to $y'=u-y''t$. Then solve it to obtain a function $y(t)$. When $y'(t)=0$ we have the time for maximum vertical distance. Then insert the value to horizontal equation.   Can anyone guide me through this problem because I am not confident with my working