Computing $H^1(S^3\setminus f(S^1))$
The first homology group $ H_1(E(K); Z) $ of a knot exterior is an infinite cyclic group which is generated by the class of the meridian.
Why is everybody so concerned about etc/passwd? How can you depend on test code from another module in Maven?    Example, I have 2 modules:   Base Main   I would like a test case in Main to extend a base test class in Base.  Is this possible?  Update: Found an , which involves creating a test jar. As the title suggests, I’m simply looking for a method to compute the number of Eulerian Paths in the complete graph $K_5$, where all paths start from the same node. Since there are 5 nodes, all Eulerian paths must be Eulerian circuits as well.  Thanks. What are the different ways I can use to upgrade Ubuntu from one release to another? Programming with Dynamic Within a set of directories, how do I find a file whose name includes a given string, such as "abcde"? When should I use "a" versus "an" in front of a word beginning with the letter h? A basic grammar rule is to use an instead of a before a vowel sound. Given that historic is not pronounced with a silent h, I use “a historic”. Is this correct? What about heroic? Should be “It was a heroic act” or “It was an heroic act”?  I remember reading somewhere that the h is sometimes silent, in which case it’s an, and when the h is pronounced, it’s a. But then I also remember reading that it depends on which syllable is stressed. And I also think I read somewhere that it might differ between British and American English.  Personally, I pronounce the h, and believe that a is correct. I find that it sounds incorrect to use an and pronounce heroic without the h.  So how do I know when to use a and when to use an with a word beginning with the letter h? Are both acceptable or is there one that is correct? How can I select first occurrence between two patterns including them. Preferably using sed or awk.  I have:  text something P1 something content1 content2 something P2 something text something P1 something content3 content4 something P2 something text   I want the first occurrence of the lines between P1 and P2 (including P1 line and P2 line):  something P1 something content1 content2 something P2 something Sort thebibliography by citation order I'm in 17.10. Whenever I touch the screen, whether to change windows/apps, scroll within a browser, or press a button, the stupid little keyboard pops up in the bottom left corner.  I have never left Screen Keyboard enabled in Universal Access, but if I toggle it on, that's the same keyboard popping up in the bottom left corner.    In this screenshot, I'm simply touching the screen in a full-screen youtube video. You can see the menu pop up on the right, under the point where I'm touching.  I don't have a before pic, but it was similar look/color keyboard, but it was smaller, maybe half as wide, and only in the bottom left section of the screen, as opposed to stretching across the entire width. This change from little left-hand keyboard to full-width keyboard happened after following @pomsky 's advice below.    This is a . You can mark yourself affected by it to hopefully increase its received attention. Can I publish a feed of my Meetups to appear on my Google Calendar? I'm a bit of a Meetup junkie so I'd like to automate the appearance of any Meetup I RSVP to automagically appear on my Google Calendar. Why is any pgr_* routing function taking forever based on OSM data in an pgrouting enabled DB Friend can't join world List the files accessed by a program time is a brilliant command if you want to figure out how much CPU time a given command takes.  I am looking for something similar that can list the files being accessed by a program and its children. Either in real time or as a report afterwards.  Currently I use:  #!/bin/bash  strace -ff -e trace=file "$@" 2&gt;&amp;1 | perl -ne 's/^[^"]+"(([^\\"]|\\[\\"nt])*)".*/$1/ &amp;&amp; print'   but its fails if the command to run involves sudo. It is not very intelligent (it would be nice if it could only list files existing or that had permission problems or group them into files that are read and files that are written). Also strace is slow, so it would be good with a faster choice. Integer solutions to the equation $a^3+b^3+c^3=30$ Prove that : $a_n>0$, Then, $\sum_{n=1}^\infty a_n$ converges iff $\sum_{n=1}^\infty \sin(a_n)$ converges. I am given the problem: Let $a_n&gt;0$, prove $\sum_{n=1}^\infty a_n$ converges if and only if $\sum_{n=1}^\infty \sin(a_n)$ converges.  We have this problem in a homework, and I don't believe it can be true. The statement being biconditional implies that when $\sum_{n=1}^{\infty} \sin(a_n)$ converges, so too does $\sum_{n=1}^\infty a_n$, but if we take $a_n=\pi n$ or even $a_n=\pi$, then $\sum_{n=1}^\infty \sin(a_n)$ converges while $\sum_{n=1}^\infty a_n$ diverges. Is my thinking incorrect? How can I move files into subdirectories by count? I have around 100,000 files in a directory. As you can imagine, that's not an ideal situation, and I'd like to split the directory up into subdirectories. But the filenames aren't such where I can put them into subdirectories based on their names or anything, so I'd like to create, say, 10 directories and put about 1000 files in each. Is there an easy bash command or loop that would do this? My friend had hosted a Minecraft server before and brought it back up today with my help. He and anyone in his LAN can connect. However we have had a few people try to connect, including me, and when we try to connect it gives the message:  Failed to connect to the server Connection timed out: connect  What does this exactly mean? How do we fix this? Quite often, the phrase "x for x's sake" is used in English, and so one could describe someone as being "argumentative for argument's sake" to describe someone who is arguing for the sake of arguing.  However, is there an adjective that means the same thing?  For example, it could be used in the context:     I don't want to be [X], but [argument...]   ... indicating that your argument is necessary and not intended to irritate. Possible point location algorithm