This seems simple but I've been struggling for hours now. The pattern is simple, a telephone number that optionally starts with a +, has 10-15 digits, and optionally has spaces, dashes or parentheses. The numbers and characters should be in no particular order.  I've tried using non-matching groups and seen so many different ways of validating phone numbers, but to no avail.  The best I have so far is ^\+?([0-9]{10-15}[)( -]*)$, but it only accepts the other characters if they're at the end of the pattern. This expression will be used in a Java context.
I'm trying to put together a comprehensive regex to validate phone numbers. Ideally it would handle international formats, but it must handle US formats, including the following:   1-234-567-8901 1-234-567-8901 x1234 1-234-567-8901 ext1234 1 (234) 567-8901 1.234.567.8901 1/234/567/8901 12345678901   I'll answer with my current attempt, but I'm hoping somebody has something better and/or more elegant.
Variable substitution with an exclamation mark in bash Proof of convergence of sequences Problem: Show that if $x_n\to 5$ then $\dfrac{x_n +1}{\sqrt{x_n -1}} \to 3$.  So I know $|x-5|&lt;\epsilon$ and I need to show that $\left|\dfrac{x_n +1}{\sqrt{x_n -1}} -3\right| &lt; \epsilon$.  I tried applying the triangle inequality (and a bit of algebra) to get $$\left|\frac{x_n +1}{\sqrt{x_n -1}} -3\right| \leq |x_n -5| \left |\frac{1}{\sqrt{x_n -1}}\right| + \left|\frac{6}{\sqrt{x_n-1}} -3\right|.$$  From this I know that $|x_n -5| &lt;\epsilon$ and can show that $\left |\dfrac{1}{\sqrt{x_n -1}}\right|&lt;1$. So my only problem is the second part of the sum. I have no idea what to do with it to get everything to be less than $\epsilon$. A two way String hash function Is there a way to merge to two bars in GNOME 3? Best case scenario would be to have one single bottom or top bar that has all the symbols on the left side and the rest like the time indicator, connections, on/off button, etc. on the right side.  Is that possible in any way? Fermat's Last Theorem with negative exponent Problem with installing Steam on Ubuntu 15.04+ What is the minimum distribution for LaTeX How to auto close LWC quick action from JavaScript? How do you sort a dictionary by value? I often have to sort a dictionary, consisting of keys &amp; values, by value. For example, I have a hash of words and respective frequencies, that I want to order by frequency.  There is a SortedList which is good for a single value (say frequency), that I want to map it back to the word.   orders by key, not value. Some resort to a , but is there a cleaner way? For QA workstations preparation (Windows-based PCs) our IT department uses typical batch deployment tools. I'm not at all interested in the details of such process, but IT guys ask me:  What typical set of software you need for everyday manual testing tasks? We could include these in our deployment so that you guys could save more time for testing, not for environment prep &amp; tuning.  Sure thing we do test various range of projects, from web applications to standalone solutions, and each application requires its own set of tools for manual testing, e.g.:  Browsers Virtualization utilities DB clients Screens capturing tools FTP clients XML editors etc.  However, and that's for sure - there's a list of tools every QA MUST have installed on its PC, regardless of project types under testing. My area of experience is mostly standalone / complex web apps, that's why my vision on the task is a bit subjective. So, your suggestions of what are tools / software an average QA specialist can't live without will be highly appreciated. 2 assumptions:  Manual testing is a point of interest. Let's limit the list to not more than 15 (better 10) items.  Thanks in advance! How do I check if an object has a specific property in JavaScript? How do I check if an object has a specific property in JavaScript?  Consider:  x = {'key': 1}; if ( x.hasOwnProperty('key') ) {     //Do this }   Is that the best way to do it? Image of Jacobson Radical is the Jacobson Radical I'm stuck on the following problem:      Let $R$ be a commutative ring with $1$, and suppose $R$ is semilocal with maximal ideals $\mathfrak m_1, ... , \mathfrak m_s$.  Let $\mathfrak a$ be an ideal of $R$. The problem is to show that under the usual surjection $\pi:R \rightarrow R/\mathfrak a$, the Jacobson radical of $R$ is sent to the Jacobson radical of $R/\mathfrak a$.   My attempt: suppose that $\mathfrak m_1, ... , \mathfrak m_t$ contain $\mathfrak a$, but $\mathfrak m_{t+1}, ... , \mathfrak m_s$ do not.  Then $Jac(R/\mathfrak a) = (\mathfrak m_1/ \mathfrak a) \cap \cdots \cap (\mathfrak m_t/ \mathfrak a)$.  Obviously $\pi Jac(R) \subseteq Jac(R/ \mathfrak a)$, and the converse inclusion is equivalent to the following claim: if $x \in \mathfrak m_1 \cap \cdots \cap \mathfrak m_t$, then there exists a $y \in \mathfrak m_1 \cap \cdots \cap \mathfrak m_s$ such that $x - y \in \mathfrak a$.    This should be some application of the Chinese remainder theorem, but I'm not seeing it.  All I have to go on is that there exist $m_i \in \mathfrak m_i$ ($t+1 \leq i \leq s$) with $m_i \not\in I$.  I also haven't found out a way to use the fact that $\mathfrak m_1 ,... , \mathfrak m_s$ are all the maximal ideals of $R$.  I was also thinking about looking at some explicit maps.  If we let $\Gamma$ be the composition $$\frac{(R/\mathfrak a)}{Jac(R/ \mathfrak a)} \xrightarrow{\cong} \frac{(R/\mathfrak a)}{(\mathfrak m_1/\mathfrak a)} \oplus \cdots \oplus \frac{(R/\mathfrak a)}{(\mathfrak m_t/\mathfrak a)} \xrightarrow{\cong} R/\mathfrak m_1 \oplus \cdots \oplus R/\mathfrak m_t$$ then we have a commutative diagram $$\begin{matrix} R/Jac(R) &amp;  \rightarrow &amp; \frac{(R/\mathfrak a)}{Jac(R/\mathfrak a)} \\ \downarrow &amp; &amp; \downarrow \Gamma \\ R/\mathfrak m_1 \oplus \cdots R/\mathfrak m_s &amp; \rightarrow &amp; R/\mathfrak m_1 \oplus \cdots \oplus R/\mathfrak m_t \end{matrix}$$ where the vertical arrows are isomorphisms, and the horizontal arrows are surjections. When $\operatorname{Hom}_{R}(M,N)$ is finitely generated as $\mathbb Z$-module or $R$-module? Assume that $M$ and $N$ are two finitely generated $R$-modules. Then $\operatorname{Hom}_{R}(M,N)$ is a finitely generated $\mathbb Z$-module and/or $R$-module (in this case, assume that $R$ is commutative)?   Note that $R$ is not Noetherian ring. Is there any counterexample (for any cases)? Why will Ubuntu no longer measure file size unit as byte, megabyte, gigabyte, etc? I read on  that Ubuntu will no longer use the familiar file size units we all know by now (kB, MB, GB, TB) and switch to a different IEC standard (KiB, MiB, GiB, TiB). If this is true, I would like to know what's the reasoning behind this change, and the impact (if any) this change has, especially with multiplatform applications or applications run with Wine. Floating sidebar can get too long and obscure footer Sometimes, when you create a question which returns a lot of similar questions, it makes the height of the floating "Similiar Questions" box too big to fit on the page. As a result, it blocks some of the footer on the right hand side. It's actually doing it as I type this question.  I think a max height based on the view port - footerHeight should fix it. Geodesics equations via variational principle I would like to recover the (timelike) geodesics equations via the variational principle of the following action:  $$ \mathcal{S}[x] = -m \int d\tau = -m \int \sqrt{-g_{\mu\nu}\,dx^{\mu}\,dx^{\nu}} $$  Using an arbitrary auxiliary parameter $\lambda$, then one is able to rewrite the action and obtains: $$ d\tau = \sqrt{-g_{\mu\nu}\, \tfrac{dx^{\mu}}{d\lambda}\tfrac{dx^{\mu}}{d\lambda}} d\lambda $$ $$ -m \int d\tau = -m \int (d\tau / d\lambda) d\lambda =  -m\int\sqrt{-g_{\mu\nu}\, \tfrac{dx^{\mu}}{d\lambda}\tfrac{dx^{\mu}}{d\lambda}} d\lambda $$  Now we can vary the paths $x^{\mu}(\tau) \rightarrow x^{\mu}(\tau) + \delta x^{\mu}(\tau)$.  I need the following equation to be true, so i get the geodesics equations, but I don't know how one can say the following: $$ \int d\tau \,\delta g_{\mu\nu}\frac{dx^{\mu}}{d\tau} \frac{dx^{\nu}}{d\tau} = \int d\tau\, g_{\mu\nu, \rho} \frac{dx^{\mu}}{d\tau} \frac{dx^{\nu}}{d\tau} \delta x^{\rho} $$ I know there is a simpler action, which leads to the same equation of motion, but there one has to do the same manipulation, which I sadly don't understand.  Thanks for helping me! Date Formatting C# I created the following script:  #!bin/bash cat &gt; Top10 &lt;&lt;EOF Linux Mint 17.2 Ubuntu 15.10 Debian GNU/Linux 8.2 Mageria 5 Fedora 23 openSUSE Leap 42.1 Arch Linux CentOS 7.2-1511 PCLinuxOS 2014.12 Slackware Linux 14.1 FreeBSD EOF sed -ri "s/^[^0-9]*$//" Top10 sed -r "s/(.*)([[:space:]][[:digit:]]*.*)$/\2\1/" Top10 | sed -r "s/([[:space:]])([[:digit:]])/\2/" | sed -r "s/([[:digit:]])([[:alpha:]])/\1 \2/" &gt; Top10 sed -r -i "s/(.*)/\L\1/" Top10 sed -r -i "y/[aeiou]/[AEIOU]/" Top10 sort Top10 -g -o Top10 cat Top10   When I run it a few times the following happens:     As you can see sometimes the Top10 file turns out empty and sometimes it turn out the way I needed it to be. I know that the command which replaces the extensions from the end to the front of a line is done poorly. I ran this script on a VMware virtual machine. Could that be the reason? How to remove wine completely How can I remove the wine folder and all the applications in that folder?  I've tried via synaptic but it keeps showing up in the application menu. What conditions are necessary for a Wither Skeleton to spawn naturally, and can I manipulate those conditions to increase the chance of them spawning?  I want to make a Wither Skeleton spawning pad in the Nether but I'm having trouble finding Wither Skeletons. I've only heard that they spawn in Nether Fortresses.