I am having trouble getting the graphicx package to work well when running XeLaTeX on my MAC.  I am including .jpg files; some of them scale very nicely, but others don't.  Here is the MWE  \documentclass[11pt]{book} \usepackage{graphicx} \begin{document} \includegraphics[width=1in]{behistun_photo.jpg} \includegraphics[width=2in]{behistun_photo.jpg}  \includegraphics[width=1in]{graphics/Ishango_IRSNB.jpg}  \includegraphics[width=2in]{graphics/Ishango_IRSNB.jpg}  \end{document}   When I compile using PDFLaTeX, it works just fine.  The images are scaled properly.  When I compile using XeLaTeX, the first jpg file scales properly, but not the second.  In addition, the image in the second one over-writes the lines above.  It seems that it is setting the correct space for the scaled picture, but then inserting a much larger one.
resolution is undefined in XeTeX so the following code will produce different values when compiled with pdfTeX and XeTeX.  \documentclass{article} \usepackage{graphicx}  \newsavebox\IBox \savebox\IBox{\includegraphics[scale=1]{koala.jpg}}  \begin{document} \the\wd\IBox \end{document}   How to force pdfTeX and XeTeX to produce the same measurement for the imported image?
I am new to dslr's and got a nikon 3000 with 18-55 lens as a gift.  I already see some limitations with the lens for walking about or on trails.  So my question is being new should I go with a 55-200 or 55-300 or is there another step before I go with a telephoto lens. How can I make a macOS Mojave bootable USB installer in Windows 10? Minimal polynomial of $\sqrt{2}+\sqrt{3}$ over $\mathbb Q$ I had an example in the book given as follows:        Find the minimal polynomial of $\sqrt{2}+\sqrt{3}$ over $\mathbb Q$ .       Solution:  $~~~~~$$(\sqrt{2}+\sqrt{3})^2=5+2 \sqrt6$      $(\sqrt{2}+\sqrt{3})^4=49+20 \sqrt6$       Then $(\sqrt{2}+\sqrt{3})^4-10(\sqrt{2}+\sqrt{3})^2+1=0.$       Thus $a=\sqrt{2}+\sqrt{3}$ satisfies $f(x)=x^4-10x^2+1$ over $\mathbb Q$.       Let $p(x)$ be the minimal polynomial of $\sqrt{2}+\sqrt{3}$ over $\mathbb Q$.Then $(\sqrt{2}-\sqrt{3}),(-\sqrt{2}+\sqrt{3}),(-\sqrt{2}-\sqrt{3})$ are also roots of $p(x).$   So degree of $p(x)$ is atleast $4$.      But $f(a)=0 $ and $f(x) \in \mathbb Q[x] \implies p(x)$ divides $f(x)$ .      So $f(x)$ is minimal polynomial of $\sqrt{2}+\sqrt{3}.$   But I can't get the step  how are $(\sqrt{2}-\sqrt{3}),(-\sqrt{2}+\sqrt{3}),(-\sqrt{2}-\sqrt{3})$ also roots of $p(x).$   Kindly help with this. When I have my external monitor hooked up, I access it by mousing off the left hand side of my Macbook display. Can I switch this so that I can access the external by mousing off to the right of My Macbook display?   The reason I ask, is my monitor is on the right side of my macbook, and it's unintuitive to mouse left to get to a screen on the right. Is there a "win64" identifier in Qmake project files?  documentation does not mention other than unix / macx / win32.  So far I've tried using:  win32:message("using win32") win64:message("using win64") amd64:message("using amd64")   The result is always "using win32".  Must I use a separate project-file for x32 and x64 projects, so they would compile against correct libraries? Is there any other way to identify between 32-bit and 64-bit environments? First player rolls a 6-sided die 100 times and the second player 101 times. What are the odds of the second player getting more odd numbers than the first one?  I tried solving this via listing the options which led to a nasty sum that I wasn't able to solve neither by hand nor by using wolfram alpha. Clearly there has to be a more clever solution using the properties of a binomial distribution, but so far I haven't come across anything useful. My question is a little silly I know, but I'm curious to know if a particle of light can be theoretically trapped between two reflective screens.   For example once the particle of light has left it's source, and is reflected against a mirror (assuming there is no loss of energy) and you immediately replace the source of light with another mirror. Would the light beam bounce in between the sheets endlessly? What do viruses do? There are those big green spiked things that my friends call viruses. I don't know what they do and I want to know. Do the viruses do something to the device you are playing on? Are they good or bad? How to delete a file with a weird name? I wrote a program that uses POSIX memory-mapping function (mmap)  The program takes a file (a.dat) and memory-maps it for reading/writing.  Due to errors in the program, every time I run the program a file with some weird names (e.g., ?d?P?^z??d?P?^z?) is created. The error is resolved but I am not able to delete the files.  I am not able to delete it either using command line or by select/deleting from window manager.  So how should I delete it? I'm using Ubuntu 11.04. Decode escaped Url without using HttpUtility.UrlDecode Suppose $f$ is entire and    $$\iint_\mathbb{C}|f(z)|^2dxdy &lt; \infty$$Prove that $f\equiv 0.$   So far I have:  Suppose $f$ is bounded.  Then $f$ is constant by virtue of Liouville and so the conclusion is obvious.  Thus, assume $f$ non-bounded.  Then  $$\Big|\iint_\mathbb{C}f^2(z)dA\Big| \leq \iint_\mathbb{C}|f(z)|^2dxdy &lt; \infty$$ We can parameterize \begin{align*} \iint_\mathbb{C}f^2(z)dA &amp;= \int_0^{\infty}\int_0^{2\pi}f^2(re^{i\theta})\;d\theta\;rdr \\ &amp;= \int_0^{\infty}\int_0^{2\pi}f^2(re^{i\theta})\;ire^{i\theta}[-i\frac{1}{r}e^{-i\theta}]d\theta\;rdr \\ &amp;= \int_0^{\infty}\oint_{C_R}f^2(z)\;[-i\frac{1}{z}]dz\;rdr \\ &amp;= \int_0^{\infty}2\pi r dr\frac{1}{2\pi i}\oint_{C_R}\frac{f^2(z)}{z}dz \\ \\ &amp;= 2\pi f^2(0)\int_0^\infty rdr  \end{align*}  Whence f(0) = 0.  And I have no idea where to go from there.  The "entire" bit seems to suggest Liouville but I have already dealt with the bounded case.  Please advise ... Weird sharp vertices with subdivision modifier I have a simple skull model, to which I applied the subdivision modifier. For the most part everything works as expected, except I keep getting these weird sharp vertices and I can't seem to figure out how to flatten them.    I'm using Blender 2.8. Is this some kind of feature I can disable/enable for particular vertices? The distance between the sharp vertices and the gray outline differ.    Any suggestions please? Thank you!  EDIT: I also tried selecting as both - vertexes and edges and then applied Edge->Clear Sharp, but nothing changed. Casting vs using the 'as' keyword in the CLR When programming interfaces, I've found I'm doing a lot of casting or object type conversion.  Is there a difference between these two methods of conversion?  If so, is there a cost difference or how does this affect my program?  public interface IMyInterface {     void AMethod(); }  public class MyClass : IMyInterface {     public void AMethod()     {        //Do work     }      // Other helper methods.... }  public class Implementation {     IMyInterface _MyObj;     MyClass _myCls1;     MyClass _myCls2;      public Implementation()     {         _MyObj = new MyClass();          // What is the difference here:         _myCls1 = (MyClass)_MyObj;         _myCls2 = (_MyObj as MyClass);     } }   Also, what is "in general" the preferred method? How do I prevent and/or handle a StackOverflowException? I would like to either prevent or handle a StackOverflowException that I am getting from a call to the XslCompiledTransform.Transform method within an Xsl Editor I am writing. The problem seems to be that the user can write an Xsl script that is infinitely recursive, and it just blows up on the call to the Transform method.  (That is, the problem is not just the typical programmatic error, which is usually the cause of such an exception.)  Is there a way to detect and/or limit how many recursions are allowed?  Or any other ideas to keep this code from just blowing up on me? $P(\limsup A_n)=1 $ if $\forall A \in \mathfrak{F}$ s.t. $\sum_{n=1}^{\infty} P(A \cap A_n) = \infty$ Let $\mathfrak{F} = (A_n)_{n \in \mathbb{N}}$. Prove that $P(\limsup A_n)=1$ if $\forall A \in \mathfrak{F}$ s.t. $P(A) &gt; 0, \sum_{n=1}^{\infty} P(A \cap A_n) = \infty$. (Side question 1 Is second Borel-Cantelli out because we don't know if the $A_n$'s are independent?)  Suppose $\forall A \in \mathfrak{F}$ s.t. $P(A) &gt; 0, \sum_{n=1}^{\infty} P(A \cap A_n) = \infty$, but $P(\limsup A_n)&lt;1$. My prof gave us this convenient hint: Show $\exists M &gt; 0$ s.t. $P(\bigcap_{j=M}^{\infty} A_j^{c}) &gt; 0$.  $1 &gt; P(\limsup A_n)$  $1 - P(\limsup A_n) &gt; 0$  $P(\liminf A_n^{c}) &gt; 0$  By definition of $\liminf A_n^{c}$, $\exists M &gt; 0 $ s.t. $P(\bigcap_{j=M}^{\infty} A_j^{c}) &gt; 0$. (Side questions 2 and 3 Isn't this =1? ...Wait, is that what we're trying to prove? Haha)  $\to 1 - P(\bigcup_{j=M}^{\infty} A_j) &gt; 0$  $\to 1 &gt; P(\bigcup_{j=M}^{\infty} A_j)$  Main question: Now I guess we have to come up with some A s.t.  $\to 1 &gt; P(\bigcup_{j=M}^{\infty} A_j) \geq \sum_{n=1}^{\infty} P(A \cap A_n)$, or is there something else to do? How to connect to Office Online Server in Office365 I just wondering if we can use existing Office Online Server in Office365 for SP2013 on premise. If yes, how this can be achieve?   In SP2013 we normally run Get-SPWOPIBinding to find out the server binding and to connect to Office web App we normally run  New-SPWOPIBinding -ServerName. Is this the same command if I want to connect to the existing new Office Online Server in Office365?  Thanks I´m not sure how to start with this proof, how can I do it? $$ \limsup ( a_n b_n ) \leqslant \limsup a_n \limsup b_n  $$ I also have to prove, if $ \lim a_n $ exists then: $$ \limsup ( a_n b_n  ) = \limsup a_n \limsup b_n  $$ Help please, it´s not a homework I want to learn. Greek pdf bookmarks I am puzzled with sections titled with Greek characters. They do appear in the pdf's Content list, though not correctly.  For example, in my thesis--written in English with LyX, based on the KOMA-script--I choose to include a translation of the summary in Greek (=Περίληψη). The "raw" code for the (unnumbered) chapter title reads: \addchap{\textgreek{Per\char208lhyh}}. In the final .pdf file (using pdflatex) the respective entry appears as Per208lhyh. Using the unicode option for the hyperref package does not fix the problem.  Update detail: the document (should) not only contain Chapter or Section titles in Greek, but normal text as well.  I have found some relevant references within tex.stackexchange and elsewhere (e.g., , the manual of the textgreek package, , ). However, I cannot extract a concrete answer.  How can Greek characters appear correctly as bookmarks in the .pdf's Content list?  Note, the information of this Q&amp;A applies to/under LyX as well. When were the 'and' and 'or' alternative tokens introduced in C++? I've just read this  from Reddit.  They mention and and or being "Alternative Tokens" to &amp;&amp; and ||  I was really unaware of these until now. Of course, everybody knows about the , but and and or? Since when? Is this a recent addition to the standard?  I've just checked it with Visual C++ 2008 and it doesn't seem to recognize these as anything other than a syntax error. What's going on? An awful lot of people seem to use the phrase "substitute X for Y" to mean "replace X with Y", while I've always used and understood it as "replace Y with X". This makes sense to me, given that a substitute is the replacement, not the thing which has been replaced.  I thought I might be able to figure things out from a dictionary, but now after seeing two sorts of definitions, I'm even more confused:   to put or use in the place of another to take the place of; replace   The first one suggests that the object will be the substitute (replacement), the thing put into place, while the second suggests that the object will be the thing which has been replaced.  Is one of these usages more correct in any sense? (I know this is probably a pointless question, since people will continue to speak the way they speak.) Is there perhaps a difference between American and British English?   And most importantly, is there any reliable way to tell what someone means when they ask how to substitute honey for sugar, or is the verb simply guaranteed to cause confusion?