\includepdf in A3 format
A3 pages within A4 doc
I think everybody with a history of participation can't help but notice the explosive growth of repeated duplicate questions. The work of looking for duplicates and then closing questions has overtaken the work of actually answering questions.  It's become virtually impossible to ask something which hasn't been yet asked. Lately I feel boredom each time I see a new question and start answering it only to realize after the first written sentence that I have answered similar questions five times over or seen them answered some ten times or more. I know where it's going to be going and what answers with what votes it is going to receive before any answer is even written.  It's obviously not the administration's fault, it is simply so. The questions is, what to do about it? Engaging more moderators to close and close duplicates won't work because it's already starting to repel users who get mad at their questions closed and become afraid of asking more or perhaps just go away.  The original idea of Jeff stated the the site is for questions that can be answered. Meaning no open-ended discussions. When I first read this I had a casual thought - well, and what's gonna happen when they all are asked and answered? Will it become a museum, a monument of wisdom and knowledge or what?  I'm not sure what to do about it. Perhaps deprecation/versioning of older questions so that their new versions can sparkle the tiresome evening...  POSTSCRIPTUM.  I recall Star Trek Voyager episode  when another Q asked Captain Janeway for asylum. He was tired of immortality and wanted to die. They opened a hearing and went on to visit the continuum to evaluate the living conditions there which caused the suffering and the wish to escape it in death. A lifeless picture presented itself to the visitors... a house lone in an open space, two people going about their business, nobody talking. When asked why they were silent, the following was said. It's been so long, all has already been said, all stories told, all jokes are made... there is nothing left to do...  Are we there as well?  UPDATE: Just saw this answer in another question:       Also, some of the core questions got asked early on in the life of the site. Great questions still come around from time to time, but many have already been asked.   Doesn't that confirm my point? How to add 30 minutes to a JavaScript Date object? Lost reputation after answering my own question with bounty Timeline:  Asked a question, no (interesting) answers for two weeks  Set bounty on it this morning  Found the answer to my question two hours later. Answered my own question.  Bounty reputation is lost. It was not awarded to me, it was not returned to me (the 100 I invested).   Right now, I feel really stupid for answering my own bounty question.   If this is accepted behavior, then user should be warned - you are answering your own bounty question, your bounty reputation will be LOST. Can open sets and closed sets of $\mathbb{R}^n$ be homeomorphic? Suppose $A$ is an open subset of $\mathbb{R}^n$ considered as a topological subspace. Suppose $B$ is a another susbet of $\mathbb{R}^n$, and under the induced topology, is homeomorphic to $A$.  If $B$ is closed and bounded, then by the Heine-Borel theorem, $B$ is compact as a topological space so $A$ and $B$ cannot be homeomorhpic, because $A$ is not compact. But if $B$ is not bounded, what can be said about $B$, if any? Must $B$ be open, can it ever be closed (let's leave out the only case of being both open and closed--the entire ambient space $\mathbb{R}^n$), or can it be neither open nor closed? Is the set of all unitary matrices in $M_2(\mathbb{C})$ is compact? I can show that as determinant map is continuous so unitary matrices are closed but how to show they are bounded?   Please help. Was Grand Moff Tarkin under Darth Vader's control? In A New Hope, we see Grand Moff Tarkin ordering Darth Vader around. Also, it was . It's uncertain whether he knew .  But considering that Darth Vader was a Sith Lord, and a Jedi before that, are we entirely sure he wasn't secretly controlling Tarkin through a Jedi Sith mind trick? How long does it take for badges to be awarded? How are they generated? Do badges get calculated in real time, or do they get calculated by an external service? How long does it take for a badge to be awarded, once its requirements are met?  Does Stack Overflow use any external services to do things, like maintenance, e-mailing or badge calculation? Shortest code to calculate list min/max in .NET I'd like something like  int minIndex = list.FindMin(delegate (MyClass a, MyClass b) {returns a.CompareTo(b);});   Is there a builtin way to do this in .NET? My advisor wants me to include a name of someone who has no contribution to the paper My first advisor wants me to include my second advisor's name in a paper that I worked on before she (2nd advisor) came along.   Should I include her name even though she didn't do anything in that paper? I don't think she even read it. I have a simple cylinder which is mirrored on both the X and Y axis.  When I scale it along the X axis, the two halves of the cylinder overlap, rather than scale as it would before the mirror modifier was applied:    I haven't used Blender in a while and I know this is a simple fix. IBus methods do not show up in text entry settings I installed both Korean and Japanese using the Language Support window, and expected Korean (Hangul) and Japanese (Anthy) to show up in the input sources for Text Entry Settings (having both packages installed). However, neither shows up. I'm trying to have a surface with soft body hold obects that are falling on it with rigid body physics, but for some reason, no what matter what mass I give it, the objects just fall trough the softbody enabled surface.  Is there a toggle or a value I need to change to make them stay there? I would like to take the full citation of a reference in my BibTeX file and write commentary in-line after it.  A \fullcitation{id} command would be perfect.  I would like to use it as:  \fullcitation{id1}   This paper talks about A with applications to B.  \fullcitation{id2}   This paper considers how C affects A.  Whenever the \fullcitation{id} command appears, I want it to be replaced with the full reference, including authors, title, journal, and date.  Is this possible? Im new to Illustrator and have found the clipping mask is not so easy compared to Phtoshop. Could any one tell me how i can make this line texture a clipping mask over the circle? What are some alternatives to "hover" on touch-based devices? Came up recently in a 37signals podcast:    The straightforward, "brute-force" solution is to just use the first touch on a UI object as the hover.    It works. But are there other, more elegant solutions? For instance, could the hardware ever be made to support actual finger hovering? Take the following two lines of code:  for (int i = 0; i &lt; some_vector.size(); i++) {     //do stuff }   And this:  for (some_iterator = some_vector.begin(); some_iterator != some_vector.end();     some_iterator++) {     //do stuff }   I'm told that the second way is preferred. Why exactly is this? Possible Duplicate:          For example the following are the same  # /usr/bin/php updateDatabase.php  # php updateDatabase.php   But how would I infer the location of the php command to be in /usr/bin? What happens if both players have the ability to pump their creature an unlimited number of times? Say that both players each had 2 , 2 , and a . (Or any other way to get unlimited mana, and a Nantuko Shade).  Player 1 attacks with his , and player 2 blocks with his . Before damage is assigned, each has chances to pump up their  as much as they want. They can't just declare them to be "infinite," but each can always one-up the other player. What happens?  It seems there would be a loop of events, but would one player eventually be forced to break the loop as per rule 714.3? Is it considered the same game state after each player pumps their creature a bunch as it was before?  This was discussed at length on the Draw3Cards Magic Q&amp;A site (which is no longer available), but no conclusion was reached. Some felt that the game would simply be a draw, others felt that the active player would be forced to make a different decision to break the loop. Others felt that you would just have to call a judge and see what he decides. "E:Read error - read (5: Input/output error), E:The package lists or status file could not be parsed or opened." So I keep trying to install things on my laptop and whenever I try to use sudo apt-get I get the same errors every  time,  SystemError: E:Read error - read (5: Input/output error), E:The package lists or status file could not be parsed or opened.   Also whenever I try to open software Center through my desktop Icon it will just freeze leaving me to force quit.  If I try to use the command software-center in my terminal I get the longest list in the world which is,   che.open() Traceback (most recent call last):   File "/usr/lib/python2.7/dist-packages/gi/overrides/GLib.py", line 629, in &lt;lambda&gt;     return (lambda data: callback(*data), user_data)   File "/usr/share/software-center/softwarecenter/db/pkginfo_impl/aptcache.py", line 261, in open     self._cache = apt.Cache(progress)   File "/usr/lib/python2.7/dist-packages/apt/cache.py", line 105, in __init__     self.open(progress)   File "/usr/lib/python2.7/dist-packages/apt/cache.py", line 150, in open     self._cache = apt_pkg.Cache(progress) SystemError: E:Read error - read (5: Input/output error), E:The package lists or status file could not be parsed or opened. 2013-10-13 10:13:52,685 - softwarecenter.db.pkginfo_impl.aptcache - INFO - aptcache.open() Traceback (most recent call last):   File "/usr/lib/python2.7/dist-packages/gi/overrides/GLib.py", line 629, in &lt;lambda&gt;     return (lambda data: callback(*data), user_data)   File "/usr/share/software-center/softwarecenter/db/pkginfo_impl/aptcache.py", line 261, in open     self._cache = apt.Cache(progress)   File "/usr/lib/python2.7/dist-packages/apt/cache.py", line 105, in __init__     self.open(progress)   File "/usr/lib/python2.7/dist-packages/apt/cache.py", line 150, in open     self._cache = apt_pkg.Cache(progress) SystemError: E:Read error - read (5: Input/output error), E:The package lists or status file could not be parsed or opened. 2013-10-13 10:13:57,365 - softwarecenter.db.pkginfo_impl.aptcache - INFO - aptcache.open() Traceback (most recent call last):   File "/usr/lib/python2.7/dist-packages/gi/overrides/GLib.py", line 629, in &lt;lambda&gt;     return (lambda data: callback(*data), user_data)   File "/usr/share/software-center/softwarecenter/db/pkginfo_impl/aptcache.py", line 261, in open     self._cache = apt.Cache(progress)   File "/usr/lib/python2.7/dist-packages/apt/cache.py", line 105, in __init__     self.open(progress)   File "/usr/lib/python2.7/dist-packages/apt/cache.py", line 150, in open     self._cache = apt_pkg.Cache(progress) SystemError: E:Read error - read (5: Input/output error), E:The package lists or status file could not be parsed or opened.   That's only about one-tenth of the list which is too long to read. I need help, if anyone has an answer please respond Suppose that   $$f(x)=1+\sum_{n=1}^\infty a_n \frac{x^n}{n!}\ \ \forall \ x\in \mathbb{R}$$   where $\sup_{x&gt;0}\left|e^xf(x)\right| &lt; \infty$ and $\sup_{n\in\mathbb{N}} |a_n|&lt; \infty$.      Prove that $a_n = (-1)^n$ , $\forall n\in \mathbb{N}$   It seems amazing to me. What we need to prove is $f(x)=e^{-x}$. It seems insufficient to prove this strong conclusion, but actually it is true and all the "counterexamples" I found were wrong.  My attempt  Put $g(x)=e^x f(x)$. $$\left|g^{(n)}(0)\right|=\left|\sum_{k=0}^n \binom{n}{k} f^{(k)}(0)\right|\le 2^n\sup_{n\in\mathbb{N}} |a_n|  $$ Put $h(x)=g(\frac{x}{2})$. Thus  $$h^{(n)}(0)=\frac{1}{2^n}g(0) \le \sup_{n\in\mathbb{N}} |a_n|$$ which implies that $$h(x)=1+\sum_{n=1}^\infty b_n \frac{x^n}{n!}\ \ \forall \ x\in \mathbb{R}$$ where $$|b_n|\le \sup_{n\in\mathbb{N}} |a_n| \ \ \forall \ n\in\mathbb{N}  \,\,\,\,\,\&amp; \,\,\,\,\,  \sup_{x&gt;0}\left|h(x)\right| &lt; \infty $$   And hence if $b_k&lt;0$, then there exists $l&gt;k$ such that $b_l&gt;0$. I want to yield a contradiction by supposing this, but I failed.  Any hints or other new ideas? Thanks in advance!   (I heard that this problem can be solved by complex analysis. This is the reason why I attach the complex-analysis tag.)