How to fix lifted text in cell
Vertical alignment in table: m-column, row size - problem in last column
How to make mesh lights work in Blender Eevee? The closest I can get to making mesh lights affect their environment in Blender Eevee is giving them an Emission material and turning on "Bloom". But this isn't emitting proper light, it just looks like it is, but it doesn't light the surroundings whatsoever.     I would like to be able to light a scene with meshes without having to put point lamps everywhere just to make them emit light. UTF-8 -> ASCII in C language Can you fly over a Medium enemy creature in a 10ft tall corridor? Destroying a spammer does not delete their comments I did a fresh install of Ubuntu 16.04. /dev/md1 contains an ext4 filesystem that is mounted at /:  /dev/md1 on / type ext4 (rw,relatime,data=ordered)   Now I want to set the automatic filesystem check interval to one month, but I'm getting a strange error that I find no useful information about:  &gt; tune2fs -i 1m /dev/md1 tune2fs 1.42.13 (17-May-2015) tune2fs: Filesystem has unsupported read-only feature(s) while trying to open /dev/md1 Couldn't find valid filesystem superblock.   Rebooting didn't help. On another machine running Ubuntu 12.04, the same command works like a charm.  Does anyone have an idea what's wrong?  The command tune2fs -l /dev/md1 works fine, by the way. Here is its output:  tune2fs 1.42.13 (17-May-2015) Filesystem volume name:   &lt;none&gt; Last mounted on:          / Filesystem UUID:          38366a40-bbe1-476b-acfe-d271be6335eb Filesystem magic number:  0xEF53 Filesystem revision #:    1 (dynamic) Filesystem features:      has_journal ext_attr resize_inode dir_index filetype needs_recovery extent 64bit flex_bg sparse_super large_file huge_file dir_nlink extra_isize metadata_csum Filesystem flags:         signed_directory_hash Default mount options:    user_xattr acl Filesystem state:         clean Errors behavior:          Continue Filesystem OS type:       Linux Inode count:              8380416 Block count:              33521664 Reserved block count:     1676083 Free blocks:              32419430 Free inodes:              8312762 First block:              0 Block size:               4096 Fragment size:            4096 Group descriptor size:    64 Reserved GDT blocks:      1024 Blocks per group:         32768 Fragments per group:      32768 Inodes per group:         8192 Inode blocks per group:   512 Flex block group size:    16 Filesystem created:       Thu May 31 10:01:27 2018 Last mount time:          Thu May 31 10:49:41 2018 Last write time:          Thu May 31 10:15:14 2018 Mount count:              7 Maximum mount count:      -1 Last checked:             Thu May 31 10:01:27 2018 Check interval:           0 (&lt;none&gt;) Lifetime writes:          5782 MB Reserved blocks uid:      0 (user root) Reserved blocks gid:      0 (group root) First inode:              11 Inode size:               256 Required extra isize:     32 Desired extra isize:      32 Journal inode:            8 First orphan inode:       4325378 Default directory hash:   half_md4 Directory Hash Seed:      9d55d989-2c2b-4ad8-a29e-53c8798ec68e Journal backup:           inode blocks Checksum:                 0x3d9f8d23 sum pair of columns based on matching fields It is quite easy to calculate the total number of functions from a set $X$ with $m$ elements to a set $Y$ with $n$ elements ($n^{m}$), and also the total number of injective functions ($n^{\underline{m}}$, denoting the falling factorial). But I am thinking about how to calculate the total number of surjective functions $f\colon X \twoheadrightarrow Y $.  The way I thought of doing this is as follows: firstly, since all $n$ elements of the codomain $Y$ need to be mapped to, you choose any $n$ elements from the $m$ elements of the set $X$ to be mapped one-to-one with the $n$ elements of $Y$. This results in $n!$ possible pairings. But the number of ways of choosing $n$ elements from $m$ elements is $\frac{m!}{(m-n)!\,n!}$, so the total number of ways of matching $n$ elements in $X$ to be one-to-one with the $n$ elements of $Y$ is $\frac{m!}{(m-n)!\,n!} \times n! = \frac{m!}{(m-n)!}$.  Now we have 'covered' the codomain $Y$ with $n$ elements from $X$, the remaining unpaired $m-n$ elements from $X$ can be mapped to any of the elements of $Y$, so there are $n^{m-n}$ ways of doing this. Therefore I think that the total number of surjective functions should be $\frac{m!}{(m-n)!} \, n^{m-n}$.  Is this anything like correct or have I made a major mistake here? What is the current URL to create a new Google Document please? Since Google last updated their Docs the old URL does not work. Draw ellipses with different coloring for their intersection in tikz? How do I color intersection of two ellipses in different color. For instances, the ellipses should themselves be colored as yellow and their intersection as red. My code for drawing ellipses is given below  \draw (-4,0) ellipse (8 and 3); \draw (8,0) ellipse (8 and 3);   UPDATE: In the comments to individual answers, I have requested to show it for three ellipses. Display Blank when Referencing Blank Cell in Excel 2010 "Will + be + verb -ing)" vs "Will + verb" ? Can someone explain me the constructions (or however they are called) with the "Will + be + verb -ing)" and the "Will + verb" ? I've been looking for a simple regex for URLs, does anybody have one handy that works well?  I didn't find one with the zend framework validation classes and have seen several implementations. When I restart httpd, I get the following error.  What am I missing?  [root@localhost ~]# service httpd restart Stopping httpd:                                            [  OK  ] Starting httpd: Syntax error on line 22 of /etc/httpd/conf.d/sites.conf: Invalid command 'SSLEngine', perhaps misspelled or defined by a module not included in the server configuration   I have installed mod_ssl using yum install mod_ssl openssh  Package 1:mod_ssl-2.2.15-15.el6.centos.x86_64 already installed and latest version Package openssh-5.3p1-70.el6_2.2.x86_64 already installed and latest version   My sites.conf looks like this  &lt;VirtualHost *:80&gt; #    ServerName shop.itmanx.com     ServerAdmin webmaster@itmanx.com      DocumentRoot /var/www/html/magento     &lt;Directory /var/www/html&gt;         Options -Indexes         AllowOverride All     &lt;/Directory&gt;      ErrorLog logs/shop-error.log     CustomLog logs/shop-access.log &lt;/VirtualHost&gt;  &lt;VirtualHost *:443&gt;     ServerName secure.itmanx.com     ServerAdmin webmaster@itmanx.com      SSLEngine on     SSLCertificateFile /etc/httpd/ssl/secure.itmanx.com/server.crt     SSLCertificateKeyFile /etc/httpd/ssl/secure.itmanx.com/server.key     SSLCertificateChainFile /etc/httpd/ssl/secure.itmanx.com/chain.crt      DocumentRoot /var/www/html/magento     &lt;Directory /var/www/html&gt;         Options -Indexes         AllowOverride All     &lt;/Directory&gt;      ErrorLog logs/shop-ssl-error.log     CustomLog logs/shop-ssl-access.log     &lt;/VirtualHost&gt; for loop in Java runs 3 times before taking next input Compute $P(X_1+\cdots+X_k\lt 1)$ for $(X_i)$ i.i.d. uniform on $(0,1)$ Consider $N=\min\{n: S_n&gt;1\}$, where $S_n=X_1+\cdots+X_n$ and $(X_i)_{i=1}^\infty$ is i.i.d. uniform on $(0,1)$. So, $N$ is the first time that $(S_n)_{n=1}^\infty$ crosses $1$. I'd like to calculate $E(N)$. To this end I'd like to calculate $\Pr(N\gt k)=\Pr(S_k\lt 1)$.  Is there a way to actually do this for any arbitrary $k$? I mean, certainly there is as I know about the distribution of $S_n$ but the formula is just formidable when you move with $k$ toward $\infty$ and even though tractable with a computer, I don't think it's tractable without it.  Is there maybe a better way to calculate the expectation? Thanks for any help. Somewhere on Stack Exchange I saw the equation     $$\gcd(2^m-1,2^n-1)=2^{\gcd(m,n)}-1.$$   I had never seen this before, so I started trying to prove it. Without success...  Can anyone explain me (so actually prove) why this equation is true?  And can we say the same when replacing the '$2$' by any integer number '$a$'? I can't install gnome schedule on Ubuntu 16.04 I would like to install gnome-schedule in my recent Ubuntu 16.04 but I can't find the how. It is not in ubuntu software and if I type sudo apt-get install gnome-schedule, I get it's not found. I would like to use it because I find it quick and easy to use. I've been looking for alternatives but instead of "when" which I don't like, I can't find anything else, so help is welcome. In Windows, 'removable' drives cannot be partitioned, without the partitions not appearing and receiving drive letters, apart from the first partition.  Partitioned flash drives work fine in Linux.  What I want to do is partition a 8GB flash drive into two, with the first partition containing various boot disc images, which can be selected to boot from, and have various portable apps, documentation, utilities, scripts, etc, on the other partition.  I currently do this using two separate flash drives, but I want to be able to use a single flash drive for everything, which I keep on my keyring.  It is not possible to do this without having at least two partitions, as the ISO boot selector for the boot disc images will not work otherwise.  I know there is a method where you can flip a bit, using Lexar's USB Format Tool, which fools Windows into thinking that the partitions are on a fixed hard drive.  However, this apparently makes it difficult to eject the flash drive.  Flash drives with  from SanDisk had two partitions, presenting itself to the host system as a USB hub with a CD drive and standard USB mass storage device attached.  This is what I would like to emulate, if possible. Why is main() in java void? In the case of languages with a C-like syntax, we declare the main() method to return an int or float value (or void).  Is it possible to declare a non-void return type from main() in Java?  If not, then why not?  Does this mean that a Java program doesn't return any value to the OS? Why is $H(k\mathbin\Vert x)$ not a secure MAC construction? If $H(m)$ is a secure hash function, can't we implement a MAC using $H(k\mathbin\Vert m)$?  However, it seems the more widely used MACs, such as NMAC and  (both originally defined in ) use a much more complicated scheme. Why is this concatenation scheme insecure?