Let us consider the following scenario.  This is the partial code in the main.tex file and which includes code from other tex files like acknowledgements.tex,certificate.tex, abstract.tex etc.,    ....................   \include{certificate}   \include{abstract}   \include{introduction}   \include{Chap1}   \include{Chap2}   ...................   Now let my PDF counting page numbers from certificate, but I want to count the page numbers from chap1.  Is it possible to force counting from a particular page.  Note: There may be counting for certificate,abstract and introduction too, but from chap1 counting has to start from 1. It is good if there is no counting before chap1.
Problem:  Start page numbers from chapter one and also reflect this in the TOC.  Currently the code for TOC is:  \renewcommand{\contentsname}{Table of contents}  \setcounter{secnumdepth}{2} \setcounter{tocdepth}{2} \tableofcontents   I would appreciate if I can be pointed in the right direction. So far I have understood that you can use \chapter* in order not to include a chapter in the TOC.  Questions:  1) How would you force Latex to start numbering from chapter 1 and forward?  2) How can you start page numbering from the first chapter?
Is it acceptable to publish a paper using an affiliation with a former employer? Recently I've changed jobs, and consequently the field of research has also changed. But I'm still getting proposals for publications in the previous field, and it is interesting for me to accept some of them. My concern is about which affiliation to use: on one hand I gain all the knowledge in that field while working on the previous employer, also I hope they can cover my expenses related to the publication. On the other hand, I do not work for them anymore, and my current company has very little interest in my old field of research, and probably will not support it financially, but I think it is wise to mention them as well. As a compromise I'm thinking to put the previous employer in the affiliation, and the name of my new employer in the footnote, something like "currently at XYZ". Surely I'll discuss this issue with both, although the opinion of the community is also very valuable. I'm trying to solve hard combinatorics that involve complicated factorials with large values.  In a simple case such as $8Pr = 336$, find the value of $r$, it is easy to say it equals to this: $$\frac{8!}{(8-r)!} = 336.$$  Then $(8-r)! = 336$ and by inspection, clearly $8-r = 5$ and $r = 3$.  Now this is all and good and I know an inverse function to a factorial doesn't exist as there is for functions like sin, cos and tan etc. but how would you possibly solve an equation that involves very large values compared to the above problem without the tedious guess and checking for right values.  Edit: For e.g. if you wanted to calculate a problem like this (it's simple I know but a good starting out problem) Let's say 10 colored marbles are placed in a row, what is the minimum number of colors needed to guarantee at least $10000$ different patterns? WITHOUT GUESS AND CHECKING  Any method or explanation is appreciated! This is from Fraleigh's First Course in Abstract Algebra (page 82, Theorem 8.16) and I keep having hard time understanding its proof. I understand only until they mention the map $\lambda_x (g) = xg$. Can someone explain this proof step by step? Thank you so much! Here is the proof:  Let $G$ be a group. We show that $G$ is isomorphic to a subgroup of $S_G$. Define a one-to-one function $\phi: G \to S_G$ such that $\phi(xy)=\phi(x) \phi(y)$ for all $x,y \in G$. For $x \in G$, let $\lambda_x: G \to G$ be defined by $\lambda_x (g) = xg$ for all $g \in G$. The equation $\lambda_x (x^{-1} c) = x(x^{-1} c) = c$ for all $c \in G$ shows that $\lambda_x$ maps $G$ onto $G$. If $\lambda_x (a) = \lambda_x (b)$, then $xa=xb$ so $a=b$ by cancellation. Thus $\lambda_x$ is also one to one, and is a permutation of $G$. We now define $\phi: G \to S_G$ by defining $\phi(x) = \lambda_x$ for all $x \in G$. To show that $\phi$ is one to one, suppose that $\phi(x) = \phi(y)$. Then $\lambda_x = \lambda_y$ as functions mapping $G$ into $G$. In particular $\lambda_x (e) = \lambda_y (e)$, so $xe=ye$ and $x=y$. Thus $\phi$ is one to one. It only remains to show that $\phi(xy) = \phi(x) \phi(y)$, that is, that $\phi_{xy} = \lambda_x \lambda_y$. Now for any $g \in G$, we have $\lambda_{xy} (g) = (xy)g$. Permutation multiplication is function composition, so $(\lambda_x \lambda_y)(g) = \lambda_x (\lambda_y (g)) = \lambda_x (yg) = x(yg)$. Thus by associativity, $\lambda_{xy} = \lambda_x \lambda_y$. This one has me kind of stumped. I want to make the first word of all the paragraphs in my #content div at 14pt instead of the default for the paragraphs (12pt). Is there a way to do this in straight CSS or am I left wrapping the first word in a span to accomplish this? Why does the Lasso provide Variable Selection? Privacy leak in permalink? Update (Jan 8, 2019) This is now 8 years old, but still getting occasional upvotes/attention, so I thought it's worth giving a summary of the current state.  Despite originally being , over the last decade some changes have made the privacy implications much clearer.  You now click &quot;share&quot; instead of &quot;link&quot;, and the pop-up is very explicit that the link includes your user ID. There is a  asking that this user ID be anonymized or hashed, to allow users to earn publicity badges (the intention behind having the user ID present in the URL, as per ) while eliminating the privacy issue. Original Post It seems to me there is something of a privacy leak when permalinking to a question.  For what I would assume is the purposes of tracking which user is responsible for bringing traffic back to an SE site (for badges, etc.), the user ID of the user obtaining the permanent link . I wouldn't argue that this shouldn't be the case, but I find no warning or mention of this when I do these actions.  I'm sure I'm not the only one that doesn't desire anonymity on SO but would like at least pseudonymity on some places I might share a SO link, such as on a random blog.  As a user, I would not expect sharing a permanent link to leak my identity.   Unless you are familiar with Stack Exchange links or your own userID, it's certainly not obvious by looking at the link that it includes your personal info.  It'd be nice to have fair warning that using that feature will do so, and perhaps provide/describe the workaround: to simply remove the user-id segment from the URL.  Other features would be a preference that formats future permanent links to exclude the user id. Example (from this question)  Permalink:  Link to my user page: Equivalent of cURL for Ruby? I have a Java bean like this:  class Person {   int age;   String name; }   I'd like to iterate over a collection of these beans in a JSP, showing each person in a HTML table row, and in the last row of the table I'd like to show the total of all the ages.  The code to generate the table rows will look something like this:  &lt;c:forEach var="person" items="${personList}"&gt;   &lt;tr&gt;&lt;td&gt;${person.name}&lt;td&gt;&lt;td&gt;${person.age}&lt;/td&gt;&lt;/tr&gt; &lt;/c:forEach&gt;   However, I'm struggling to find a way to calculate the age total that will be shown in the final row without resorting to scriptlet code, any suggestions? Number Theory: Complete set of residues modulo $n$ I have this problem assigned for homework and I'm struggling with the proof of it:  If $a_1,a_2,\dotsc,a_n$ is a complete set of residues modulo $n$ and $\gcd(a,n)=1$, prove that $aa_1,aa_2,\dotsc,aa_n$ is also a complete set of residues modulo $n$.  (Hint: It suffices to show that the numbers in question are incongruent modulo $n$.)  I'm in elementary number theory so I'm not allowed to use an high-level theorems to prove this, I pretty much have to use the basics of modulo.  Thanks! Can't install xposed framework I want to install the xposed framework on my Nexus 5 and in the framework, the install/update option doesn't work.  My Nexus 5 runs Android 5.0 (Lollipop). Automatically use specific language in Notepad++ for files with no extension Convert a string representation of a hex dump to a byte array using Java? I am looking for a way to convert a long string (from a dump), that represents hex values into a byte array.  I couldn't have phrased it better than the person that posted .  But to keep it original, I'll phrase it my own way: suppose I have a string "00A0BF" that I would like interpreted as the  byte[] {0x00,0xA0,0xBf}   what should I do?  I am a Java novice and ended up using BigInteger and watching out for leading hex zeros. But I think it is ugly and I am sure I am missing something simple. How to prove a finite field is not ordered? I have a set S={0,1}, and the addition and multiplication rules are  \begin{array}{c|cc} +&amp;0&amp;1\\ \hline 0&amp;0&amp;1\\ 1&amp;1&amp;0 \end{array}  \begin{array}{c|cc} *&amp;0&amp;1\\ \hline 0&amp;0&amp;0\\ 1&amp;0&amp;1 \end{array}  It is sure that it is a field. How can I prove this field can be ordered or not? Since I upgraded to Windows 10, my system has been consuming RAM excessively    I've been reading a bit and determined it's likely a driver leaking memory. So I got myself the Windows Driver Kit and tracked memory usage with poolmon:    However, I don't really know how to proceed from here. Is the item tagged "smNp" the culprit in this issue? How do I go from there to actually identifying the driver?  I tried some stuff like "C:\Windows\System32\drivers>findstr /s smnp ." but it returned no results. I also took a look at the pooltag.txt file and this is the description I found for it:      So yeah, any help would be appreciated. Thanks in advance. This is result of who -uH:  NAME     LINE         TIME             IDLE          PID COMMENT me    :0           2013-08-29 01:29   ?          1686 (:0) me    pts/0        2013-08-29 01:42  old         2905 (:0) me    pts/1        2013-08-29 01:45  old         2905 (:0) me    pts/2        2013-08-29 01:52  old         2905 (:0) me    pts/3        2013-08-29 02:26  old         2905 (:0) me    pts/4        2013-08-30 18:37 00:07        2905 (:0) me    pts/5        2013-08-29 10:34  old         2905 (:0) me    pts/6        2013-08-29 11:05  old         2905 (:0) me    pts/7        2013-08-29 13:34  old         2905 (:0) me    pts/8        2013-08-30 15:56 02:45        2905 (:0) me    pts/9        2013-08-30 18:27 00:17        2905 (:0) me    pts/10       2013-08-30 17:34   .          2905 (:0) me    pts/11       2013-08-30 17:37 00:13        2905 (:0) me    pts/12       2013-08-30 18:28 00:17        2905 (:0) me    pts/13       2013-08-30 18:38 00:07        2905 (:0)   Why it lists my username in 15 lines? How do I know If someone has connected to my system remotely? Recently, there was some news that said that the researchers at NASA have come across some impossible kind of space engine which does not require any fuel. I have read at a few places like ,  and . They all say that this engine seems to violate the laws of physics including conservation of momentum.  The original paper is .  Is the statement that it violates conservation of momentum true? Why does this identity hold for Fejér Kernels? I've seen some of the other threads on using strings as x axis labels, but nothing that fits my situation.  I'm trying to create a bar chart from a CSV file. I can do it so long as everything in the data is numeric. However, in my actual data table, the first row is multi-word string descriptions. I need these descriptions to be the x axis labels for each bar.  I've tried symbolic x coords, but I get the "could not parse input as a floating point number" error. I've also tried adding an ID column and using that as the x values, and assigning xtick labels as the string descriptors. I get the same issue that way.  Here's an attempt at an MWE:  \documentclass{article}  \usepackage{lmodern} \usepackage{tikz} \usepackage{pgfplots} \usepackage{pgfplotstable}  \begin{document}  \pgfplotstabletypeset[columns/category/.style={string type},col sep=comma]{Book3.csv} \vspace{1cm}  \begin{tikzpicture} \begin{axis}[ ybar, xlabel=Xstuff, ylabel=Value, symbolic x coords={cat a,cat b,cat c,cat d,cat e,cat f,cat g}, %xtick labels={cat a,cat b,cat c,cat d,cat e,cat f,cat g},% this is from when i tried the xtick label method xtick=data, nodes near coords, nodes near coords align={vertical}] \addplot table[x=category,y=value]{Book3.csv}; %\addplot table[x=category,y=value]{Book3.csv};&amp; again, from trying the xtick label method  \end{axis}  \end{tikzpicture} \end{document}   Since I suspect this might get answered quickly by you chart gurus, I have a follow-up question:  I have to do a bunch of these charts, and I would like to automate the symbolic x coords process. Is there a way to populate the dictionary of accepted x coords by reading a column of the data? (something like symbolic x coords={columns/category/{Book3.csv}} )?  Book3.csv looks like this (ignore the ID column if using the xtick label method):  ID, category, value, value 2 1,  cat a,    1,     7 2,  cat b,    2,     6 3,  cat c,    3,     5 4,  cat d,    4,     4 5,  cat e,    5,     3 6,  cat f,    6,     2 7,  cat g,    7,     1 Ridiculous error on all google play store Using CM 10.1.3 How to figure if it is safe to travel to the area I am interested in? When planning a trip, I like to make sure I will feel safe enough (I am talking about war/terrorism risk, not pickpockets), or at least I like to have an idea about the risks. I know the risk could be subject to political views (for example the political stability of a region might not be acknowledged by every country) and therefore I am mostly interested in a Western country view.  In order to figure that, I thought about checking travel operators offers. I suppose if they do not organise trips to a specific region, it might be due to political instability risks. But it might be due to a lack of tourist interest too. As I tend to travel without their help, I am not really considering this kind of source as very helpful.  So I am interested in one (or two, for cross-checking) source(s) of information with a western view (I mean I understand the view could be biased) regarding the security of ideally any area in the world. My expectation is that, the same way I can browse a tour operator's catalog of visited areas, I could browse through the areas and see if it is recommended or not to travel there.