I'm using Debian 8.  How do I get my external IP address from a command line?  I thought the below command would do the job ...  myuser@myserver:~ $ /sbin/ifconfig $1 | grep "inet\|inet6" | awk -F' ' '{print $2}' | awk '{print $1}' addr:192.168.0.114 addr: addr:127.0.0.1 addr:   but as you can see, it is only revealing the IP address of the machine in the LAN.  I'm interested in knowing its IP for the whole world.
I need to find my external IP address from a shell script. At the moment I use this function:   myip () {      lwp-request -o text checkip.dyndns.org | awk '{ print $NF }' }   But it depends on perl-libwww, perl-html-format, perl-html-tree installed. What other ways can I get my external IP?
Reese's boyfriend seems to constantly be asleep. When I try and talk to him, she warns me that he's been hard at work all night, but I can't actually enter the shop at night.   Is there any way to talk to him or any benefit for doing so? I've tried to talk to him daily for a week (thinking it was something akin to talking to Sable) but I've had no luck. Trying to come in after-hours doesn't work. This is a homework question of mine that Ive answered and I'd really like some feedback on my solution.       Prove or find a counter example to the claim that for all sets $A,B,C$, $$\text{if  }A\cap B=B\cap C=A\cap C=\emptyset \text{ then } A\cap B\cap C\neq \emptyset$$.   Since I can only either prove it is true, OR find a counter example I have gone with the latter because I think this statement is not true. My counter example is as follows:  Let $A = \{1,2,3 \}$ , $B = \{4,5,6 \}$ and $C = \{7,8,9 \}$. It is then clear that $A ∩ B =  B ∩ C =  A ∩ C = \emptyset$ .  If we let $x ∈ A\cap B\cap C$ then $x$ must be in $A$ and $B$ and $C$. Since this cannot be possible because there are no common elements then this implies that $A∩B∩C$ has to be equal to a null set i.e $A∩B∩C = \emptyset$ and thereby showing that (at least for this scenario) if $A \cap  B =  B \cap  C =  A \cap  C = \emptyset$ then $A\cap B\cap C = \emptyset$.  Is this okay? Any feedback will be greatly appreciated thank you! According to ,  The collection of all algebraic objects of a given type will usually be a proper class. Examples include the class of all groups, the class of all vector spaces, and many others. In category theory, a category whose collection of objects forms a proper class (or whose collection of morphisms forms a proper class) is called a large category.  I am aware of Russell's Paradox, which explains why not everything is a set, but how can we show the collection of all groups is a proper class? Let $R$ be a commutative ring with $1$. Suppose that all ideals $I \neq R$ are prime. Prove that $R$ is a field.   Help me some hints.  Thanks a lot. How can I get the active screen dimensions? How can I use pathauto to generate URLs for deeply nested vocabularies? I am generating breadcrumbs from URL arguments as described .  I have a vocabulary that looks like this:  Arts-> Performing-> Dancing-> Ballet  I want my url to look like this: arts/performing/dancing/ballet  Using the pathauto module, I can do this for taxonomy terms:  [term:parent]/[term:name]   Which, on the Ballet page, gives me the following; not what I want:  dancing/ballet    If I use parents instead of parent,  ([term:parents]/[term:name]); this is close but not quite:  arts-performing-dancing/ballet   How can I get from arts-performing-dancing to arts/performing/dancing? What's the simplest SQL statement that will return the duplicate values for a given column and the count of their occurrences in an Oracle database table?  For example: I have a JOBS table with the column JOB_NUMBER.  How can I find out if I have any duplicate JOB_NUMBERs, and how many times they're duplicated? I've seen them maneuver. They definitely can go backwards. How fast can they go in reverse? Is warp speed possible, or is reverse limited to impulse power? If it is limited to impulse power, can they travel backwards under impulse power as fast as they travel forwards under impulse power? Rebel flight suits include an ejection harness, Biggs tells Porkins to eject. This seems to suggest that Rebel fighters have an ejection system.  How would they operate for different fighters? Does the whole cockpit separate? Do they function like current aircraft ejection systems - if so what protects the pilot from the vacuum of space? How many connected graphs over V vertices and E edges? Is there a way to calculate the number of simple connected graphs possible over given edges and vertices?   Eg: 3 vertices and 2 edges will have 3 connected graphs But 3 vertices and 3 edges will have 1 connected graph  Then 4 edges and 3 will have 4 connected graphs  Till such values...it is easy to see its  V choose E  But what about when the number of vertices are less than number of edges...how to calculate then?  I am not able to visualize that  Can it be a variation of the Stars and Bars problem  Like...number of ways 7 edges(balls) can be connected to (kept in) 5 vertices(bags) such that no vertex(bag) is isolated (is empty)  Here maybe we might have to consider the number of edges twice as each edge needs two vertices... This is maybe a duplicate like , but the error still appears.    When I try to click "mark as duplicate" a HTTP 404 error occur.  I'm using Firefox 16.0.2 with Firebug on Mac OS X 10.5.8 Allow users to put their e-mail in posts? Should I edit out the (thankfully obsfucated) e-mail address from this ?  Is this something we should allow on the site going forward?  I don't care about the "thank you" or "hello", but this might lead to an answer being sent by e-mail, which would mean it wouldn't be peer reviewed (for what that's worth), and the answer would be lost to the community. Careers - Search Book JS error (complex measures) $d\nu=d\lambda +f\,dm \Rightarrow d|\nu|=d|\lambda| +|f|\,dm$ and $f\in L^1(\nu)\Rightarrow f\in L^1(|\nu|)$ Two simple exercises on complex measures I don't know how to solve, from Folland's Real Analysis. I find it difficult to manipulate the definitions in computations. For context, if $\nu$ is a complex measure on $(X,\mathcal{M})$ then $|\nu|$ is defined as $d|\nu|=|g|\,d\mu$ where positive measure $\mu$ and $g\in L^1(\mu)$ are such that $\nu \ll \mu$ and $\nu = g\,d\mu$ (and in the textbook it's shown that this definition does not depend on the choice of $\mu$).     1) Let $\nu$ be a reguar complex Borel measure on $\mathbb{R}^n$, $m$ denote   Lebesgue measure, and   let $d\nu = d\lambda + f\,dm$ be its Lebesgue-Radon-Nikodym   representation. Then ("it is easily verified")   $d|\nu|=d|\lambda|+|f|\,dm$.      2) If $f\in L^1(\nu)$ then $f\in L^1(|\nu|)$. I was able to prove the   reverse implication, but not this one.   The definition of $|\nu|$ in the case of real signed measures (as $|\nu|=\nu^+ + \nu^-$) makes sense to me but I can't see intuitively into the definion of $|\nu|$ for complex measures as given in the textbook. Do you have any advice on this?  Thank you! Recently, on my Ubuntu 18.04 I have noticed that at least on gnome-calculator and chromium browser the fonts are displayed as squares. I have followed instructions  and , the calculator is fixed, but the problem on chromium still exists when I open a dialog to search for a file.  Not sure if this happens on other applications as well, I haven't checked all my apps, but File managers nemo and nautilus are working fine.  Also, before few months ago, I have included some windows fonts for my libre office shown . I used the copy (cp) method, not the link (ln -s). But, was working fine until yesterday. Haven't done any major change or update, at least on my Linux partition (dual boot). But, I don't think that this has anything to do with that.  Any idea how can I fix this issue?  . A is similar to $A^k$, then each eigenvalue of $A$ is a root of unity Let $A \in \mathbb{C}(n,n)$ and $k \geq 2$ be an integer such that $$A \sim A^k$$. Show that if $A$ is non-singular then each eigenvalue of $A$ is a root of unity.   Attempt: Since $A \sim A^k$, $$PA = A^kP$$ where $P$ is an invertible matrix. Since $A$ is invertible, $0$ cannot be an eigenvalue of $A$. Suppose $$Av = \lambda v \quad v \neq 0$$ then $$PAv = \lambda Pv$$ $$\therefore A^k(Pv) = \lambda (Pv) $$ but this implies that $Pv$ is an eigenvector of $A$. But the eigenvalues of $A^k$ are $\lambda^k$ $$\therefore \lambda^k=\lambda$$ which gives the conclusion required.   My questions is: Is the logic correct? If so, Am I missing any details? If not, then how could I approach this?   Thanks! Problem  For what natural numbers is $n^3 &lt; 2^n$?  Attempt @ Solution   For $n=1$, $1 &lt; 2$ Suppose $n^3 &lt; 2^n$ for some $n = k \ge 1$ It looks like the inequality is true for $n = 0$, $n = 1$ and $n\ge10$ But, how can I prove this through induction? Measuring accuracy of a logistic regression-based model How can I find the method that called the current method? When logging in C#, how can I learn the name of the method that called the current method? I know all about System.Reflection.MethodBase.GetCurrentMethod(), but I want to go one step beneath this in the stack trace. I've considered parsing the stack trace, but I am hoping to find a cleaner more explicit way, something like Assembly.GetCallingAssembly() but for methods. How can I start to learn web development? I'm very interested in learning web development and have learned some basics regarding HTML and CSS a few years back from W3Schools, but I never learned how to develop websites that are up to today's standards, i.e. free-flowing sites without the use of tables to govern the design of the site.  What are some good resources that I can start with?