if greater than zero copy from the range
How to split numbers into columns with negative and positive values, without empty cells?
Why do I get the same result with rand() every time I compile and run? A program I am using spits out LaTeX tables in LaTeX files (outreg2 command from Stata), which I run using texify to make pdfs of the tables.  I crop these tables (using pdfcrop) and embed them elsewhere.  However, the pdfs include page numbers, which prevent pdfcrop from cropping directly around the table.  I need an automatic way to remove the page numbers before cropping.  I want to insert the command \pagenumbers{gobble} into the LaTeX code to automatically remove the page numbers.    I believe   texify --pdf --texinfo="\pagenumbering{gobble}" filename.tex   should work.  It does not. No exception pops up, but the page number remains. I cannot find documentation anywhere showing examples of using the --texinfo option to splice LaTeX code into the file before running the LaTeX file to create a pdf.   How should I properly use the texify command?  Or is there another way to splice in  \pagenumbering{gobble} before running texify? How do I unlock privacy in multiplayer modes mission settings? If my Schengen visa starts on the day of arrival which is one day ahead of departure, would they let me get into the plane? I have a question, I applied for the Schengen visa through Germany, on the form they ask me when I'd arriving (to Germany) and when I'd returning. they take this exact date as the visa period.  I wondering if they would let me get into the plane, even though my flight it a day before the arrival.  Let get the real deal; let say this:  My visa is valid from 02/12/2014 to 02/02/2015. But, my flight is scheduled to be departing on 01/12/2014, but entering Germany 02/12/2014. the flight duration is almost 9hours and there is 7hours difference between Germany and the departing flight country. Easy way to use variables of enum types as string in C? Here's what I am trying to do:    typedef enum { ONE, TWO, THREE } Numbers;   I am trying to write a function that would do a switch case similar to the following:   char num_str[10]; int process_numbers_str(Numbers num) {   switch(num) {     case ONE:     case TWO:     case THREE:     {       strcpy(num_str, num); //some way to get the symbolic constant name in here?     } break;     default:       return 0; //no match   return 1; }   Instead of defining at every case, is there a way to set it using the enum variable like I am trying to do above? As I understand it, the hosts file is one of several system facilities that assists in addressing network nodes in a computer network. But what should be inside it? When I install Ubuntu by default   127.0.0.1 localhost    will be there. Why?   How does /etc/hosts work in case of JVM systems like Cassandra? When is DNS alternative, I guess not on a single computer? How many non-negative integer solutions does the equation $3x + y + z = 24$ have? How to round pixel values of a raster in QGIS? I have a raster with float number values for example: 2.544459104537964 and I want to round these up to integers. I have seen other posts on ArcGIS like  but when I use Raster Calculator in QGIS, Int(myraster + 0.5) only makes the first value (which is 0) to 0,5 and the last one (which is 100) to 100,5. The other pixels stay float. Let $f_n = \mathbb 1_{[-n,n]}$ for all $n \in \mathbb{N}$   Compute explicitly $f_n \star f_1$ for all $n \in \mathbb{N}$.  Show that $f_n \star f_1$ is the Fourier transform of $g_n = \frac{  \sin{(2\pi x)} \sin{(2 \pi nx)}}{\pi ^2 x^2}$  Show that $\| g_n \|_1 \to \infty$  Deduce that the Fourier transform is not surjective from $\mathcal{L}^1(\mathbb{R})$ to $C_0( \mathbb{R})$    Here, $C_0(\mathbb{R})$ is the space of continuous functions $f : \mathbb{R} \to \mathbb{R}$ that tends to $0$ at $-\infty$ and $+\infty$. I managed to compute 1) and proved 2). But I don't know how to prove 3). Moreover, I don't see how can 1), 2) and 3) prove 4). Can anyone help? I'm studying special relativity and saw the 2 postulates of Einstein. The most remarkable one for me is the universal speed of light. Einstein postulated that the speed of light in vacuum is the same for all inertial observers, regardless of the motion of the source. But what if we are accelerating and we are changing from one inertial frame to another, how will we observe the speed of light? Is it still the same? I suggest it's not? Because I alread saw a small introduction to general relativity where the light will bend in a gravitational field and therefore also when you accelerate. So does the speed of light change because it bends? Convert Month Number to Month Name Function in SQL I have months stored in SQL Server as 1,2,3,4,...12. I would like to display them as January,February etc. Is there a function in SQL Server like MonthName(1) = January? I am trying to avoid a CASE statement, if possible. Can you cast a spell learned from the Magic Initiate feat using spell slots? Say I play a wizard who learns cure wounds by taking the Magic Initiate feat. Could I cast that spell using the Wizard's spell slots? Well, may be this is not really useful, but I've thought if it was possible to put all the document in one long page. I mean, if your document is going to be read in a computer, mix all the pages in a continuous page. If your document has 90 pages (A4), where each one is 21cm by 29.7cm the continuous document should be (more or less) one page which is 21cm by 90 · 29.7 = 2673cm. Is this possible? EDIT: Some things I would like to achieve:  The \newpage, \chapter{}, \part{}, etc. shouldn't go to a new page, they should only add more vertical space. The package pdfpages should add the pages continuously with almost no space between them. The titlepage, in this case, has a different color, so it could go alone in a basic A4 page (just to make things easier).  Question Is this possible? What updates should be done to older monsters to bring them in line with MM3 era monsters? I know that to better balance paragon and epic level players against similar level monsters, WotC changed the math used for monsters for MM3, and I believe that they changed some of the types of powers they gave monsters.   If I want to update monsters from MM1 or MM2 to be in line with MM3 era monsters, what changes should I make? If $AD$, $BE$, $CF$ are exterior bisectors then $D,E,F$ are collinear Let $ABC$ be a triangle and AD the exterior bisector of $\angle A$, $BE$ the exterior bisector of $\angle B$, $CF$ the exterior bisector of $\angle C$ where $D\in BC$, $E\in AC$, $F\in AB$.  Show that $D,E,F$ collinear. Question about the Riemann-Lebesgue Lemma proof Ok, so one of the formulations of the Riemann-Lebesgue Lemma says: $$ f\in L^1(\mathbb{R}) \implies \hat{f}(\omega)\to 0\;\mbox{ when } \;|\omega|\to\infty.$$  I get all the steps of the proof, except the one which says that if $f$ is an arbitrary integrable function, it may be approximated in the $L^1$ norm by a compactly supported smooth function $g\in L^1$. My question is: Why? How do you know that for all $\epsilon&gt;0$, and for all arbitrary function $f\in L^1$ exists a compactly supported smooth function $g$ so that $||f-g||_{L^1}&lt;\epsilon$? The "proof" can be found in many places, but this step can be found in Wikipedia Peggy would like to prove to Victor that she knows the discrete logarithm of $y$ based $g$; that is, she knows $x$ such that $y = g^x \bmod p$. One round of the interactive proof protocol consists of the following steps.   Peggy picks random $k \in \mathbb Z/(p−1)\mathbb Z$, computes $t = g^k \bmod p$, and sends $t$ to Victor. Victor picks random $h \in \mathbb Z/(p−1)\mathbb Z$ and sends $h$ to Peggy. Peggy computes $r = (k − hx) \bmod (p − 1)$ and sends $r$ to Victor. Victor verifies that $t = g^r y^h \bmod p$.   The interactive protocol can be converted into a noninteractive zero-knowledge proof by choosing and making public a collision-resistant hash function $H$, and changing the second step of the interactive protocol to the following: Peggy computes $h = H(y, t)$. Then the noninteractive proof consists of $(t, h, r)$, which can be verified as follows: $$h = H(y, t), \qquad t \stackrel?= g^r y^h \bmod p.$$   What is the problem if in the non-interactive proof the hash $h$ depends only on $y$? That is, $h = H(y)$, and the proof consists of $(t, h, r)$, which can be verified as follows: $$h = H(y), \qquad t \stackrel?= g^r y^h \bmod p.$$ What is the problem if in the non-interactive proof the hash $h$ depends only on $t$? That is, $h = H(t)$, and the proof consists of $(t, h, r)$, which can be verified as follows: $$h = H(t), \qquad t \stackrel?= g^r y^h \bmod p.$$ How does \fontsize{}{} work? With the package anyfontsize I can use the command \fontsize{}{}. But the second argument seems to be without any effect. I read  that it is related to the line space. It doesn't work.  \documentclass{article} \usepackage{anyfontsize} \begin{document}  {\fontsize{1cm}{1cm}\selectfont First test : I need to put some text here.}  \bigskip  {\fontsize{1cm}{2cm}\selectfont Second test : I need to put some text here --- does it work?}  \end{document}     Any clue? I have a problem with energy conservation in case of interfering waves.  Imagine two harmonic waves with amplitudes $A$. They both carry energy that is proportional to $A^2$, so the total energy is proportional to $2A^2$. When they interfere, the amplitude raises to $2A$, so energy is now proportional to $4A^2$ and bigger than before.  The equivalent question is what happens to the energy with the superposition of two waves that interfere destructively.  Also, if someone could comment on the statement about this problem in my physics book (Bykow, Butikow, Kondratiew):      The sources of the waves work with increased power during the interference because they feel the wave from the other source. What does the caret (‘^’) mean in C++/CLI?