Let $[-a, a] \subset \mathbb{R}$ be an interval. Let $f: [-a, a] \rightarrow \mathbb{R}$ be a Riemann-integrable function such that $f(x) = f(-x)$ for all $x \in [-a, a]$. Let $b \in \mathbb{R}_+$.  Question: Is there a "good" way to simplify the integral $\int_{-a}^a \frac{f(x) + 1}{b^x+1} \,\mathrm dx$?
I have a question:     Suppose $f$ is continuous and even on $[-a,a]$, $a&gt;0$ then prove that   $$\int\limits_{-a}^a \frac{f(x)}{1+e^{x}} \mathrm dx = \int\limits_0^a f(x) \mathrm dx$$   How can I do this? Don't know how to start.
Proximal Operator Fixed Point Property for Matrices $\newcommand{\prox}{\operatorname{prox}}$ $\newcommand{\argmin}{\operatorname{argmin}}$ $\newcommand{\dom}{\operatorname{dom}}$  Recall again that the proximal operator for vectors $\prox_{f}: R^n \rightarrow R^n$ of $f$ is defined as:  $\prox_f(v) := \argmin_{x} \left(f(x) +(1/2)\|x-v\|_2^2 \right) $,  where $f: R^n \rightarrow R \cup \infty$ is a closed proper convex function and $\|\cdot \|_2$ is the Euclidean norm. $\prox$ is strongly convex and not everywhere infinite, so there it will have a unique minimizer for every $v \in R^n$  The crucial property of proximal operator is that $x^*$ minimizes $f(x)$ iff $x^* = \prox_f(x^*)$, i.e. $x^*$ is a fixed point of $\prox_f$.  Let us consider the proof of this property. The first part, namely, that if $x^*$ minimizes $f$ then $\prox_f(x^*)=x^*$, is trivial:  $f(x) +(1/2)\|x-x^*\|_2^2 \le f(x^*) = f(x^*) +(1/2)\|x^*-x^*\|_2^2$  The second part uses the notion of subdifferential. In the proof authors say that $\tilde{x}$ minimizes  $f(x) +(1/2)\|x-v\|_2^2$  i.e. $\tilde{x} = \prox_f(v)$ iff $0 \in \partial f(\tilde{x}) + (\tilde{x}-v)$,   where the sum is of a set and a point. Recall the definition of the subdifferential:  $\partial f(x) = \{ y$ |  $ f(z)\le f(x) + y^T(z-x)$ $\forall z \in \dom{f}\}$  Take $\tilde{x}=v=x^*$, it follows that $0 \in \partial f(x^*)$ so $x^*$ minimizes $f$.  Question 1:  Consider proximal operator defined for matrices now:  $\prox_f(Y) := \argmin_{X} \left(f(X) +(1/2)\|X-Y\|^2 \right)$,  where $X$ is some real $m$ by $n$ matrix. What norm function should be taken in the definition of the $\prox$ in this case? Frobenius? Or spectral norm (induced 2nd norm) which is the largest eigenvalue (is spectral norm even differentiable?)? Or something else?  Question 2:   Can the norm for the definition of $\prox$ in case of matrices be chosen in different ways? What conditions does the proof above impose on the norm function? Extract substring in Bash Given a filename in the form someletters_12345_moreleters.ext, I want to extract the 5 digits and put them into a variable.  So to emphasize the point, I have a filename with x number of characters then a five digit sequence surrounded by a single underscore on either side then another set of x number of characters.  I want to take the 5 digit number and put that into a variable.  I am very interested in the number of different ways that this can be accomplished. Scale camera to fit screen size unity My background and gameobjects are 2d sprites not UI images ,I want to know how to make my background scale with screen size and positions of 2d sprits on it don't change after building game (webGl) like scale canvas with screen size and anchor points in UI elements .  Before building the game   After building I'm building a quick csv from a mysql table with a query like:  select DATE(date),count(date) from table group by DATE(date) order by date asc;   and just dumping them to a file in perl over a:  while(my($date,$sum) = $sth-&gt;fetchrow) {     print CSV "$date,$sum\n" }   There are date gaps in the data, though:  | 2008-08-05 |           4 |  | 2008-08-07 |          23 |    I would like to pad the data to fill in the missing days with zero-count entries to end up with:  | 2008-08-05 |           4 |  | 2008-08-06 |           0 |  | 2008-08-07 |          23 |    I slapped together a really awkward (and almost certainly buggy) workaround with an array of days-per-month and some math, but there has to be something more straightforward either on the mysql or perl side.   Any genius ideas/slaps in the face for why me am being so dumb?    I ended up going with a stored procedure which generated a temp table for the date range in question for a couple of reasons:   I know the date range I'll be looking for every time The server in question unfortunately was not one that I can install perl modules on atm, and the state of it was decrepit enough that it didn't have anything remotely Date::-y installed   The perl Date/DateTime-iterating answers were also very good, I wish I could select multiple answers! I have come across a question about determining possible minimal polynomials for a rank one linear operator and I am wondering if I am using the correct proof method.  I think that the facts needed to solve this problem come from the section on Nilpotent operators from Hoffman and Kunze's "Linear Algebra".     Question: Let $V$ be a vector space of dimension $n$ over the field $F$ and consider a linear operator $T$ on $V$ such that $\mathrm{rank}(T) = 1$.  List all possible minimal polynomials for $T$.   Sketch of Proof:   If $T$ is nilpotent then the minimal polynomial of $T$ is $x^k$ for some $k\leq n$.  So suppose $T$ is not nilpotent, then we can argue that $T$ is diagonalizable based on the fact that $T$ must have one nonzero eigenvalue otherwise it would be nilpotent (I am leaving details of the proof of diagonalization but it is the observation that the characteristic space of the nonzero eigenvalue is the range of T and has dimension $1$).  Thus the minimal polynomial of $T$ is just a linear term $x-c$.    Did I make a mistake assuming that $T$ can have only one nonzero eigenvalue?  Thanks for your help pdflatex, \includegraphics, and multi-page PDF files I have a PDF file with multiple figures; each figure is a separate page in the PDF file.  I am using pdflatex, and I would like to use \includegraphics or equivalent to include some of the figures.  Of course I could use an external tool to split the PDF file into multiple one-page PDF files. Then I could use \includegraphics as usual. However, I would have a much simpler workflow if I could avoid this extra step. Hence the question:  How can I include, e.g., page 3 of foo.pdf as a figure?  I am aware that there is a Latex package called pdfpages, but it seems to be designed for something else: with pdfpages, each page in the input file will produce a full page in the final document, not just a box. Could someone advise me on how to determine all entire functions $f$ such that $|f'(z)| \leq |f(z)|, \forall z\ ?$  Hints will suffice, thank you. Clone internal HDD to new SSD I recently installed an SSD into my machine. The machine itself is a Lenovo thinkpad W520, and it previously had an internal HDD. I moved the internal HDD into an expansion bay (replacing the CD-ROM), and put the new SSD into the internal bay.   The problem I'm having is that I have my Ubuntu configuration EXACTLY the way I want it - I originally spent many hours configuring it to get it to the way it is now. I'd rather not do this again. But, I'd also like the boot-up gains I would get from the OS being on the SSD.  So, what I'd like to do is clone my Ubuntu partition onto the SSD. The catch is that the standard HDD is significantly bigger than the SSD. And it has a windows partition that I don't need on the SSD (I never use Windows, so if it boots off of the other hard drive, that's fine). The layout of my hard drives are as follows:  /dev/sda (SSD):     Model: ATA M4-CT256M4SSD2 (scsi)     Disk /dev/sda: 256GB     Sector size (logical/physical): 512B/512B     Partition Table: msdos  Number  Start   End    Size   Type     File system  Flags  1      1049kB  147GB  147GB  primary  ext4         boot   /dev/sdb (HDD): Model: ATA ST9500420AS (scsi) Disk /dev/sdb: 500GB Sector size (logical/physical): 512B/512B Partition Table: msdos  Number  Start   End     Size    Type      File system     Flags  1      1049kB  1259MB  1258MB  primary   ntfs            boot  2      1259MB  269GB   268GB   primary   ntfs  4      269GB   483GB   214GB   extended  5      269GB   416GB   147GB   logical   ext4  7      416GB   475GB   58.9GB  logical   linux-swap(v1)  6      475GB   483GB   8470MB  logical  3      483GB   500GB   16.8GB  primary   ntfs   What I've tried so far:  1) Resizing the partitions /dev/sdb5 and /dev/sda1 to be the same size. 2) Booting into Ubuntu 11.04 (from /dev/sdb5) and running dd if=/dev/sdb5 of=/dev/sda1 (of course this causes problems with booting, so I had to reinstall grub.. I can get it to boot, but then I have problems with initrd not finding some files ... presumably it can't load some partitions I think).  Now, I think those two steps are the wrong approach, because it will clone /dev/sdb5 EXACTLY - including references in fstab which point to the wrong hard drive. I'm not sure exactly how to rectify this. I could install Ubuntu 11.04 onto the SSD, then try and copy over all of my configurations, but I'm concerned that I'm going to lose something, or that I'm going to overwrite something like fstab that points back to the original hard drive.   Note that currently, I can still boot from the HDD, so it's not imperative that I get this figured out right away, but I do want it to be exactly how it is right now, so that I can maintain my current level of productivity (it's a work laptop).  Suggestions on how I might be able to overcome this difficulty?   Thanks in advance! The two causes for the factor 2 in Coriolis effect While reading this document on Coriolis effect , I saw the followig sentence     Two kinematic effects each contribute half of the Coriolis acceleration: relative velocity and the turning of the frame of reference.    And this is the reason why Coriolis term has that factor $2$. Unfortunately it does not specify anything about this two causes. Does anyone have some further explanation for how "relative velocity" and "turning of the frame" actually give rise to the Coriolis term? I have a database which contains 5 tables. Each table contains 24 rows and each row contains 4 columns.  I want to display these records in Excel sheet. The heading of each table is the name of the table, but I am unable to merge the columns for heading.  Please help me. I'm suppose to prove the following...  Let $A$ be a nonempty subset of $\mathbb{R}$. If $\alpha = \sup A $ is finite show that for each $ \epsilon &gt; 0 $ there is an $a \in A $ such that $\alpha - \epsilon &lt; a\leq \alpha $.  This is what I have so far...  Proof: We claim that $\alpha = \sup A $   Then by definition of a supremum $\alpha $ is the least upper bound of set A  Thus $\forall a \in A$,  $a \leq \alpha$   Suppose $\epsilon &gt; 0$   Then $\alpha - \epsilon &lt; \alpha $.   Thus $\alpha - \epsilon &lt; a\leq \alpha$.   I feel like I'm missing some step between my last and second to last step so what am I forgetting? Also is the rest of my proof right? Why is rendered viewport faster than rendering individual frames? When I'm using rendered viewport it initially takes a while before rendering starts, but once it does, I can freely move around and rendering a new view happens almost instantaneously. When on the other hand I'm rendering a movie, for each frame Blender takes a significant amount of time before rendering even starts, usually doing the following:  Synchronizing object, Updating images, Updating meshes, Updating Scene BVH, Packing BVH,  Why does it do this? And is it possible to disable this to increase movie rendering speed? What is the difference between CentOS "DVD" vs "Everything" ISOs Java Serialization with non serializable parts I have:  class MyClass extends MyClass2 implements Serializable {   //... }   In MyClass2 is a property that is not serializable. How can I serialize (and de-serialize) this object?  Correction: MyClass2 is, of course, not an interface but a class. No indentation after theorem environment with amsthm I use the amsthm package and dont want lines which start right after the theorem environment to be indented. I consulted the manual of the package and it said to define a new theorem style. I expected the following MWE to accomplish this task.  \documentclass[12pt,a4paper]{scrreprt}  \usepackage{amsthm} \newtheoremstyle{abcd}% name   {}%      Space above, empty = `usual value'   {}%      Space below   {\itshape}% Body font   {}%         Indent amount (empty = no indent, \parindent = para indent)   {\bfseries}% Thm head font   {.}%        Punctuation after thm head   {.5em}% Space after thm head: \newline = linebreak   {}%         Thm head spec \theoremstyle{abcd}  \newtheorem{defn}{Definition} \begin{document} \begin{defn} Some defintion \end{defn} This sentence shouldn't be indented. \end{document}   However, I end up with this   That is what I would expect (obtained using a noindent right after the theorem environment ends) I noticed there is a square knob sticking out of my basement wall. Does anyone know what this is? How to specify the SMTP server in PHPMailer? How to prove this binomial identity $\sum_{r=0}^n {r {n \choose r}} = n2^{n-1}$? I am trying to prove this binomial identity $\sum_{r=0}^n {r {n \choose r}} = n2^{n-1}$ but am not able to think something except induction,which is of-course not necessary (I think) here, so I am inquisitive to prove this in a more general way.  The left side of an identity occurs while solving another problem (concerning binomial theorem) so I am more interested in deriving the right side from the left side, else I have to remember it now onward.  EDIT: I am more interested in an algebraic proof rather than combinatorial argument or something involving calculus (however I liked  and  solution), hence I am removing the combinatorics tag. How can I install Celestia on Ubuntu 18.04.1? Like the title said, I want to install Celestia. I already downloaded the packages  and then, I tried all the things that I found on some posts (also, they're outdated, cause the last one is for Ubuntu 16.04) but nothing works.  How can I install it on Ubuntu 18.04.1? Prove that a power series $\sum_{n=0}^{\infty}{{a_n}{z^n}}$ which converges for any $z \in \mathbb{N}$, converges for any $z \in \mathbb{C}$. PROBLEM  Prove that a power series $\sum_{n=0}^{\infty}{{a_n}{z^n}}$ which converges for any $z \in \mathbb{N}$, converges for any $z \in \mathbb{C}$.  MY ATTEMPT  Since the power series $$\sum_{n=0}^{\infty}{{a_n}{z^n}}$$ converges for any $z \in \mathbb{N}$, then $$\sum_{n=0}^{\infty}{{a_n}{z^n}}$$ can be considered (?) to be a polynomial in $\mathbb{C}$.  Hence, $$\sum_{n=0}^{\infty}{{a_n}{z^n}}$$ is entire, and therefore continuous in $\mathbb{C}$ (since differentiability implies continuity).  It follows that $$\sum_{n=0}^{\infty}{{a_n}{z^n}}$$ converges for any $z \in \mathbb{C}$.  QUESTION     I am aware that, while I may have (some) ideas for a (general) proof, admittedly there are several grey areas (i.e., gaps) that need to be filled.  Would you be kind enough as to fill in these gaps, by providing useful hints?