I'd like to search for a certain string in all system man pages, but I only want to get a list of the man pages where this text appears.  The first 2 pages of results Google returned do not provide the answer I'm after, if at all such an answer exists.  Let me explain:  I'd like to see all man pages where the word hairpin appears.  I proceed to type man -K hairpin, and the contents that appear are akin to me having typed man nmcli.  When I exit this man page via q, the following then appears on my screen:  --Man-- next: bridge(8) [ view (return) | skip (Ctrl-D) | quit (Ctrl-C) ]   From here, I can continuously type Ctrl+D and eventually return to the command prompt with the following displayed above the prompt:  --Man-- next: bridge(8) [ view (return) | skip (Ctrl-D) | quit (Ctrl-C) ] --Man-- next: lldptool-evb22(8) [ view (return) | skip (Ctrl-D) | quit (Ctrl-C) ] --Man-- next: systemd.network(5) [ view (return) | skip (Ctrl-D) | quit (Ctrl-C) ] --Man-- next: nm-settings(5) [ view (return) | skip (Ctrl-D) | quit (Ctrl-C) ] --Man-- next: nm-settings-ifcfg-rh(5) [ view (return) | skip (Ctrl-D) | quit (Ctrl-C) ] --Man-- next: systemd.directives(7) [ view (return) | skip (Ctrl-D) | quit (Ctrl-C) ]   What I'm asking is, is it possible to get a listing of the man pages where hairpin appears such as below?:  man -&lt;some-option&gt; -K hairpin nmcli(1) bridge(8) lldptool-evb22(8) systemd.network(5) nm-settings(5) nm-settings-ifcfg-rh(5) systemd.directives(7)   Edit: Searching Google using a sentence doesn't always return the results where the specific query is addressed.  This is obviously the case for this question, as pointed out by several that it is indeed a duplicate.  However, it would be best not to delete it as it shows the specific output returned on Ubuntu systems.  A user on Ubuntu may benefit from this question.  Edit 2: Searching for skip (Ctrl-D) now has this question appearing in the first page of Google results where previously nothing was returned!
Sometimes I need to look up certain words through all the manual pages. I am aware of apropos, but if I understand its manual right, it restricts search to the descriptions only.     Each manual page has a short description available within it. apropos searches the descriptions for instances of keyword.   For example, if I look up a word like 'viminfo', I get no results at all...  $ apropos viminfo viminfo: nothing appropriate.   ... although this word exists in a later section of the manual of Vim (which is installed on my system).      -i {viminfo}                When  using  the  viminfo file is enabled, this option sets the filename to use, instead of the default "~/.vim‐                info".  This can also be used to skip the use of the .viminfo file, by giving the name "NONE".    So how can I look up a word through every section of every manual?
How to add USB 3.0 port to your laptop Finding the left and right cosets of H = {(1), (12), (34), (12) ○ (34)} in S4 I have an exercise where I am supposed to find the left and right cosets of H = {(1), (12), (34), (12) ○ (34)} in S4. But how do I generate the cosets? As I have understood it you are supposed to pick a number that is not in the set H and multiply it with every number in H. But this does not exactly give the right answer. I would really appreciate it if someone gave an easy to understand explanation of how to generate the left and right cosets. I am struggling to find such languages $L_{1}$, $L_{2}$, and $L_{3}$ such that  $$ L_{1} \subseteq L_{2} \subseteq L_{3} $$ where $L_{1}, L_{3} \notin  \mathbb{R}$ and $L_{2} \in  \mathbb{R}$.  I know they exist, I need help finding them. How to find and replace a string by increasing its numerical part? Is there any rule for differentiating between the endings "th" and "ht"? Some words end in th (length, width), and others end in ht (height, fight, tonight, caught).    I sometimes have difficulties in spelling such words because I don't know which ending to choose. Is there any rule or pattern (even localized) in choosing one or the other? Transforming positively skewed data with positive and negative values My data (see image below) is positively skewed and contains both positive and negative values. I'd like to transform it to achieve normality so I can apply a repeated measures ANOVA, but can't find a technique that works.  I've considered the following options:   Square-rooting: doesn't keep the sign Square-rooting then making the original negative values negative: makes my data bimodal Natural log transform: can't do this with negative values Add a constant then log transform: this arbitrarily leaves my lowest value as an outlier '' transform (Cox, 2005; also Whittaker et al. 2005): makes my data bimodal Outlier removal (2.5 SD): doesn't fix normality, but an ANOVA on this data has similar results to an ANOVA on the raw data (for better or worse). Perform the non-parametric equivalent (Friedman test) and compare the results: will do this today   My supervisor suggests I should stick with the outlier removal though the data is still visibly skewed, and 'see what the reviewers suggest' but I just wanted to check here in case there was anything I was missing.  Original data:    With outliers (2.5 SD) replaced with the value at that criterion. I later decided to just exclude the outliers, so imagine the highlight data points in each condition removed. Should I vary input field lengths in a single page checkout form? A man sits on a bench considering his woeful burden. He looks up at the stars and compares the distance from here to his house and here to the furthest visible star Deneb. Suddenly his problems seems pitifully faint and untroubling. He laughs and relaxes in his seat, staring at the ducks.     Look again at that dot. That's here, that's home, that's us. On it everyone you love, everyone you know, everyone you ever heard of, every human being who ever was, lived out their lives. The aggregate of our joy and suffering, thousands of confident religions, ideologies and economic doctrines, every hunter and forager, every hero and coward, every creator and destroyer of civilization, every king and peasant, every young couple in love, every mother and father, hopeful child, inventor and explorer, every teacher of morals, every corrupt politician, every "superstar," every "supreme leader," every saint and sinner in the history of our species lived there—on a mote of dust suspended in a sunbeam.   ~Carl Sagan      I really believe that if the political leaders of the world could see their planet from a distance of 100,000 miles their outlook could be fundamentally changed. That all-important border would be invisible, that noisy argument silenced. The tiny globe would continue to turn, serenely ignoring its subdivisions, presenting a unified façade that would cry out for unified understanding, for homogeneous treatment. The earth must become as it appears: blue and white, not capitalist or Communist; blue and white, not rich or poor; blue and white, not envious or envied. ~Michael Collins, astronaut   I'm looking for a noun or verb that describes this positive enlightening experience. What do Android application permissions mean? When installing an application, the application lists permissions that it needs to perform its  functions.    I am creating this list of the the system defined permissions and a description of what they mean. It is a community wiki so if new permissions are added in the future they can be added to this list. How to organically merge nested associations? What dried food can I take across the American border from Canada? On my Windows 7 system I installed via  from Fonts.com:   The font does not appear in C:\Windows\Fonts. However, it shows up in certain desktop applications, for example  as: Sabon Next Com Display  My intention was to use the font in a LaTeX document test.tex:  \documentclass{article} \usepackage{polyglossia} \setromanfont{Sabon Next Com Display}  \begin{document} Hello World! \end{document}   Unfortunately, xelatex test.tex fails:  […] Couldn't find `Sabon Next Com Displ.cfg' miktex-maketfm: No creation rule for font "Sabon Next Com Display".   !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! ! ! fontspec error: "font-not-found" !  ! The font "Sabon Next Com Display" cannot be found. !  ! See the fontspec documentation for further information. !  ! For immediate help type H &lt;return&gt;. !...............................................    l.4 \setromanfont{Sabon Next Com Display}                                            % Sabon Next Com Display, SabonNex...  ?    Can XeLaTeX even work with fonts installed via SkyFonts? If not, what could be a workaround? Is is possible to restore the MFT of a NTFS partition after a format? Pie Chart without labels in beamer using pgf-pie This is more of a panic question after reading reviews on Istanbul Atatürk Airport. They said it's messy and hard to navigate, therefore I'm asking questions here in name of my girlfriend who will need to transit through this airport.  My girlfriend (Canadian national) traveling from Toronto (YYZ) to Istanbul (IST) for a couple hours (~4 hrs, so transiting) in order to come to Pristina (PRN). I would like a quick guideline on how to pass through this airport seamlessly without facing any trouble or delay.  Her tickets are both with Turkish Airlines. She purchased it via a third party (Flighthub.ca). It's only one booking and it includes both flights in it.   Once my girlfriend departs, she's obviously required to follow the signs and go to the transit area. Once she's there, will she be required to present a ticket? Where does she get that ticket? Does she get it in YYZ or does she need to visit a counter in IST and get it? After she's got the proper ticket, what does she need to do exactly? Wait in line to have her passport checked? Will they also control her carryon?  After this step, does she simply go to the PRN flight gate and that's it?   We're simply worried about Istanbul Atatürk Airport because of the recent things that happened in Turkey (coup attempt and ISIS attack) and she doesn't wanna somehow end up locked up there. I've read that the airport is a mess lately and a lot of people will be there waiting in line. So, another question: Are 4 hours enough?  I would appreciate a step by step guideline on how she needs to navigate and what she needs to do in that airport to have a smooth experience without facing any delays. Also some misc information on Istanbul Atatürk Airport would be appreciated. Close vote review audit is broken - displays "on hold" while reviewing I just reviewed this:    But while reviewing, it already displays the "put on hold as not a real question" section, and it asked:     Should this question be closed as: ?   So as it stands, the audits are broken, since we already know that the question is "on hold" while reviewing, and it is incredibly hard to miss the huge grey box at the bottom.  Another with screenshot: I have been attempting this problem for a while, it is an assignment problem so I don't want somebody to just post the answer, I'm just looking for hints.  Let $\mathfrak{u}(n,\mathbb{C})$ be the Lie algebra of strictly upper triangular $n\times n$ matrices over $\mathbb{C}$.  I am trying to show that $\mathfrak{u}(n,\mathbb{C})$ is a nilpotent Lie algebra for $n\geq 2$.  This is what I have looked at so far.  I have done some explicit calculations (I shall omit the bulk of them and just summarise below) for $n=2,3,4$ and have come up with some ideas.  Let $L=\mathfrak{u}(n, \mathbb{C})$.  If $n=2$,  $L^1 = [L, L] = &lt;0&gt;_{\mathbb{C}}$  So $L$ is nilpotent.  If $n=3$,  $L^1 = [L, L] = &lt;e_{13}&gt;_{\mathbb{C}}$  $L^2 = [L, L^1] = &lt;0&gt;_{\mathbb{C}} = \left\{ 0 \right\}$  So, $L$ is nilpotent.  If $n=3$  $L^1 = [L,L] = &lt;e_{13},e_{14},e_{24}&gt;_\mathbb{C}$  $L^2 = [L,L^1] = &lt;e_{14}&gt;_{\mathbb{C}}$  $L^3 = [L, L^2] = &lt;0&gt;_{\mathbb{C}} = \left\{ 0 \right\}$  So, $L$ is nilpotent.  So my hypothesis so far is that for an arbitrary $m\in\mathbb{N}$, $L^{m-1}=\{0\}$  My instinct is to do this by induction. My base case, $n=2$ has already been shown. Now I assume that $\mathfrak{u}(n,\mathbb{C})$ is nilpotent for $n=k$ ($k\in\mathbb{N}$) and consider the case for n=k+1.  However, I have no idea how to link these two cases together. I have read in Introduction to Lie Algebras and Representation Theory - J.E. Humphreys that $L^k$ should be spanned by basis vectors $e_{ij}$ where $j-i=k+1$ - however in my calculations for $L^1$, I obtain an $e_{14}$ which does not satisfy 4-1=2.  Am I missing something completely obvious? Or have I made a mistake somewhere? (I have checked my calculations numerous times, but cannot find any errors!)  Thanks,  Andy. How can I prove that     $$1^3+ 2^3 + \cdots + n^3 = \left(\frac{n(n+1)}{2}\right)^2$$    for all $n \in \mathbb{N}$? I am looking for a proof using mathematical induction.  Thanks The Windows Domain I manage has hundreds of computer names which I don't recognise and I'd like to remove old ones which aren't in use before trying to track down the misnamed ones.  Is there someway to see when the last time a machine logged onto the network? Either via dhcpd or a user login event or something else. When trying to execute a symbolic link which points to an exe file (on Windows 7), the "Open with" windows appears. When renaming it to a ".exe" file, it says "The specified path does not exist. Check the path, and then try again.".  Symlinks to other destinations seem to work fine.  So is there any way to execute a symlink?  EDIT: In the command prompt, I execute the following and the MyProgram.exe runs both times.  However, if I double-click on the symbolic link in Windows Explorer it fails with the above error message.  C:\Temp&gt;mklink SomeProgram.exe MyProgram.exe symbolic link created for Backup.exe &lt;&lt;===&gt;&gt; Backup-1.0.1.exe  C:\Temp&gt;SomeProgram.exe  C:\Temp&gt;del SomeProgram.exe  C:\Temp&gt;mklink SomeProgram.exe C:\Temp\MyProgram.exe symbolic link created for Backup.exe &lt;&lt;===&gt;&gt; C:\Temp\Backup-1.0.1.exe  C:\Temp&gt;SomeProgram.exe