I am trying to vertically align this button in the center of the modal-footer div.  Here is a link to my JSFiddle:     .modal-footer {   background-color: #2A3E5D;   color: white;   height: 100px;   padding: 2px 16px; }  .wrapper-div {   vertical-align: middle }  .button {   background: #e8e8e8;   display: inline-block;   font-size: 12px position: relative; } &lt;div class="modal-footer"&gt;   &lt;div class="wrapper-div"&gt;     &lt;button type="button" class="button"&gt; Submit Filters &lt;/button&gt;   &lt;/div&gt; &lt;/div&gt;     I'm not sure what needs to change in order for this to be vertically aligned in the center of the blue modal-footer div.  I know can accomplish this in a hacky way by putting margins on the button but that isn't what I want to do.
I have a div with two images and an h1. All of them need to be vertically aligned within the div, next to each other. One of the images needs to be absolute positioned within the div. What is the CSS needed for this to work on all common browsers? &lt;div id=&quot;header&quot;&gt;   &lt;img src=&quot;..&quot; &gt;&lt;/img&gt;   &lt;h1&gt;testing...&lt;/h1&gt;   &lt;img src=&quot;...&quot;&gt;&lt;/img&gt; &lt;/div&gt;
I have a string "1112224444' it is a telephone number. I want to format as 111-222-4444 before I store it in a file. It is on a datarecord and I would prefer to be able to do this without assigning a new variable.  I was thinking:  String.Format("{0:###-###-####}", i["MyPhone"].ToString() );   but that does not seem to do the trick.  ** UPDATE **  Ok. I went with this solution  Convert.ToInt64(i["Customer Phone"]).ToString("###-###-#### ####")   Now its gets messed up when the extension is less than 4 digits. It will fill in the numbers from the right. so  1112224444 333  becomes  11-221-244 3334   Any ideas? $$\sum_{n = 1}^\infty \frac{(-1)^n}{p_n}$$ where $p_n$ is the $n$th prime.  I have computed this to 10000 rather than infinity. My results suggest that convergence does happen but it's very slow. But I can't even be sure about the first few digits: $-0.26959$?  I have looked at the "questions that may already have your answer" and some of the "similar questions," but they involve somewhat different formulas. Why are there unwanted white lines appearing in a PDF print proof? I designed a christmas card and I normally print it on vista print.  When I ask for a print proof the outlines show. They don’t show when I print it at home.  Why are there unwanted white lines appearing in this PDF print proof and how can I solve this problem? Is there any way to deserialize JSON into an object using JSON.deserialize if some of the property names in the JSON are reserved words in apex? I want to do something like this:  string jsonString = '{"currency" : "ABC"}'; public class JSONResult {     public string currency; } JSONResult res = (JSONResult) JSON.deserialize(jsonString, JSONResult.class); system.debug(res);   but of course I get an error that the identifier name is reserved. Defer SP.RequestExecutor.executeAsync I'm working on a SharePoint app where I need to run SP.RequestExecutor.executeAsync() in order to grab some information from one of the Host Web's lists. Depending on what method is calling the oData call I want to do something different.   Unfortuntely, executor.executeAsync() isn't playing as nice as $.ajax() does in terms of using $.when().done() and executing code after an async call is made. Below is some code if you'd like to see:      load = function (){         $.when(getEntries()).done(function () {             ViewModels.Calendar.addEventSource(ko.utils.unwrapObservable(eventList));         });     }      getEntries = function () {         return executor.executeAsync({             url: appweburl                 + "/_api/SP.AppContextSite(@target)/web/lists/getbytitle('" + LIST + "')/items?@target='" + hostweburl                 + "'&amp;$select=Title,OData__x006e_ot5,qnlu,OData__x0066_x20"                 + "&amp;$filter=OData__x0066_x20 eq '" + ViewModels.Person.user.userName() + "' "                 + "and qnlu ge DateTime'" + startDate().toString("yyyy-MM-dd") + "T00:00:00' "                 + "and qnlu le DateTime'" + endDate().toString("yyyy-MM-dd") + "T00:00:00' ",             method: "GET",             headers: { "Accept": "application/json; odata=verbose" },             success: onGetEntriesSuccess,             error: onoDataCallFailure          });     },      onGetEntriesSuccess = function (data) {         var jsonObject = JSON.parse(data.body);         $.each(jsonObject.d.results, function (index, item) {             eventList.push(new Event(item.qnlu, item.OData__x006e_ot5));         });     },      onoDataCallFailure = function (data, errorCode, errorMessage) {         alert('Failed to get host site. Error:' + errorMessage);     };   Any ideas/suggestions would be appreciated. When I run the command to install the package solr-jetty, I am told   You don't have enough free space in /var/cache/apt/archives/   Here's the result of the df -H command:    I have installed Ubuntu with VirtualBox on my Mac.  How can I fix this problem? Webform redirect I'd like to do something pretty straightforward: After user fills out a , I'd like a button that simply redirects them to a URL (in this case it's to a demo sandbox). Of course I'd want the user to fill in their info to capture for lead-generation purposes. My  is set up correctly in that it correctly captures all the user fields and submits them to me via email. However, upon completion "click" I'd like to have the user redirected to a determined internal URL www.mysite.com/foo  I can't figure out how this is done with the vanilla webform settings. Am I missing something obvious? I remember that a couple of years ago a friend showed me and some other people the following expression:  $$\lim_{n\to \infty}\frac{1^n+2^n+\cdots+(n-1)^n}{n^n}.$$  As shown below, I can prove that this limit exists by the monotone convergence theorem. I also remember that my friend gave a very dubious "proof" that the value of the limit is $\frac{1}{e-1}$. I cannot remember the details of the proof, but I am fairly certain that it made the common error of treating $n$ as a variable in some places at some times and as a constant in other places at other times. Nevertheless, numerical analysis suggests that the value my friend gave was correct, even if his methods were flawed. My question is then:  What is the value of this limit and how do we prove it rigorously?  (Also, for bonus points, What might my friend's original proof have been and what exactly was his error, if any?)  I give my convergence proof below in two parts. In both parts, I define the sequence $a_n$ by $a_n=\frac{1^n+2^n+\cdots+(n-1)^n}{n^n}$ for all integers $n\ge 2$. First, I prove that $a_n$ is bounded above by $1$. Second, I prove that $a_n$ is increasing.   (1) The sequence $a_n$ satisfies $a_n&lt;1$ for all $n\ge 2$.  Note that $a_n&lt;1$ is equivalent to $1^n+2^n+\cdots+(n-1)^n&lt;n^n$. I prove this second statement by induction. Observe that $1^2=1&lt;4=2^2$. Now suppose that $1^n+2^n+\cdots+(n-1)^n&lt;n^n$ for some integer $n\ge 2$. Then  $$1^{n+1}+2^{n+1}+\cdots+(n-1)^{n+1}+n^{n+1}\le(n-1)(1^n+2^n+\cdots+(n-1)^n)+n^{n+1}&lt;(n-1)n^n+n^{n+1}&lt;(n+1)n^n+n^{n+1}\le n^{n+1}+(n+1)n^n+\binom{n+1}{2}n^{n-1}+\cdots+1=(n+1)^{n+1}.$$  (2) The sequence $a_n$ is increasing for all $n\ge 2$.  We must first prove the following preliminary proposition. (I'm not sure if "lemma" is appropriate for this.)  (2a) For all integers $n\ge 2$ and $2\le k\le n$, $\left(\frac{k-1}{k}\right)^n\le\left(\frac{k}{k+1}\right)^{n+1}$.  We observe that $k^2-1\le kn$, so upon division by $k(k^2-1)$, we get $\frac{1}{k}\le\frac{n}{k^2-1}$. By , we may find:  $$\frac{k+1}{k}\le 1+\frac{n}{k^2-1}\le\left(1+\frac{1}{k^2-1}\right)^n=\left(\frac{k^2}{k^2-1}\right)^n.$$  A little multiplication and we arrive at $\left(\frac{k-1}{k}\right)^n\le\left(\frac{k}{k+1}\right)^{n+1}$.  We may now first apply this to see that $\left(\frac{n-1}{n}\right)^n\le\left(\frac{n}{n+1}\right)^{n+1}$. Then we suppose that for some integer $2\le k\le n$, we have $\left(\frac{k}{n}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}$. Then:  $$\left(\frac{k-1}{n}\right)^n=\left(\frac{k}{n}\right)^n\left(\frac{k-1}{k}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}\left(\frac{k}{k+1}\right)^{n+1}=\left(\frac{k}{n+1}\right)^{n+1}.$$  By backwards (finite) induction from $n$, we have that $\left(\frac{k}{n}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}$ for all integers $1\le k\le n$, so:  $$a_n=\left(\frac{1}{n}\right)^n+\left(\frac{2}{n}\right)^n+\cdots+\left(\frac{n-1}{n}\right)^n\le\left(\frac{2}{n+1}\right)^{n+1}+\left(\frac{3}{n+1}\right)^{n+1}+\cdots+\left(\frac{n}{n+1}\right)^{n+1}&lt;\left(\frac{1}{n+1}\right)^{n+1}+\left(\frac{2}{n+1}\right)^{n+1}+\left(\frac{3}{n+1}\right)^{n+1}+\cdots+\left(\frac{n}{n+1}\right)^{n+1}=a_{n+1}.$$  (In fact, this proves that $a_n$ is strictly increasing.) By the monotone convergence theorem, $a_n$ converges.  I should note that I am not especially well-practiced in proving these sorts of inequalities, so I may have given a significantly more complicated proof than necessary. If this is the case, feel free to explain in a comment or in your answer. I'd love to get a better grip on these inequalities in addition to finding out what the limit is.  Thanks! What is bracketing? I have seen this term a lot and I was wondering what, in basic terms, what bracketing/autobracketing is.  Also, why would one want to 'bracket'?  P.S. - there are other questions asking what DoF and WB bracketing is but none asking quite the same as this. What's a word for lack of confidence? We've all wanted to express certain questions, rhetorical or not, with annoyance, excitement, surprise, frustration and so on. What better way than with both a question mark (?) and an exclamation mark (!), right? I've seen two ways of punctuating such questions:  Where is this place?!    Who do you think you are!?  (Things like ?!?, !?!, ?????!!!!!, ??!?!!?!?!!??, etc are irrelevant here.) Which is the proper way to order the two symbols? Or does each of the above two have a distinct and grammatically correct meaning? Or is the interrobang (‽) the clear winner here? ;) Show that $n$ lines separate the plane into $\frac{n^2+n+2}{2}$ regions Show that $n$ lines separate the plane into  $\frac{n^2+n+2}{2}$ regions if no two of these lines are parallel and no three pass through a common point.   I know we start with the base case, where, if we call the above equation P(n), P(0), for 0 lines would be 0.  But I really have no idea how to begin the inductive step.  How do we know what k+1 we're supposed to arrive at?  Thanks! iPhone Storage Space Inaccuracy (No Storage Space) What is the right way to indent your source code? Deriving the inverse of a 2x2 matrix Writing in bash while it is working When you are performing time consuming operations in bash like installing new software, is it possible to write text that will appear at the prompt when the operation has finished.  E.g   Imagine running:  apt-get install eclipse-platform   Then it will use quite a while to finish while you see the installation log, meanwhile I want to create new folders (workspaces) which Eclipse later will use.  Is this possible without opening a new terminal (or tab)? I forgot my password of a TrueCrypt file I used a few years ago.  How would I go about 'cracking' it? I'm not sure if there is a way to attack it or if it can only be done by brute-force. I used it on a Mac. I still have the Mac I used it on, but of course turned that off many times since I used it.   I have a passphrase that I thought would relate to this file. Maybe I used some variant of it. But might be something completely different. I have some other words that I might have used, but would need give it another thought how I could have used those.  Is there an automated way to test variations on what I think the passphrase was to regain access to the volume? Is there any other way I might regain access? Do reroll and dice-adding abilities work on critical hits and critical failures? Tilde (~) File in Macintosh Directory Last night I discovered what looks like an unusual file named "~" (tilde) in the root of my "Macintosh HD" directory on my MacBook.    Finder reports the file is 2.2MB in size, of kind "TextEdit.app Document", and was created on 22nd January 2014 (so about a month ago).  I haven't noticed any operational issues with OS X or it's applications.   I haven't yet touched the file but would obviously like to remove it.  I am very conscious that '~' is a special alias to the user home directory and thus I would appreciate any recommendations in removing the file in a safe manner that isn't likely to nuke my home directory or screw up the operation of applications or OS X. I don't know whether to delete or rename and whether to use Finder or the command line.   It's entirely possible that I created the file by accident since I've recently been drafting and running various shell scripts that use the ~, user home alias.  MacBook Pro 15" (Retina, Mid 2012) Yosemite I shall assume that the sun is at rest, so before the half mass disappear, the orbit of earth is an ellipse.