Say I have two files (file1.txt &amp; file2.txt).  file1.txt: (contains only list of words, one per line)  Car Ricky   file2.txt: (contains lines (phrases) using words from file1.txt and more)  he has a Car there is no food I have a book road is straight Ricky is a good student   The output should be:  he has a Car Ricky is a good student
Does anyone know of any linux tool specifically designed to treat files as sets and perform set operations on them? Like difference, intersection, etc?
How to determine callee function name in a script To make it short, doing something like:  -bash$ function tt {  echo $0; }  -bash$ tt   $0 will return -bash, but how to get the function name called, i.e. tt in this example instead? Custom Adapter for List View I faced a problem to answer a negative question, for example, when someone asks you:      Don't you have any money?   It's a yes/no question but how should one answer the question without ambiguity?  When you answer "yes", does it mean "yes, I don't have any money"? or the other way "Yes, I do have money"? the questioner may think you are agreeing to the negative, that yes, you do not have any money.  I know it's better to answer with "on the contrary" but is it possible to answer yes or no? What is the difference between using a colon and a semi-colon to join two sentences? I've seen a few questions on this site relating to semi-colons, which I believe I correctly understand, but what I'm not as clear about is colons.  For example:     The man ate the apple; it tasted good.   Is this not correctly also written as:     The man ate the apple: it tasted good.   In this case, what is the difference between the two sentences? Casting a Somatic, non-Material spell while holding a focus In  a side issue came up of whether you can cast a spell with Somatic components but no Material components while holding a focus in the hand used for Somatic components.  My reading of the rules sees "A spellcaster must have a hand free to access a spell's material components--or to hold a spellcasting focus--but it can be the same hand that he or she uses to perform somatic components." - it doesn't say you have to be holding the focus for the purpose of avoiding materials.  However, @Adeptus and @enkryptor argue that - since that rule is in the section on Material components - you don't consult it in for spells without Material, and fall back to the Somatic rule "the caster must have free use of at least one hand".  (I also appeal to the logic of fluff - why should it be harder to cast a spell with fewer components?)  Is there an official RAW or Word Of God on this matter? Can you cast a material-less, somatic spell while holding a focus in your only free hand? Is there an easy method for installing binary builds of glibc? Time and time again I see questions such as these:       And these are the types of solutions we're typically pushing:        Is this really the best we can do? Aren't there binary builds of GLIBC that we can simply unzip into a directory such as /opt/myglibc, and set the $LD_LIBRARY_PATH or whatever and run whatever application we want, without issues?   An application, such as the newer builds of Chrome (28+) that appear to require GLIBC 2.14?  NOTE: This thread titled:  on tecmint.com is what ultimately got me thinking about this.  References Express the complex numbers given in Problem in the form $a+ib$ Difference between >> and >>> in verilog? What is the difference between &gt;&gt; and &gt;&gt;&gt; in verilog/system verilog? I know that == tests for only 1 and 0, while === tests for 1, 0, X, Z. So how is that similar to the shift operator? Learning development with Force platform. Any good books? I'm a bit familiar with Java and SQL, any good books to get on coding in Apex for salesforce? What is the highest power of n in $(n^r-1)!$ where $n$, $r$ are positive integers? The answer supplied is $\frac{n^r-nr+r-1}{n-1}$   The highest power of $n$ in $n^r!  = r +$ the highest power of $n$ in $(n^r-1)!$ as $n^r$ contributes $r$ powers.    So,  the highest power of $n$ in $n^r!$ needs to be $\frac{n^r-nr+r-1}{n-1} + r =\sum_{1≤t&lt;r}n^t $.    This is clearly true if $n$ were prime according to .  Again,  if $r=1$, $\frac{n^r-nr+r-1}{n-1}$ becomes $0$.    But according to , the  highest power of composite $n$ in $(n-1)! ≥ 1 $.  So, the answer does not seem to hold for $r=1$ if $n$ is composite. If $n=\prod p_i^{a_i}$, where $p_i$ are distinct primes,  $n^r=\prod p_i^{ra_i}$  So, the highest power $(q_i)$ of $p_i$ in  $n^r!$ is  $$\sum_{1≤t&lt;∞}\left\lfloor\frac{n^r}{p_i^t} \right\rfloor =\sum_{1≤t≤ra_i}\frac{n^r}{p_i^t} +\sum_{ra_i+1≤t&lt;∞}\left\lfloor\frac{n^r}{p_i^t} \right\rfloor$$  as $p^t|n^r$ for $t≤ra_i$.  So, the highest power of $p_i^{a_i}$ in  $n^r!$ is $\left\lfloor \frac{q_i}{a_i} \right\rfloor=P_i$(say).   So, the highest power of n=$\prod p_i^{a_i}$ in  $n^r!$ is $min(P_i)$  I could not proceed anymore. Is it possible to retrieve a previous un-evaluated, un-normalized input? I'm working through Rotman (1994). It's the 2nd chapter where my curiosity lead me to a question that is not from the book. Here's the problem that inspired the question:      2.8. Imbed $S_n$ as a subgroup of $A_{n+2}$, but show, for $n\ge2$, that $S_n$ cannot be imbedded in $A_{n+1}.$    Since the alternate subgroup has the property of even parity, I thought that a little investigation of parity for the second and third symmetric groups was in order. So I constructed a table for each of them, grouped by even and odd number of disjoint products.   I'll forego writing the actual table and simply provide the answers. In symmetric groups with an even idegree, two even permutations come together under composition to produce an even permutation. Two odds also make an even. Two different parities produce odd elements.   When the symmetric group has an odd degree, e.g. $S_3$, two odds make an odd, two evens make an odd, and two different parities make an even element. Exactly the opposite results from the symmetric groups with even index.   Two questions: is this enough to prove the $A_{n+1}$ case? And can this be generalized modulo 2 e.g. $A_{2n+1}$? I want to type Arabic text in Photoshop, but the text appears disjointed and the letters do not connect at all. For example محمد appears as م ح م د.   I'm using Photoshop CS6 on OSX Mountain Lion. TV series from 70s or 80s - 1 female pilot was cloned from the other pilot's fingernail This was a tv show that aired in the US in the '70s or early '80s, possibly on Saturday mornings. Since I was a child, I'm assuming it was a kids program? It was comic science fiction and set on a spaceship. The only 3 specific details I remember are:   The crew traveled between ship levels by using open "jump tubes" that were similar to a giant vacuum tube message system, only without any "container" for the passenger. They just stepped into an alcove with a big hole in the floor and ceiling, then shot up or down. Frequently the show would use this as a source of slap-stick comedy.  The captain was male. The 2 pilots were female, and 1 had been cloned from the other's fingernail cell. They often disagreed about which one was the clone. I know how to detect when resistors are arranged in parallel or series arrangement and I can also find their equivalent resistance in simple circuits or when resistances are connected in form of triangle but what happens when the arrangement is complex like this :   Which resistors are parallel and which are in series ? How can I find the equivalent resistance in such cases ? Is there rule or method for figuring this out ? Find $\lim\limits_{x \to \infty} \frac{x}{(\log{x})^n}$ Find $\displaystyle \lim_{x \to \infty} \dfrac{x}{(\log{x})^n}$.   My book says that $\displaystyle \lim_{x \to \infty} \dfrac{(\log{x})^n}{x} = \lim_{y \to \infty} \dfrac{y^n}{e^y} = 0$, but I don't see how that is true. When you cast invisibility on your turn, and walk away from 2 enemies, do they get an attack of opportunity? When a PC is in melee with a creature, casts the basic invisibility spell, and leaves melee, does an NPC get an attack of opportunity? I have Ubuntu 12.04 installed on my PC, recently I have edited /etc/passwd  and changed  user1:x:00:00:user1,,,:/home/user1:/bin/bash   to give root permission to user1 and the system always need to login as root, for running some custom software.  Now it seems the sound is not working, the volume icon is disabled. I understand that the pulseaudio demon can't be run as root that's why the audio is not working. How can I resolve it, like set the permission of pulseaudio to run as root.   When I type the command    /usr/bin/pulseaudio --start   Giving me the output  W: [pulseaudio] main.c: This program is not intended to be run as root (unless --system is specified). E: [autospawn] core-util.c: Home directory /home/user1 not ours. W: [autospawn] lock-autospawn.c: Cannot access autospawn lock. E: [pulseaudio] main.c: Failed to acquire autospawn lock   Edit   Solution for problem:  I have fixed the problem by disable root checking for pulseaudio equalizer  sed -i 's/exit 1/#exit1/g' /usr/bin/pulseaudio-equalizer How to clean an E: drive (new Recovery drive since Windows 10 1803) on HP laptop I would like to redirect users after they log in. Is it possible to use hook_user_login() to make the redirection? How do I add the parameter for the redirection?