I have a login page that is absolutely centered in the middle of the page both horizontally and vertically.  Inside there are 2 divs, smaller pink one and bigger blue one.  How can I center the bigger one?    .container {     background: rgba(249, 249, 249, 1);     bottom: 0;     box-shadow: 0 4px 8px 0 rgba(0, 0, 0, 1), 0 0px 4px 0 rgba(0, 0, 0, 1);     height: 342px;     height: max-content;     left: 0;     margin: auto;     padding: 60px 30px 60px 30px;     position: absolute;     right: 0;     top: 0;     width: 300px;     overflow: visible;  } .smaller {     background: pink; } button {     background: linear-gradient(rgba(239, 83, 80, 1), rgba(179, 47, 47, 1));     border: 0;     color: rgba(255, 255, 255, 1);     margin: 10px;     padding: 8px 70px 8px 20px;     box-sizing: content-box;     width: 50px; } .bigger {     width: 400px;     text-align: center;     background: blue } &lt;div class="container"&gt;   &lt;div class="smaller pink"&gt;     &lt;h2&gt;Sign In&lt;/h2&gt;     &lt;input&gt;   &lt;/div&gt;   &lt;div class="bigger blue"&gt;     &lt;button&gt;Back&lt;/button&gt;&lt;button&gt;Login&lt;/button&gt;   &lt;/div&gt; &lt;/div&gt;
How can I horizontally center a &lt;div&gt; within another &lt;div&gt; using CSS? &lt;div id=&quot;outer&quot;&gt;   &lt;div id=&quot;inner&quot;&gt;Foo foo&lt;/div&gt; &lt;/div&gt;
How can slightly blurred photos be improved in post processing? Suppose that $(s_n)$ converges to s. Prove that $(s_n^2)$ converges to $s^2$ I am really struggling with my proofs class, I don't really understand how to prove a statement like this, or what the epsilon is standing for..  Suppose that $(s_n)$ converges to s.  Prove that $(s_n^2)$ converges to $s^2$ directly without using the fact that $lim(s_nt_n)=st$  Suppose that $(s_n)$ converges to s. Then, since $(s_n)$ is convergent, there exists an $M_1$ such that $|S_n|&lt;M_1$, for all $n\in \!\,\mathbb{N} \!\,$. Let $M=M_1+|S|$ (I don't completely understand this step...). Then given $ε&gt;0$, there exists N such that n>N implies that $|s_n-s|&lt;ε/M$. Thus for n>N, we have $|s_n^2-s^2|=|s_n-s|*|s_n+s|&lt;(ε/M)(M)=ε$. Hence, $s_n^2$ converges to $s^2$. How can i use ArcGIS server 10 mapservices in OpenLayers2? Multiple one to many relationships in series I am making a DB for storing reports that have following fields:  Ad_system, Ad_Campaing, Ad_Group, Keyword, Date, Impressions, Clicks, Conversions   Logic is that, Ad_system can have multiple Ad_Campaings, Ad_Campaing can have multiple Ad_Groups and Ad_Groups can have multiple Keywords, and for every Keyword there is a report. Should It be like this? Because it kind of makes sense to me, but it doesn't look correct. Primary key can also be:  ad.system.name for first table  ad.system.name ad.campaing.name for second table  ad.system.name ad.campaing.name ad.group.name for third table  ad.system.name ad.campaing.name ad.group.name keyword for fourth table  They will always be unique, but then Report will always have all DB columns in it, so it's kind of redundant.  Is the approach that I have in the diagram below correct? Or is a better one what I just described? If I am not mistaken both should satisfy 3rd NF. maximum of two uniform distributions I have a question. Let's suppose that the two random variables $X1$ and $X2$ follow two Uniform distributions that are independent but have different parameters:  $X1 \sim Uniform(l1, u1)$  $X2 \sim Uniform(l2,u2)$  If we define X3 as the maximum of X1, and X2, i.e., $X3 = max(X1, X2)$, what kind of distribution would it be? It is certainly not a uniform and I can calculate the cumulative probability, i.e., $p(X3 &lt;= a)$, because $p(X3 &lt;= a) = p(X1 &lt;= a) p(X2 &lt;= a)$. But, I wonder if there exists any density function that can model X3. Using the Fitch system, how do I prove $((p \implies q) \implies p)\implies p$? Using the Fitch system, how do I prove $((p \implies q) \implies p)\implies p$? I started with the hypotheses $(p \implies q) \implies p$ and $\sim p$. However, from these hypotheses I did not get the desired contradiction to solve the question.  Thanks sb45 How to use hook_node_presave to change field's value Can't move/snap Nautilus window to occupy left or right half of the 1366x768 screen - is it just me? I'm running Ubuntu 18.04 LTS with GNOME Shell. Nautilus does not want to occupy 50% (left or right) of the screen sized at 1366x768.    Other applications (such as GNOME Terminal, Eye of GNOME, Gedit) are normally snapping to the left/right half of the screen.  But Nautilus can be resized to the width lower than half of screen (I can get 650 px, which is smaller than 1366/2 = 683 px).  The first usable screen resolution seems to be 1400x1050, then goes 1440x900. But large amount of current devices .  Is it just me?     Updates: 1. standard shortcut Super+← or Super+→ do not work too. 2. I reported  which has linked upstream . 3. It does not work on GNOME FlashBack session too. I had an little issue when loggin in with Safari on Mac OS X (El Capitan).   When entering the password in Safari, there is a key symbol that lets you choose among any password that is stored in your keychain. This button interferes with the "forgot?" button that Stack Exchange adds and you can't press the Safari button.     Please move this "forgot?" button below the text field, like most other sites implement this. VirtualBox Toolbar is hidden! How to show it? A different approach in distributing $8$ distinct balls into $6$ distinct boxes Find the number of ways in distributing $8$ distinct balls into $6$ distinct boxes such that there is at least $1$ ball in each box.  We are well acquainted with the traditional Inclusion-Exclusion principle in solving this and it will come up as $191520$ ways.  I tried in this way:  When we distribute $8$ balls into $6$ boxes we have two possible cases  Case $1.$ There are exactly $2$ boxes with $2$ balls each  Case $2.$ There is exactly $1$ Box with $3$ balls in it.  For Case $1$, the distribution is done by choosing $2$ boxes from $6$ boxes and $2$ balls from $8$ balls and those two balls can be arranged in $2!$ ways. But I require another two balls from remaining $6$ balls to be placed in each of these two boxes which can be done in $\binom{6}{2} \times 2!$ ways. Finally remaining $4$ balls can be distributed in remaining $4$ boxes in $4!$ ways. So total number of ways for Case $1.$ is  $$\binom{6}{2} \times \binom{8}{2} \times 2! \times \binom{6}{2} \times 2! \times 4!=604800$$  For Case $2$, the number of ways is  $$\binom{6}{1} \times \binom{8}{3} \times 5!=40320$$  I am pretty sure the value obtained for Case $2.$ is correct. but I could not find where I went wrong in Case $1.$ Is there a way to convert number words to Integers? I need to convert one into 1, two into 2 and so on.  Is there a way to do this with a library or a class or anything? How to reinstall kernels after accidental deletion with a separate boot partition and an encrypted LVM volume? I think there's an unintended motivation for users to post questions to higher-traffic Stack Exchange sites rather than their more specific or appropriate lower-traffic ones.  I think I have a solution.  What motivated this suggestion for me was that I am confident that if users were to post Android design questions to  beta and/or , that they would likely not be noticed by the appropriate audience compared to the vast army of Android experts here on Stack Overflow.    There are plenty of Android questions on SO that really should be on one or both of the aforementioned sites.  Presently there is little motivation for users to start questions like this on the appropriate site.  Is there something we could do to cross-pollinate related sites?  For instance, what if we let certain tags span certain sites?  Obviously the selection would be controlled by high-reputation users.   There could also be a feature to show (or explicitly hide) certain questions from other sites regardless of the tags.  This could be controlled by lower-reputation users than the global tag since it wouldn't have much statistical impact.  For instance, the android-layout tag could by default span sites, but OPs and other users could eliminate from the Graphic Design site questions that are of a purely technical nature.  Users interested in Android tagged questions would see related questions on design and UE sites--whether they are searching, posting, or viewing a question through the related items.  This would help eliminate cross-site duplicates, and encourage people to post on the correct site in the first place.   For related question lists and search results, there could even be a specific cross-site icon  next to an off-site question to show that it's from UX, for example. How do I determine whether or not two lines intersect, and if they do, at what x,y point? Does there exist a bijective $f:\mathbb{N} \to \mathbb{N}$ such that $\sum f(n)/n^2$ converges? We know that $\displaystyle\zeta(2)=\sum\limits_{n=1}^{\infty} \frac{1}{n^2} = \frac{\pi^2}{6}$ and it converges.        Does there exists a bijective map $f:\mathbb{N} \to \mathbb{N}$ such that the sum $$\sum\limits_{n=1}^{\infty} \frac{f(n)}{n^2}$$ converges.      If our $s=2$ was not fixed, then can we have a function such that $\displaystyle \zeta(s)=\sum\limits_{n=1}^{\infty} \frac{f(n)}{n^s}$ converges Is space expanding equally in every direction? Does space expand equally in every direction, so that it draws a perfect sphere or is expansion asymmetric, so it creates "bubbles" (when seen from the outside)? Please add a system to allow file uploads attached to questions and answers I posted a question and a couple of respondents asked for the source code. I could only post portions of the code.  If attachments were allowed I could have uploaded a .zip file with the whole application.  Will this be a feature in SO? A Banach space is reflexive if and only if its dual is reflexive How to show that a Banach space $X$ is reflexive if and only if its dual $X'$ is reflexive? Calling C/C++ from Python?