I have 2 textbox asp controls:  Phone and Time. Phone should have format: +7 (xxx) xx-xx  Time is a float and should have value between 1.0  to 40.0  (for example 20.5)  How to realize it in regular validation section?
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.
conjunction of disjunctions and disjunction of conjunctions $(p∨q) ∧ (p∨r) ∧ (q∨r) \iff (p∧q) ∨ (p∧r) ∨ (q∧r)$  Without using set theory, how can I prove this using logical equivalences? I've tried to approach this problem with De Morgan and I've also tried the property of distributivity but I keep reaching a dead end.   How should I approach this problem?  Thank  you. Let $f: K^\bullet \to L^\bullet$ be homotopy equivalence. From theory of triangulated categories it follows that $C(f)^\bullet$ is contractible. But how can i produce explicit formula for homotopy of $Id_{C(f)^\bullet}$ and $0_{C(f)^\bullet}$? How can I count all the lines of code in a directory recursively? Proving that these two sets are denumerable. (a) $S_k=\{A\subset\mathbb{N}: |A|=k\}$ for $k\in\mathbb{N}$  (b) $S = \bigcup_{k=1}^\infty S_k$   Work: For (a), I am not too sure about what approach I should use. I think finding a bijective function between the $S_k$ and $\mathbb{N}$ is hard to do . I also thought about using the Schroeder-Bernstein theorem and find injective functions $f:\mathbb{N}\rightarrow S_k$and $g:S_k\rightarrow\mathbb{N}$ in order to prove that $S_k$ and $\mathbb{N}$ are numerically equivalent. However, I have a hard time finding and proving these injective functions. I haven't really looked at (b) as I have yet to complete (a). Meta sites in "Your Communities" display different reputation Why do the less than symbol () appear wrong as upside down exclamation (¡) or question mark (¿)? If $A=\left( \begin{array}{ccc} 0 &amp; 1 &amp; 0 \\ 0 &amp; 0 &amp; 1 \\ 1 &amp; 0 &amp; 0 \end{array} \right)$, find the rank of $A+A^2+A^3$  We have $\rho(A+A^2+A^3)\leq\rho(A)+\rho(A^2)+\rho(A^3) $ where $\rho(A)$ means rank of A.  Here $\rho(A)=3.$ Also $\rho(A^2)=3$ and $\rho(A^3)=3$  as $\det A\neq 0$ and $\det(A^2)=\det(A)\det(A)\neq 0$ and so on.   But how to get the desired result. Preventing itemize environment to insert initial vertical space Confidence interval interpretation in linear regression when errors are not normally distributed Cross Reference problem How to validate an email address in PHP Equivalent definitions for simple connectivity If I would show someone a yellow object and ask them, "is this object yellow?" That person would say "yes".  But I could never know if my perception of the color yellow is the same as that other person's. Because he or she could actually be seeing, what I know to be the color green. But then tells me that its the color yellow because that has been taught to him or her from young age.  So how can you test if people are really seeing the same color?  Question closed and can now be found @ It is often stated that the Lagrangian formalism and the Hamiltonian formalism are equivalent.   We often hear people talk about eigenvalues of Hamiltonians but I have never ever heard a word about eigenvalues of Lagrangians.   Why is this so? Is it not useful? is it not possible to do it? Limit size of Queue in .NET? I have a Queue&lt;T&gt; object that I have initialised to a capacity of 2, but obviously that is just the capacity and it keeps expanding as I add items.  Is there already an object that automatically dequeues an item when the limit is reached, or is the best solution to create my own inherited class? Disable autostart on boot and restrict background execution In a bash shell script, writing a for loop that iterates over string values Find an explicit isomorphism of the map $h: \Bbb F_5[x]/(x^2+x+2) \to \Bbb F_5[x]/(x^2+4x+2)$  I take the question to mean showing the 2 rings are isomorphic by finding an explicit mapping of each element.   I think $x^2+x+2$ and $x^2+4x+2$ are irreducible over $\Bbb F_5$, so these are both fields.  Also $x^2=4x+3$ in the first case and $x^2=x+3$ in the second.  But beyond these basic facts I'm not sure how I should proceed. I came across this example on WordWeb while going through the meaning of the word ''.     the program brought an avalanche of mail (Just like "a group of man men").   I'm quite sure it should be mails. Kindly confirm. What are the pros and cons of the leading Java HTML parsers?