I need help with the following sentence that I've encountered on the Wikipedia page titled "Literal and figurative language."     His cheeks were like roses, his nose like a cherry...   Another example (from engVid Youtube video):     I have one idea, I have another idea, but they are very much   connected.   Can somebody please support or disprove such an exception to the comma splice rule (when you list ideas or something like that).  PS If you say that "his nose like a cherry" is not an independent clause, then if the first sentence were to be written as follows:     His cheeks were like roses, his nose was like a cherry...   would the comma still be acceptable/correct?
Is this sentence acceptable?     You’re welcome, have a nice day ahead.
Is it possible to have 2 git repositories in one directory?  I'd think not, but thought I'd ask.  Basically, I'd like to check in my home directory config files (e.g. .emacs) which should be common across all of the machines I work on, but have a second repository for local files (e.g. .emacs.local), which contains machine-specific configurations.  The only way I can think of to do that is to have the local config in a subdirectory and ignore that subdirectory from the main git repository.  Any other ideas? Is it possible to search for down voted questions? BGE everything white in playmode When I press P to play everything shows up white in the BGE. Shading is set to GLSL, and the objects are UV mapped and textured. It seems that vertex paint is overriding the material for the object even though it is unchecked in the material options.   Shading is set to GLSL   Objects have a texture applied Small snap loop devices visible in gnome-disk-utility OR what is the function of snap ubuntu-core An equivalence relation is defined by three properties: reflexivity, symmetry and transitivity.  Doesn't symmetry and transitivity implies reflexivity? Consider the following argument.  For any $a$ and $b$, $a R b$ implies $b R a$ by symmetry. Using transitivity, we have $a R a$.  Source: Exercise 8.46, P195 of Mathematical Proofs, 2nd (not 3rd) ed. by Chartrand et al Which answer do I accept if I have multiple correct answers? I asked  that turned out to have multiple correct answers. How do I pick between them to determine which to accept?  All of the answers were different. They were not the same answer given multiple times. $L^p$ spaces and counting measure currently I am working on the following two exercises as a revision for my exam.  Let $\mu$ be the counting measure on $\mathbb N$.   Show that if $1 \le p &lt; s &lt; \infty$ then $f \in L^p$ implies $f \in L^s$ and $\|f\|_s \le \|f\|_p$. Show that if $f \in L^p$ for some $p \ge 1$ then $\lim_{s \to \infty} \|f\|_s = \|f\|_\infty$.   My attempts so far:   It is $f \in L^s$ iff $\sum_{k = 1}^\infty |f(k)|^s$ converges. Since $f \in L^p$ we know that $\sum_{k = 1}^\infty |f(k)|^p$ converges. Thus for any $\varepsilon &gt; 0$ there is $N \in \mathbb N$ s.t. \begin{align*} k \ge N \Longrightarrow |f(k)|^p &lt; \varepsilon \Longrightarrow |f(k)| &lt; \varepsilon^{1/p} \end{align*} We have $\forall k \ge N$ that $|f(k)|^s &lt; \varepsilon^{s/p}$. Originally I wanted to use the comparison test now, showing that \begin{align*} \sum_{k = N}^\infty \varepsilon^{s/p} &lt; \infty, \end{align*} but that does not work since \begin{align*} \sum_{k = N}^\infty \varepsilon^{s/p} = \varepsilon^{s/p} \underbrace{\sum_{k \ge N} 1}_{= \infty},  \end{align*} so I don't know how to go on here. Let $K := \|f\|_\infty$. We need to show that $\forall \varepsilon &gt; 0$ $\exists M \in \mathbb N$ s.t. \begin{align*} s \ge M \Longrightarrow \left|\left(\sum_{k = 1}^\infty |f(k)|^s\right)^{1/s} - K\right| &lt; \varepsilon. \end{align*} Choose $M$ s.t. $M &gt; p$. Then $s &gt; p$ and from part (i) we know that \begin{align*} \left(\sum_{k = 1}^\infty |f(k)|^s\right)^{1/s} \le \left(\sum_{k = 1}^\infty |f(k)|^p\right)^{1/p}. \end{align*} But how can I use this? Regarding ,  it is not possible to combine complex powers in the usual way:  $$ (x^y)^z = x^{yz} $$  There was mention of multi-valued functions, is there some theory that makes this all work out correctly? Is the motivation behind the introduction of measure theory the Lebesgue integral? In order to evaluate such an integral we need the length of each of the horizontal strip of width $h$. I have a question here. Why do we need such a general concept of measure? Length is a kind of measure, but why did Lebesgue think of so general a concept of "measure" when he just needed the length to evaluate his integrals? Is there any other motivation behind this ? A novel where a woman from "future" of 1999 speaks leet-speak Getting HTTP/2 Working on Apache 2.4.29 on Debian 8 I am trying to update my apache2 (Apache/2.4.29 (Debian 8)) server to support http2 but after enabling http2   with following code, it does not work because of mpm_prefork does not support http2  &lt;IfModule http2_module&gt;     ProtocolsHonorOrder On     Protocols h2 h2c http/1.1 &lt;/IfModule&gt;    since mpm_prefork apache (2.4.29)  does not work with http2, I tried using  mpm_event/mpm_worker but it does not work, so I enable mpm_prefork  sudo a2dismod mpm_event  sudo a2dismod mpm_worker  sudo a2enmod mpm_prefork   Since I am still running php5 what should I do to have http2 support on Debian8?  Will I have to update php5 to php7?  Is there any workaround to use mpm_worker/mpm_event with php5 with http2 support?  apache error log  [http2:warn] [pid 11992] AH10034: The mpm module (prefork.c) is not supported by mod_http2. The mpm determines how things are processed in your server. HTTP/2 has more demands in this regard and the currently selected mpm will just not do. This is an advisory warning. Your server will continue to work, but the HTTP/2 protocol will be inactive. [mpm_prefork:notice] [pid 11992] AH00163: Apache/2.4.29 (Debian) OpenSSL/1.1.0g configured -- resuming normal operations [core:notice] [pid 11992] AH00094: Command line: '/usr/sbin/apache2' Bash: Syntax Error on @() Update values in one table based on contents of another Software Name: Oracle SQL Developer Version 17.2.0.188  I have three tables: orders, order_details, and products.  I wanted to run a query to update units_in_stock in the products table based on quantity in order_details, where the associated orders row has been marked as shipped, and has a shipping date.  Here's what I tried:  UPDATE Products SET (Products.Unit_In_Stock = Products.Unit_In_Stock - Order_Details.Quantity) INNER JOIN (     Orders INNER JOIN Order_Details ON Orders.Order_ID = Order_Details.Order_ID     ) ON Products.Product_ID = Order_Details.Product_ID WHERE (         ((Orders.Shipped_Date) IS NOT NULL)         AND ((Orders.This_Order_Was_Shipped) = "YES")         );   When I run this, I get:  Error at Command Line : 1 Column : 45   Line 1, Column 45 is the equal sign in the very first statement that said  Products.Unit_In_Stock = Products.Unit_In_Stock - Order_Details.Quantity   Can you help me get this working? Indentation in tcolorbox package I'd like to have the same indentation within a tcolorbox as I have in the rest of the document.  How can I get it?  Thanks.  MWE:  \documentclass[a4paper]{book}  \usepackage{lipsum} \usepackage[most]{tcolorbox}  \begin{document}  \chapter{Example with \texttt{tcolorbox}} \lipsum[1-8]  \begin{tcolorbox}[breakable,enhanced] \lipsum[9-14] \end{tcolorbox}  \end{document}   The first block of text has the typical indentation, but that in the box doesn't. I know that $$\gcd(a^b-1,a^c-1)=a^{\gcd(b,c)}-1$$ which can be seen by expanding both terms into geometric series. Is there any such simplification for $$\gcd(a^b+1,a^c+1)=?$$  EDIT: When working with polynomials instead of whole numbers, it is $$gcd(x^n+1,x^m+1)=\begin{cases}a^{\gcd(n,m)}+1 &amp; \nu_2(n) =\nu_2(m)\\1 &amp;\text{else}\end{cases}$$ But this gives only a lower bound for the whole-number case. Gmail App in my Android device shows correctly all the labels that I created using Gmail through web interface.  Can I create new labels in Gmail on Android device using Gmail App?   Also, ideally, once I create these new labels in Gmail App, I obviously should be seeing the same in Web Interface of Gmail too (Sync!!).  Any ideas? Remote logging with Syslogd, can I change the hostname? I am running ddwrt v24-sp2 on three WRT54GL routers. These routers all send their syslog information to the same remote server using syslogd  The problem is that in the logs the hostname will change between the LAN IP and 127.0.0.1.  This makes it hard to tell which device is doing what when I have several events listed as localhost and makes it impossible to script events to happen when certain syslog messages are received.   Does anyone know of any way I can differentiate which message comes from which host? Is there some option I did not see to for a tag or extra information into the message. Can I force the host to send its hostname with each message?  Here is an example of the syslog output:     06-28-2010 11:43:57    User.Info   10.255.255.2    Jun 28 17:43:58 : >Connecting to *.*.*.*      06-28-2010 11:43:54    User.Info   127.0.0.1   Jun 28 17:43:54 : >Connecting to *.*.*.*       06-28-2010 11:43:52    Daemon.Info 10.255.255.1    Jun 28 17:43:53 >chillispot[428]: chilli.c: 1088: Rereading configuration file and doing DNS lookup      06-28-2010 11:43:51    Daemon.Info 127.0.0.1   Jun 28 17:43:52 >chillispot[623]: chilli.c: 1088: Rereading configuration file and doing DNS lookup      06-28-2010 11:43:51    Daemon.Info 10.255.255.3    Jun 28 17:43:51 >chillispot[4185]: chilli.c: 1088: Rereading configuration file and doing DNS lookup   thanks  Chris How to find out what's accessing a particular hard drive on Windows? Possible Duplicate:          My HDD on a dock just started making noises like it's being accessed but I don't see any program accessing it.  Is there a program that shows which HDD is accessed by which program in percentages similar to how the task manager shows which programs use the most CPU? I'm looking for a simple, easy to understand algorithm to alphabetically sort an array of characters in C. Proving $\sum_{k=0}^n(-1)^k\binom nk=0$