LaTeX table floating off page
My table doesn't fit; what are my options?
Fancy vertical timeline I'd like to have a timeline as similar as possible to this with the addition of being able to add a logo at the left of each textbullet, but I've got no clue at all:    Thanks very much in advance for any help :)  p.s. I've stumbled upon this answer () but I don't how to modify it to get what I want! How to find required information in man The man command brings up a nice manual for many programs, but how can I use it more effectively? For example man gcc brings:  NAME        gcc - GNU project C and C++ compiler  SYNOPSIS        gcc [-c|-S|-E] [-std=standard]            [-g] [-pg] [-Olevel]            [-Wwarn...] [-Wpedantic]            [-Idir...] [-Ldir...]            [-Dmacro[=defn]...] [-Umacro]            [-foption...] [-mmachine-option...]            [-o outfile] [@file] infile...         Only the most useful options are listed here; see below for the        remainder.  g++ accepts mostly the same options as gcc. .... many text   But what if I need only some part of it? What is the best way to jump to the section where -Idir is described, for example? Usage of "but" in a sentence. I'm reading Robinson Crusoe and came across many of these constructions with "but" in it. I can't help but thought they were a little unusual. I don't consider myself fluent in English, that's why I ask.  Here is an example:     This I saw no remedy for but by making an enclosure about it with a   hedge; which I did with a great deal of toil, and more, because it   required speed.   Second one:      However, as my arable land was but small, suited to my crop, I got   it totally well fenced in about three weeks' time;   By typing the second out I figured it is actually the normal textbook case of "but", just an, in my opinion, screwed ordering in the sentence. Is this what it means?     However, as my arable land was suited to my crop but small, I got it   totally well fenced in about three weeks time;   Why did the author do this? Can you comment on the first sentence too? It's not a textbook-but-usage as I see it. Suppose I am a naturalized citizen of the US, but also a citizen of another country, "XYZ". I then boarded a plane and left the US to another country (maybe not necessarily to XYZ), without first getting a US passport, but using my old, but valid XYZ passport.   In this case what would be the best documents to have for me to gain entry back into the US as a US Citizen without a passport?  Would I need to contact the US Embassy for help in order to be able return?  If the airline does let me aboard to return to the US, even without the US passport, what are the best documents could I show at the border to prove I am a US citizen but that I just don't have a passport, for whatever reason? FireFox 66 Quantum disabled all my extensions at midnight! This morning I woke up to:    and the FireFox help page doesn't really help...  Help!  What should I do now??? I need NoScript and AdBlock Plus to improve my surfing speed!!! 0:-) How do I split a forest tree into two trees with proper vertical alignment? \documentclass[oneside,12pt]{article} \usepackage{geometry} \usepackage{microtype} \usepackage[utf8]{inputenc} \usepackage[T1]{fontenc} \usepackage{lmodern}  \usepackage{enumitem} \setlist[enumerate,1]{label=\bfseries\Alph*,align=left,leftmargin=*,   labelsep=1.5em} \setlist[enumerate,2]{label=\arabic*.,labelindent=1em,labelsep=1.5em,   leftmargin=*}  \usepackage{amssymb} \usepackage{amsmath} \usepackage{amsthm} \theoremstyle{definition} \newtheorem*{sol}{Solution}  \usepackage{forest} \forestset{   ass/.append style={     before computing xy={l=\baselineskip},     no edge   },   prooftree/.style={     for tree={       child anchor=north,       parent anchor=south     }   } }  \begin{document} \subsection*{Exercises 29} \begin{enumerate} \item Use QL trees to evaluate the entailment claims (1) to (10) in Exercises   28A.   \begin{enumerate}   \item $\forall x(Fx\supset Gx)\vDash\forall x(Gx\supset Fx)$      \begin{forest}       prooftree       [$\forall x(Fx\supset Gx)$       [$\neg\forall x(Gx\supset Fx)\checkmark$,ass       [$\exists x\neg(Gx\supset Fx)\checkmark$,ass       [$\neg(Ga\supset Fa)\checkmark$,ass       [$Ga$,ass       [$\neg Fa$,ass       [$(Fa\supset Ga)\checkmark$,ass       [$\neg Fa$] [$Ga$]]]]]]]]     \end{forest}      $\neg Fa$ and $Ga$ make the premisses and the negation of conclusion true.     Thus, the entailment is invalid.   \item $\forall x(Fx\supset Gx)\vDash\forall x(\neg Gx\supset\neg Fx)$      \begin{forest}       prooftree       [$\forall x(Fx\supset Gx)$       [$\neg\forall x(\neg Gx\supset\neg Fx)\checkmark$,ass       [$\exists x\neg(\neg Gx\supset\neg Fx)\checkmark$,ass       [$\neg(\neg Ga\supset\neg Fa)\checkmark$,ass       [$\neg Ga$,ass       [$\neg\neg Fa$,ass       [$(Fa\supset Ga)\checkmark$,ass       [$\neg Fa$ [*,ass]] [$Ga$ [*,ass]]]]]]]]]     \end{forest}      Since the tree closes, the entailment is valid.   \item $\forall x\exists yLxy\vDash\forall y\exists xLyx$      \begin{forest}       prooftree       [$\forall x\exists yLxy$       [$\neg\forall y\exists xLyx\checkmark$,ass       [$\exists y\neg\exists xLyx\checkmark$,ass       [$\neg\exists xLax\checkmark$,ass       [$\forall x\neg Lax$,ass       [$\exists yLay\checkmark$,ass       [$Lab$,ass]]]]]]]     \end{forest}      \begin{forest}       prooftree       [$\neg Lab$,ass [*,ass]]     \end{forest}   \item $\forall x((Fx\wedge Gx)\supset Hx)\vDash\forall     x(Fx\supset(Gx\supset Hx))$   \item $(\forall xFx\vee\forall xGx)\vDash\forall(Fx\vee Gx)$   \item $\forall x(Fx\supset Gx),\forall x(\neg Gx\supset Hx)\vDash     \forall x(Fx\supset\neg Hx)$   \item $\exists x(Fx\wedge Gx),\forall x(\neg Hx\supset\neg Gx)\vDash     \exists x(Fx\wedge Hx)$   \item $\forall x\exists y(Fy\supset Gx)\vDash\forall y\exists x(Gx\supset     Fy)$   \item $\forall x\forall y(Lxy\supset Lyx)\vDash\forall xLxx$   \item $\forall x(\exists yLxy\supset\forall zLzx)\vDash\forall x\forall y     (Lxy\supset Lyx)$   \end{enumerate} \end{enumerate} \end{document}   Usually, I have to manually split a forest tree into two to emulate page breaking in a forest tree. However, the second tree doesn't vertically align with the first as in the picture below. How can I vertically align them together? @cfr Why does kinetic energy increase quadratically, not linearly, with speed? As  says:     [...] the kinetic energy of a non-rotating object of mass $m$ traveling at a speed $v$ is $\frac{1}{2}mv^2$.   Why does this not increase linearly with speed? Why does it take so much more energy to go from $1\ \mathrm{m/s}$ to $2\ \mathrm{m/s}$ than it does to go from $0\ \mathrm{m/s}$ to $1\ \mathrm{m/s}$?  My intuition is wrong here, please help it out! I have a set of measurements which is partitioned into M partitions. However, I only have the partition sizes $N_i$ and the means $\bar{x}_i$ from each partition. Because all measurements are assumed to be from the same distribution, I believe I can estimate the mean of the population, $\bar{y}$, and standard deviation of the mean, $\sigma_{mean}$: $$ N=\sum_{i=1}^M N_i $$ $$ \bar{y} = \frac{1}{N}\sum_{i=1}^MN_i\bar{x}_i $$  $$ \sigma_{mean}=\sqrt{\frac{1}{N}\sum_i N_i(\bar{x}_i-\bar{y})^2} $$  My questions:   Am I right in my assumptions, that the mean $\bar{y}$ can be computed as above?  How can I find the standard deviation for the population, given only the means?  I read that the standard deviation of the population and standard deviation of the mean is related with $$ \sigma_{mean}=\frac{\sigma}{\sqrt{n}} \mbox{[1]} $$ where $n$ is the number of samples used in the computation of $\bar{x}_i$. So is it actually as simple as just multiplying $\sigma_{mean}$ with $\sqrt{n}$ if $n$ for all means are the same?   If it's that simple, what do I do if each $\bar{x}_i$ is computed using a different number of samples?    [1] How to reset postgres' primary key sequence when it falls out of sync? I ran into the problem that my primary key sequence is not in sync with my table rows.   That is, when I insert a new row I get a duplicate key error because the sequence implied in the serial datatype returns a number that already exists.  It seems to be caused by import/restores not maintaining the sequence properly. What does [param: NotNull] mean in C#? Am I too old for academia after a PhD? How do I get list of all tables in a database using TSQL? What is the best way to get the names of all of the tables in a specific database on SQL Server? Serializing anonymous delegates in C# I am trying to determine what issues could be caused by using the following serialization surrogate to enable serialization of anonymous functions/delegate/lambdas.   // see http://msdn.microsoft.com/msdnmag/issues/02/09/net/#S3 class NonSerializableSurrogate : ISerializationSurrogate {     public void GetObjectData(object obj, SerializationInfo info, StreamingContext context)     {         foreach (FieldInfo f in obj.GetType().GetFields(BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic))             info.AddValue(f.Name, f.GetValue(obj));     }      public object SetObjectData(object obj, SerializationInfo info, StreamingContext context,                                 ISurrogateSelector selector)     {         foreach (FieldInfo f in obj.GetType().GetFields(BindingFlags.Instance | BindingFlags.Public | BindingFlags.NonPublic))             f.SetValue(obj, info.GetValue(f.Name, f.FieldType));         return obj;     } }     Listing 1 adapted from   The main issue I can think of that might be a problem is that the anonymous class is an internal compiler detail and it's structure is not guaranteed to remain constant between revisions to the .NET Framework. I'm fairly certain this is the case based on my research into the similar problem with iterators.  Background  I am investigating the serialization of anonymous functions. I was expecting this not to work, but found it did for some cases. As long as the lambda did *not&amp; force the compiler to generate an anonymous class everything works fine.   A SerializationException is thrown if the compiler requires a generated class to implement the anonymous function. This is because the compiler generated class is not marked as serializable.  Example  namespace Example {     [Serializable]     class Other     {         public int Value;     }      [Serializable]     class Program     {         static void Main(string[] args)         {             MemoryStream m = new MemoryStream();             BinaryFormatter f = new BinaryFormatter();              // Example 1             Func&lt;int&gt; succeeds = () =&gt; 5;             f.Serialize(m, succeeds);              // Example 2             Other o = new Other();             Func&lt;int&gt; fails = () =&gt; o.Value;             f.Serialize(m, fails); // throws SerializationException - Type 'Example.Program+&lt;&gt;c__DisplayClass3' in Assembly 'Example, Version=1.0.0.0, Culture=neutral, PublicKeyToken=null' is not marked as serializable.         }     }   Listing 2  This is similar to the issue of trying to serialize iterators and I had found the following code in a previous search (see ) Using the code from Listing 1 and an ISurrogateSelector I was able to successfully serialize and deserialize the second failing example.  Objective  I have a system that is exposed via a web service. The system has a complex but small state (many objects, not a lot of properties per object). The state is saved in the ASP.NET Cache, but is also serialized to a BLOB in SQL in case of cache expiration. Some objects need to execute arbitrary "events" upon reaching some condition. Hence they have properties accepting Action/Func objects. Contrived example:      class Command     {         public Command(Action action, Func&lt;bool&gt; condition);     }   Somewhere else      void DoSomethingWithThing(Thing thing)     {         state = Store.GetCurrentState();          Command cmd = new Command(() =&gt; thing.Foo(), () =&gt; thing.IsReady())         state.Add(cmd);          Store.Save(state);     } Let $E=l^p=\left\{x=\left(x_n\right): x_n\in\mathbb{R}, \sum_{1}^{\infty}\left|x_n\right|^p&lt;\infty\right\}$ with $1\le p&lt;\infty$, $\left\|x\right\|_E=\left(\sum_{1}^{\infty}\left|x_n\right|^p\right)^{1/p}.$ Let $\left(\lambda_n\right)$ is a bounded sequence in $\mathbb{R}$ and consider the operator $T$ defined by $$T(x)=\left(\lambda_1x_x,\ldots,\lambda_nx_n,\ldots\right)$$ where $x\in l^p$. Prove that $T$ is a compact operator from $E$ to $E$ iff $\lambda_n\rightarrow 0$.  Can anyone give me some hints to solve this problem? Thank you! Functions that are sets of all function - proofs I'm going through the book Proofs and fundamentals, by Bloch, and it doesn't include a solution manual for it's examples. It doesn't have many examples on notation and proof strategy for certain cases, so I needed a little help.    Although I understand the idea, and can draw it out, I'm not sure how to write it in decent proof notation. Any help would be appreciated!   Edit: apologies, my idea is this: theres some function in $F(C,A\times B)$ such that theres some $x$ within $C$ that means $g(x)$ is within $A\times B$. Similarly, the second two imply that for some function within $F(A,C)$ there exists a value $x$ such that $g(x)=C$. and similarly for the third part from $B\rightarrow C$. It's easy to see with drawing it out that these two are the same because one will have a part within A and the other will lead to a part within $B$, so their cross will be the same. I wanted to go about proving it by setting a function $f$ within $F(C,AxB)$ and then working from there, but I really have no idea where to start or the notation. Python csv.reader: How do I return to the top of the file? When I'm moving through a file with a csv.reader, how do I return to the top of the file.   If I were doing it with a normal file I could just do something like "file.seek(0)".  Is there anything like that for the csv module?  Thanks ahead of time ;) How this java code produces deadlock? A teacher wants to randomly form two teams of 5 students from a group of 5 girls and 5 boys for a sports activity. A teacher wants to randomly form two teams of 5 students from a group   of 5 girls and 5 boys for a sports activity. Two of the girls, Ann and   Alice, are selected as team leaders. Find the probability that one   team has exactly 3 girls.   If i do this way $$\dfrac{{3 \choose 2}{5\choose 2}{1\choose 1}{3\choose 3} \times 2!}{{8 \choose 4}{4 \choose 4}} = \dfrac{6}{7}$$  Which turns out to tally with the answer. But i got one big question, is my way correct. Do i really need to times $2$ here? Please see my link below to my previous question cause the previous question make me doubt if i should times $2$. Wi-Fi only works after waking MacBookPro7,1 from sleep Been having some issues with the STA drivers from bcrmwl-kernel-source. While the drivers do function, they only seem to function after putting the laptop to sleep, by either closing the lid, or manually putting it to sleep, and waking it up. The laptop here is a MacBookPro7,1 (Mid 2010 13-inch MacBook Pro), running Ubuntu 17.04.  While the issue isn't bad enough to deter me from using the laptop, it is not an elegant solution, and I believe that there can be a solution found somewhere.  For reference, here are the outputs from the Wireless Info script for both before and after: , . Hopefully these are of some use. If you need additional information about the computer, I will be happy to answer. Let $f: \mathbb N \rightarrow \mathbb N$ are increasing function such that $f\left(f(n)\right)=3n$. Find $f(2017)$