I've searched extensively for an answer to my dilemma so I hope someone is able to assist. I'm trying to retrieve an IP address from a Linux based system then display the IP address on the screen with Python - here's what I have so far:  import tkinter import subprocess import os import re pattern = re.compile("^([A-Z][0-9]+)+$") test = "10.11.10.1" cmd = subprocess.check_output("ifconfig eno1", shell=True) cmd = cmd.decode() cmd = cmd.splitlines() ip = re.match('[0-9]+', cmd[1]) if ip:     print(ip.group(0))   If I print(cmd) after the decode is prints several lines of output from the ifconfig command, the second line contains the IP address I'm after so this information is displayed if I print(cmd[1]). If I substitute test for cmd[1] the script prints "10" as expected If I change the pattern matching line to read  ip = pattern.match(cmd[1])   I get the same result, however if I change it to  ip = re.match(".*", cmd[1])   it prints out the same thing as does print(cmd[1]) so why does it match .* but neither characters or numbers? Is it possible that the raw data is in some other format than ascii??
What is the difference between the search() and match() functions in the ?  I've read the  (), but I never seem to remember it.  I keep having to look it up and re-learn it.  I'm hoping that someone will answer it clearly with examples so that (perhaps) it will stick in my head.  Or at least I'll have a better place to return with my question and it will take less time to re-learn it.
How to prove that: $\tan(3\pi/11) + 4\sin(2\pi/11) = \sqrt{11}$ Find   $$\lim _{x\to \infty }x\Big(\ln\left(x+1\right)-\ln x\Big)$$  Here's how I do it:  $$x\Big(\ln(x+1)-\ln x\Big) = x\Bigg(\ln(x(1+\frac{1}{x}) - \ln x\Bigg)$$ $$x\Big(\ln x + \ln(1+\frac{1}{x}\Big)-\ln x =x\ln\Big(1+\frac{1}{x}\Big)$$ $$\ln\Bigg( \Big(1+\frac{1}{x}\Big)^x \Bigg) \rightarrow \ln 1^\infty = 0$$  What am I doing wrong? The answer is supposed to be $1$, but I get $0$. Prove that if the positve term series $\sum^{\infty}_{n=1}a_n$ is convergent, also $\sum^{\infty}_{n=1}\sqrt{a_na_{n+1}}$ is convergent.  Prove that if the positive term series $\sum^{\infty}_{n=1}a_n$ and $\sum^{\infty}_{n=1}b_n$ are convergent, also $\sum^{\infty}_{n=1}a_nb_n$ is convergent.  I've tried to solve it using comparison test, but no results. Is there a way to get the path for the assembly in which the current code resides?  I do not want the path of the calling assembly, just the one containing the code.   Basically my unit test needs to read some xml test files which are located relative to the  dll.  I want the path to always resolve correctly regardless of whether the testing dll is run from TestDriven.NET, the MbUnit GUI or something else.  Edit: People seem to be misunderstanding what I'm asking.  My test library is located in say      C:\projects\myapplication\daotests\bin\Debug\daotests.dll   and I would like to get this path:     C:\projects\myapplication\daotests\bin\Debug\   The three suggestions so far fail me when I run from the MbUnit Gui:   Environment.CurrentDirectory gives c:\Program Files\MbUnit System.Reflection.Assembly.GetAssembly(typeof(DaoTests)).Location gives C:\Documents and Settings\george\Local Settings\Temp\ ....\DaoTests.dll System.Reflection.Assembly.GetExecutingAssembly().Location gives the same as the previous. No more updates for Google Chrome 32-bit See question when answering How do I remove "Ubuntu" in the bios boot menu? (UEFI) See this   I have this on my Lenovo s205 too.   Is there some way to remove "ubuntu" from the menu? I don't even have it installed anymore. How to disable creation of desktop workspaces on macbook?   Somehow they get created when I don't need them. [OS: Mojave] How are Clash of Clans multiplayer battles determined Are battles determined by level or trophies? Just curious. Cardinality of Borel sigma algebra I have searched this for hours but still no luck, obviously doing something wrong.  The journal (Risk Analysis) wants "Reference style is based on the National Library of Medicine (NLM) style guide. In-text citations are numbered, superscripted and in parentheses, and the reference list is numbered in order of appearance within the manuscript. Footnotes are superscripted without parentheses".  Could someone please suggest an appropriate .bst file to use that will produce this? Thanks, J Like most Python developers, I typically keep a console window open with the Python interpreter running to test commands, dir() stuff, help() stuff, etc.  Like any console, after a while the visible backlog of past commands and prints gets to be cluttered, and sometimes confusing when re-running the same command several times.  I'm wondering if, and how, to clear the Python interpreter console.  I've heard about doing a system call and either calling cls on Windows or clear on Linux, but I was hoping there was something I could command the interpreter itself to do.  Note: I'm running on Windows, so Ctrl+L doesn't work. Me and some friends were recently disuccing "How cool it would be to be invisible", from a military viewpoint, I said that Camouflage, when done correctly, works surprisingly well, so invisibility was unnecessary. They countered with the argument that an infrared camera could see you easily. Apart from several warm coats, are there any non-restictive ways of preventing IR radiation being emitted from your person? Prove the Probability of Two Events I'm taking my first course in Probability and one of my homework problems is to prove that for any two sets:  $$P(A \cup B) = P(A) + P(B) - P(A \cap B) $$  Note that the function $P$ is the probability of an event happening.  From the third axiom, we are given that for any two disjoint sets, that is $ A \cap B = \emptyset$:  $$P(A \cup B) = P(A) + P(B)$$    My thought process follows from this third axiom, but I run into a problem near the end:  Since $A$ and $B$ are disjoint sets, $P(A)=P(A-B)$ and $P(B)=P(B-A)$, so  $$P(A \cup B) = P(A) + P(B)=P(A-B)+P(B-A)$$  From this, it appears that we are essentially taking the symmetric difference of A and B.  This, to me, seems to be equivalent to:  $$P(A-B)+P(B-A)=P(A)+P(B)-P(A \cap B)$$  Hence, by my logic:  $$P(A \cup B) = P(A)+P(B)-P(A \cap B)$$  Which, in essence, doesn't care whether two sets are disjoint or not as we are subtracting the intersection of them.  If the sets are disjoint, then the intersection is merely null.  If they intersect, then we are removing the "extra pieces".  I feel like this is inadequate proof despite my ability to convince myself that it is true..  Where, if anywhere, did I go wrong?  Thanks! I just deleted a file on my Nexus S that I really need back. (It was actually part of an app using a sqlite database that did a drop table when upgrading to a new version.)  Presumably I need to root the phone first (which I hear is easy on Nexus phones) but am I in a catch-22 here? Namely, does rooting the phone mean wiping/overwriting the partition where the data lives?  If not, what do you recommend for data recovery tools? Presumably the file was just unlinked and not actively overwritten (per usual when "deleting" a file) so technically the data must be there... The new hot questions algorithm sometimes recurses The hot questions algorithm . I like the effects, since I see lots of new interesting stuff every day rather than waiting 6-8 weeks varying amounts of time for the list to update.  However, the new algorithm also has the interesting side effect of recursing the same question:    Of course, this is a world-shattering workflow-breaking unicorn-hating waffle-despising ERROR tremendously minor matter. But, if the SE devs have opportunity during their amazingly large amounts of free time, it might be nice to add a check for the current page before populating the hot questions list. Maybe I'm just hearing the wrong comments, but it seems that Slytherin is considered a dark house by almost everyone.  I know when both reading the books and watching the movies, I always had a feeling of foreboding when there were a number of Slytherin house members around or the time when Harry and friends went into Slytherin and felt this feeling was emphasized by the writing and film directing.  We hear very little positive about Slytherin (other than the repeated line that Harry would be a great wizard if he went in Slytherin) and there really isn't a list of great wizards who were in Slytherin House.  Even in the movie Deathly Hallows (I can't check the book - I loaned it to my sister 3 weeks after it was published and haven't seen it since!), McGonagall specifically asks Filtch to lead all the Slytherin students into the dungeon while Hogwarts is under siege by Voldemort.  She doesn't specify that any Slytherin students remain behind to help fight.  Is this intentional?  Did JKR intentionally create a bad reputation and not present any counter-examples so we'd believe all of Slytherin was bad?  Most characters in the Potter-verse are complex.  While we can admire James and Lily Potter, we also see how James teased and taunted Snape, showing us a harsh side of James, and we see that there is good in Snape.  We even see complexity in Voldemort as a villain who is mixed-blood, but hates those of mixed blood and wants purity for all witches and wizards.  With all the complex characters, it seems odd that there is essentially nothing to redeem the House of Slytherin - which is not just one character, but is a group represented by a number of characters.  But yet it seems as if it's presented, in both books and movies, as dark and full of schemers and bad people.  Are there indications, and especially more than a few or just tiny ones, that there are a fair number of good witches and wizards in Slytherin? I have seen many softwares such as Update Manager and Synaptic Package Manager, they wait if some other program is using the /var/lib/dpkg/lock and is locked. How can we do this through the Terminal? I saw apt-get's manual but didn't find anything useful. What is the formal definition of polynomial ring of several variables? Let's consider a polynomial ring of single variable. One can define them informally by saying $P(X)=\sum_{i=1}^n a_n X^n$ while $X$ is an indeterminate variable. However, since mathematics is based on first-order logic, one can only talk about something that actually exists (as a set). So as its name says, indeterminate variable is not a sentence in $ZFC$. Nevertheless, we can formally define a polynomial ring $R[X]$ as a subset of $R^\omega$ whose support is finite. ($R$ is a commutative ring with unity) Just like a single variable, I want to know what would be the formal definition of a polynomial ring of several variables. What would be a formal definition? === I have figured out a candidate. That is,  Candidate for a &quot;Definition of a polynomial ring $R[X_1,...,X_n]$&quot;. ($R$ is a commutative ring with unity) Let $R[X_1,...,X_n]$ be the set of all functions $f:\omega^n \rightarrow R$ whose support is finite. Define $(f+g)(a,b,c)=f(a,b,c)+g(a,b,c)$ and $(f•g)(a'',b'',c'')=\sum_{a+a'=a''} f(a,b,c)•g(a',b',c')$ (Note that in this way, $+,•$ are well defined.) Then, it can be checked that $(R[X_1,...,X_n],+,•)$ is a ring.  Is this a formal definition of a polynomial ring? Describe the set of points on the complex plane...