How can Python regex ignore case inside a part of a pattern but not the entire expression?
restrict 1 word as case sensitive and other as case insensitive in python regex | (pipe)
When you call the object.__repr__() method in Python you get something like this back:    &lt;__main__.Test object at 0x2aba1c0cf890&gt;     Is there any way to get a hold of the memory address if you overload __repr__(), other then calling super(Class, obj).__repr__() and regexing it out? Let $f,g:X\to Y$ be maps of spaces such that $f\simeq g$. Is it true that the mapping cones $\operatorname{cone}(f)$ and $\operatorname{cone}(g)$ are homotopy equivalent?  Can we write down an explicit homotopy equivalence? It ought not to be too hard to get a map $\operatorname{cone}(f)\to \operatorname{cone}(g)$ from the existence of a homotopy $H:X\times I\to Y$, but I haven't been able to find a sensible candidate, despite trying for quite a while. Don't understand proof that interior of a set is open Can someone tell me what's wrong with this? because i can't figure out where the missing \right( is.  \begin{equation}  \begin{split} Μ=&amp;-\pi \rho \frac{c^{2}}{4}    \left[c\left(\frac{α}{c}-\frac{1}{2}\right)\ddot{h}+Uc\left(\frac{3}{4}-     \frac{α}{c}\right)\dot{\alpha} +\frac{c^{2}}{4}\left(\frac{9}{8}+      \frac{4α^{2}}{c^{2}}-\frac{4α}{c}\right)\ddot{\alpha} \\  &amp;-\left(\frac{4α}{c}-1\right)U C(k) \left(-\dot{h} +U\alpha + c \left(\frac{3}{4}-\frac{α}{c}\right)\dot{\alpha}\right)\right]  \end{split} \end{equation} How to create a table with long text and which packages use Number of ways to choose $n$ balls from $3n$ balls, distinguishable/indistinguishable. I would like to typeset the top part of Pascal's triangle. To get the triangle with the names of the binomial coefficients, i.e., {n \choose k}, I used the following code  \begin{tikzpicture} \foreach \n in {0,...,4} {   \foreach \k in {0,...,\n} {     \node at (\k-\n/2,-\n) {${\n \choose \k}$};   } } \end{tikzpicture}   The result is this   Now I want to be equally lazy and do something like this for the values of the binomial coefficients, i.e., replace {\n \choose \k} in the node label with \CalculateBinomialCoefficient{\n}{\k} where \CalculateBinomialCoefficient is a hypothetical macro that calculates the binomial coefficient. Has anyone done something like that?  The result should look like this: Let $g$ be a function on $\mathbb R$ to $\mathbb R$ which is not identically zero and which satisfies the equation $g(x+y)=g(x)g(y)$ for $x$,$y$ in $\mathbb R$.   $g(0)=1$. If $a=g(1)$,then $a&gt;0$ and $g(r)&gt;a^r$ for all $r$ in $\mathbb Q$.   Show that the function is strictly increasing if $g(1)$ is greater than $1$, constant if $g(1)$ is equal to $1$ or strictly decreasing if $g(1)$ is between zero and one, when $g$ is continuous. Why is median age a better statistic than mean age? If you look at       Or this Wikipedia page      Clearly  seems to be the statistic of choice when it comes to ages.  I am not able to explain to myself why  would be a worse statistic. Why is it so?  Originally posted  because I did not know this site existed. The boundary of union is the union of boundaries when the sets have disjoint closures I have some data which looks like:  sampleA    ATGC    10   100 sampleA    ATGC    120  230 sampleA    ATGC    200  110   I want to print the min and max using the values in both column 3 and 4. So my output should look like:  sampleA   10  230   Thanks in advance Take a look on a website with specified viewport size, that is bigger than physical size? How can I deduce/identify an app from a notification icon? Can X.org Load Two Different Drivers? (Triple-Head Setup with Intel and NVidia Card) We want to set up a 3 screens with an onboard intel graphics adapter and an nvidia card.  Both cards are recognized in lspci   01:00.0 VGA compatible controller: NVIDIA Corporation GT218 [GeForce 210] (rev a2) 00:02.0 Display controller: Intel Corporation 2nd Generation Core Processor Family Integrated Graphics Controller (rev 09)   And bascially work: If I switch to the console, I see output on the Intel card, X is only running on the Nvidia card.  But when I type xrandr | grep conn I get only one connected port:   DVI-I-0 disconnected (normal left inverted right x axis y axis) VGA-0 disconnected (normal left inverted right x axis y axis) DVI-I-1 connected 1920x1200+0+0 (normal left inverted right x axis y axis) 518mm x 324mm HDMI-0 disconnected (normal left inverted right x axis y axis)   I am on Ubuntu 12.10 (and XFCE) and installed the proprietary nvidia driver.  I was assuming that X maybe has a problem to autodetect both cards, so I thought the following xorg.conf could help:   Section "ServerLayout"     Identifier     "Layout0"     Screen      0  "Screen0"     Screen      1  "Screen1"     InputDevice    "Keyboard0" "CoreKeyboard"     InputDevice    "Mouse0" "CorePointer" EndSection  Section "Files" EndSection  Section "InputDevice"     # generated from default     Identifier     "Mouse0"     Driver         "mouse"     Option         "Protocol" "auto"     Option         "Device" "/dev/psaux"     Option         "Emulate3Buttons" "no"     Option         "ZAxisMapping" "4 5" EndSection  Section "InputDevice"     # generated from default     Identifier     "Keyboard0"     Driver         "kbd" EndSection  Section "Monitor"     Identifier     "Monitor0"     VendorName     "Unknown"     ModelName      "Unknown"     HorizSync       28.0 - 33.0     VertRefresh     43.0 - 72.0     Option         "DPMS" EndSection  Section "Device"     Identifier     "Device0"     Driver         "nvidia"     VendorName     "NVIDIA Corporation"     BoardName      "GeForce 210" EndSection  Section "Screen"     Identifier     "Screen0"     Device         "Device0"     Monitor        "Monitor0"     DefaultDepth    24     SubSection     "Display"         Depth       24     EndSubSection EndSection   Section "Monitor"     Identifier     "Monitor1"     VendorName     "Unknown"     ModelName      "Unknown"     HorizSync       28.0 - 33.0     VertRefresh     43.0 - 72.0     Option         "DPMS" EndSection  Section "Device"     Identifier     "Device1"     Driver         "intel"     VendorName     "Intel"     BoardName      "Internal Intel Graphics" EndSection  Section "Screen"     Identifier     "Screen1"     Device         "Device1"     Monitor        "Monitor1"     DefaultDepth    24     SubSection     "Display"         Depth       24     EndSubSection EndSection   But it is still not working.   Is this generally possible to use two different drivers in X ? Is it necessary to create an xorg.conf manually then? (because Ubuntu 12.10 normally works without the xorg.conf) Are there any errors in my xorg.conf? $f_n:[0,1]\to [0,1]$ continuous, $f_n\to f$ uniformly, prove: ${\frac1n}\sum_{k=1}^{n}{f_k} \to f$ uniformly I was able to prove, hopefully correctly, that the sum converges uniformly. But, I'm not sure how to show it converges uniformly specifically to $f$.  The way I proved it converges uniformly was by using the Dirichlet convergence test, by taking $a_k(x) = \frac1n$ and $b_k(x) = f_k(x)$. $\sum_{k=1}^n{b_k(x)}$ is uniformly bounded on $[0,1]$ by $n+2$ for instance, and $a_n$ is monotone and uniformly convergent to 0 because it does not depend on the value of $x$.  I got rather stuck after this. I guess I have to use the continuity of the functions and the uniform convergence of both, but I can't figure out how to show that they converge to the same thing. Any help will be greatly appreciated. Splitting string into pair of characters in Ruby Integral Representation of the Zeta Function: $\zeta(s)=\frac1{\Gamma(s)}\int_{0}^\infty \frac{x^{s-1}}{e^x-1}dx$ How does one get from this $$\zeta(s)=\sum_{k=1}^{\infty}\frac1{k^s}$$ to the integral representation $$\zeta(s)=\frac1{\Gamma(s)}\int_{0}^\infty \frac{x^{s-1}}{e^x-1}dx$$ of the Riemann Zeta function?  I can see that it can be rewritten as  $$\Gamma(s)\zeta(s)=\int_{0}^\infty \frac{x^{s-1}}{e^x-1}dx$$ and the Gamma function as an integral yields  $$\zeta(s)\int_{0}^\infty \frac{x^{s-1}}{e^x}dx=\int_{0}^\infty \frac{x^{s-1}}{e^x-1}dx$$  But this approach does not work as the right integral does not converge.  So how does one go from the summation to the integral representation? I need to grant select permission for all tables owned by a specific user to another user.  Can I do this with a single command along the lines of:  Grant Select on OwningUser.* to ReceivingUser   Or do I have to generate the sql for each table with something along the lines of:   Select 'GRANT SELECT ON OwningUser.'||Table_Name||'TO ReceivingUser'   From All_Tables Where Owner='OWNINGUSER' Profitable strategy in coin tossing? There is a coin with a probability $p$ of heads, and $1-p$ of tails. Tosses are independent of each other. When you bet an amount of money $x$, you receive $2x$ if it lands heads, and you lose what you bet if it lands tails.  We are going to use the following strategy:  You start betting an initial amount $x_0$. Every time you lose, you bet twice what you bet in the previous throw. You keep doing this, until you win, at which point you retire, or start again, betting $x_0$.  The interesting case of course is when $p &lt; 0.5$.  The question is: How profitable is this strategy? Intuitively I feel that eventually I can always win an arbitrarily large amount of money. But that can't be entirely right ("the house always wins!"). So what am I missing here? What's the expected win in each run?  Also, does this sort of strategy have a name in the literature?  P.S.: Found this later, When I want to edit a tag of a question I get following message:     Your edit will be placed in a queue until it is peer reviewed.      We welcome all constructive edits, but please make them substantial. Avoid trivial, tiny one-letter edits unless absolutely necessary.   Now the question is: are tag edits (adding a needed tag to an under-untagged, replacing a mis-used tag) substantial enough?  For example the proc-tag-wiki is just about a Ruby feature called proc - but currenlty some questions about Oracle Pro*C (a embedded SQL preprocessor) or the Linux /proc filesystem are also tagged with proc. Btw, what tag should be used for /proc?  Say I come across a Pro*C Question which is tagged with proc - is a change to proc-sql considered substantial or not?