Convert datetime.timedelta Object to HH:MM
Format timedelta to string
So, to explain the title, I'm referring to the necessity of the axiom of choice in the existence of a well ordering on reals, or any uncountable set.  Now, while tweaking some sets, I came across this :  We start with the natural numbers, $N$. We take the power set of the naturals, $P(N)$.  Then we remove all the finite subsets of $N$ from $P(N)$. Let us call this new set $S$. This set is the set of all infinite subsets of $N$.  It is easy to show that $S$ has uncountable cardinality, same as that of real numbers. This is because the removal of finite subsets only removes a countable number of elements. (Haven't posted this deduction, for it is very easy, but I may post it if it is not so evident)  Now, we seek to find an ordering on the set $S$. Every set in this set is an infinite subset of natural numbers, so each of these sets are well ordered by the natural ordering of $N$.  Taking any two sets in $S$, say $A$, and $B$, we seek to order them by checking their elements lexicographically. We compare the first two elements in $A$, and $B$. Let them be $a_1$, and $b_1$ respectively. If $a_1 = b_1$, then we move on to the second elements in the sets, $a_2$, and $b_2$, and so on. If, at any point, $a_n &lt; b_n$, then $A &lt; B$, or if $b_n &lt; a_n$, then $B &lt; A$.  This order seems to be a well ordering of the uncountable infinity of reals. I don't seem to have invoked the axiom of choice anywhere in the construction of this set $S$.  So, why isn't this a well ordering on the uncountable of reals? I've recently searched how I could get the application's directory in Java. I've finally found the answer but I've needed surprisingly long because searching for such a generic term isn't easy. I think it would be a good idea to compile a list of how to achieve this in multiple languages.  Feel free to up/downvote if you (don't) like the idea and please contribute if you like it.  Clarification:  There's a fine distinction between the directory that contains the executable file and the current working directory (given by pwd under Unix). I was originally interested in the former but feel free to post methods for determining the latter as well (clarifying which one you mean). Whole disk unallocated? Gparted error or partition overlapping? Java Enum definition I checked this  but didn't fully understand it.   I know that the volume of a right circular cone is $V = \frac{1}{3}\pi x^2h$  I know that I must take the first derivative and set it equal to zero, which will find the maximum.   My problem is how to deal with the variable $h$, the height?   How can I rewrite that in terms of $x$ or $r$.      I have tried to implicitly differentiate this equation, but that wasn't helpful for me. Evaluate the line segment intergal Evaluate the line integral  $$\int_C xe^{y}\, {\rm d}s,$$  where $C$ is the line segment from $(-1,2)$ to $(1,1)$.  I do not get this part of calculus at all please show me how this is solved and if you give me hints is ok too. Please help me. Thanks 2.5 GB usable out of 4 GB of ram Why is there a peeking duck in my profile pic? Align equation left Structure of ideals in the product of two rings $R$ and $S$ are two rings. Let $J$ be an ideal in $R\times S$. Then there are $I_{1}$, ideal of $R$, and $I_{2}$, ideal of $S$ such that $J=I_{1}\times I_{2}$.  For me it's obvious why $\left\{ r\in R\mid \left(r,s\right)\in J\text{ for some } s\in S\right\}$ is an ideal of $R$ (and the same for $S$) so I can prove $J$ is a subset of the product of two ideals and also that the product of these two ideals is an ideal. But I can't see how to prove equality without assuming existence of unity or commutativity. Trying basically to show that if $\left(r,s\right)\in J$ then also $\left(r,0\right),\left(0,s\right)\in J$. Thank you for your help! deleting windows system folder I want to use an old drive as a secondary hard drive without reformatting. But this old hard drive contains my old Vista installation which takes up gigs of space.  I tried changing ownership and it works to some extent but I can not delete anything in Windows/System32 folder.  Is there an easy way to change permissions so I can delete everything?    The solution is to use Takeown as Wil suggested and use cacls to take full control of the files. Since cacls doesn't seem to be recursive, I fired up cygwin and ran this command to recursively change all the files:  for d in $(find directory-of-interest -type d);do   cacls $d'/*' /e /G username:F; done   where directory-of-interest is in my case /cygdrive/g/Windows and username is my username.  I had to manually run it on directories that had spaces in its name. But after all this, I can now delete the directory. Warning: it seems to me that cacls can potentially royally screw things up if improperly used. Should Suggested Edits change the technical content of a post? I have noticed a significant number of suggested edits that attempt to fix code, or change the original meaning of someone else's post.    Is this really a good idea?    I've been on StackOverflow awhile, and among the editors who have sufficient reputation to edit without approval, I've never seen anyone modify the technical content or meaning of someone else's post.   I would consider obvious syntax and spelling errors OK to change, but I have seen many suggested edits that change the meaning of the code that was posted, or add things to the code that have nothing to do with the original question. A good example of this would be adding parameters to a SQL command, when the question was not asking about SQL injection. We can prove that there is no integer $n&gt;1$ such that $2^n-1\mid 3^n-1$. This leads to the following question:     Is it true that for every pair of primes $p&lt;q$ there are only finitely many integers $n$ such that $p^n-1\mid q^n-1$? Are there two primes $p&lt;q$ and an integer $n&gt;p+q$ such that $p^n-1\mid q^n-1$?Is it true that if $n&gt;6$ then $2^n-1\nmid 5^n-1$?   Edit: Here are some examples: \begin{array}{ll} 2^{36}-1\mid 41^{36}-1, &amp;3^{12}-1\mid 97^{12}-1,\\ 5^{6}-1\mid 37^{6}-1, &amp;7^{4}-1\mid 151^{4}-1. \end{array}  Now I prove there is no integer $n&gt;1$ such that $2^n-1\mid 3^n-1.$  Proof: Denote $A=2^n-1$ and $B=3^n-1$. If $n$ is even then $3$ divides $A$ but not $B$, a contradiction.  If $n$ is odd then $A\equiv -5\pmod {12}$. Since every prime greater than $3$ is $\equiv \pm1,\pm5 \pmod {12}$, some prime factor $p$ of $A$ must be congruent to $\pm5 \pmod {12}$. As $p \mid B$, we have $3^{n+1}\equiv 3 \pmod p$. Since $n+1$ is even, we get $(\frac{3}{p})=1$, a contradiction again. How to enable the Edit button in Shutter? I am trying to enable the Edit button in Shutter. I installed the application from Ubuntu Software and are using Ubuntu 18.04.  After taking a screenshot the Edit button is disabled. And when hovering the mouse pointer over the button the text "Goo::Canvas/libgoo-canvas-perl needs to be installed for this feature" is shown.    I have tried to install the package libgoocanvas2-perl and restarted the computer, but the edit button is still not enabled:  sudo apt install libgoocanvas2-perl   That is the only package I can find.  Anyone that knows how to fix this? I did apt-get upgrade it never finishes at this point:  Searching for GRUB installation directory ... found: /boot/grub Searching for default file ... found: /boot/grub/default Testing for an existing GRUB menu.lst file ... found: /boot/grub/menu.lst Searching for splash image ... none found, skipping ... Found kernel: /boot/vmlinuz-3.2.0-24-virtual Updating /boot/grub/menu.lst ... done  You already have a NoLOADER configuration in /etc/grub.conf Running boot loader as requested Running /usr/sbin/grub  ...    The system does not freeze (Ctrl-Z works, I get my console back) just that that /usr/sbin/grub seems to never complete.  What should I do? More often that I like to admit I look for a file that contains some strings.  Currently I do:  grep -rl string1 | xargs grep -l string2 | xargs grep -l string3   Is there a tool that does this prettier?  This greps for string1 or string2 or string3.   grep -rl -e string1 -e string2 -e string3   I want files that contain string1 and string2 and string3 but not necessarily on the same line.  Maybe one of the modern greps (ag/ack/rg/sift) can do this? Is the axiom of choice used in the proof that every open set is the union of basis elements (Mukres, Lemma 13.1) What are metaclasses in Python? how to make winforms webbrowser control to work very similar to targeted Internet explorer How do I rename a domain and preserve SEO? As part of graduating from Area51 and becoming a full fledged site we sometimes change domain names from http://topic.stackexchange.com to http://example.com. Aside from the obvious 301 redirect rules to support existing urls transparently, are there other techniques that would aid in the preservation of SEO?