I'm trying to use enscript to print PDFs from Mutt, and hitting character encoding issues with curly quotes. So that an email with text like this:  “very dirty”     we’re    Comes out as:  â\200\234very dirtyâ\200\235 weâ\200\231re   My print script currently reads like this:  #!/usr/bin/env sh INPUT="$1" PDIR="$HOME/Desktop" OPEN_PDF=evince    tmpfile="`mktemp $PDIR/mutt_XXXXXXXX.pdf`" enscript --font=Courier8 $INPUT -2r --word-wrap --fancy-header=mutt -p - 2&gt;/dev/null | ps2pdf - $tmpfile $OPEN_PDF $tmpfile &gt;/dev/null 2&gt;&amp;1 &amp; sleep 1 rm $tmpfile   Is there a way to replace the curly quotes before I send it to enscript? Or a character encoding I can use that will handle the quotes?  If there's another (better?) way to print to PDF from Mutt, I'm all ears. I just need to ensure that my quotes aren't getting fouled up.
I am trying to print a large quantity (several megabytes) of UTF-8 encoded text which consists of Chinese and Latin characters (and maybe a sprinkling of others). I would like to print it in several columns per page, in a very small, condensed font, preferably with control over line spacing. I'd quite like inter-column lines, but I can live without them. The aim is to print to PDF for transfer, as well as to paper.  I have tried enscript and a2ps, but neither of these support Unicode.  I have also tried paps, but this produces bitmapped outputs which cannot be PDF'd effectively, and also look terrible.  Is there a modern way to print UTF-8 text like this without resorting to something like constructing it manually in Python?
Index notation Lorentz transfromation matrix How do I boot into recovery mode? How can I get a DisplayLink USB monitor work under Ubuntu? I have a DisplayLink-based external USB monitor, which has both power and data over USB, and seems to work perfectly under Windows 7, but only can display a text console under Ubuntu 10.10, and that I can only use when I am actually switched to it. So the only Use I can have so far is to have some text-based monitoring or console that I can watch while working on the graphic display.   I know there are some development done for DisplayLink, but I never could get it to actually run properly.   Yes, I tried the detailed setup described in other , but they did not work, and instead crashed my X that I had to restore.   Merci :-) My floating point number has extra digits when I print it Why is $SO(3)\times SO(3)$ isomorphic to $SO(4)$? While studying the problem of determining the orbit of a binary star system, my astronomy notes say: "the projection of an ellipse onto a plane is still an ellipse (except the special case in which it's a segment)". How could I prove this?  EDIT: As suggested i'm adding what I know about ellipses. I know the basics of ellipses in the plane, the equation of an ellipse in a plane in cartesia coordinates, the equation of an ellipse in polar coordinates, the fact that ellipses can be obtained by the intersection of planes with a cone. In my geometry course we defined ellipses as the the points of the plane such that the ratio between the distance from a point and a line is constant and less than 1. I also know that the sum of the distances of the points of the ellipse from the foci is constant. Show $$\frac{(2n)!}{n!\cdot 2^n}$$ is an integer for $n$ greater than or equal to $0$.   Could anyone please help me with this proving? Thanks! How do you prove a number is prime? I am a software engineer but try to keep up with maths as I really enjoyed the subject at school. I just saw a great TED talk:   The talk states that the current largest known prime is $2^{57885161}-1$  This got me thinking - how does one actually prove whether a number this large is prime or not?  Is it just done by brute force via a computer algorithm or are there any well known mathematical techniques for doing so?  I would be really grateful for any pointers as I am eager to learn about these techniques (if they exist). I'm trying to set up file transfer via FileZilla and it doesn't seem to matter what details I put in, I always get the following error:     Status: Connection attempt failed with "ECONNREFUSED - Connection   refused by server". Error: Could not connect to server   My Dad has tried on his computer (with FileZilla on Windows) and it connects and everything is fine.. When I try on mine with all the same details that he put in, it comes up with that error.  I read that a firewall might be blocking it so I double checked and my firewall through system preferences and it is off.  Anybody know why this might be???  Additional info:  Macbook Pro running OS X El Capitan version 10.11.6  FileZilla version 3.23.0.2 Get the name of an object's type Is there a word for one side in a pair? Is there a word for one side in a pair? In a conversation it would the the interlocutor, but I'm looking for a generic term. What's wrong with this equal probability solution for Monty Hall Problem? I'm confused about why we should change door in the Monty Hall Problem, when thinking from a different perspective  gives me equal probability.   Think about this first: if we have two doors, and one car behind one of them, then we have a 50/50 chance of choosing the right door.   Back to Monty Hall: after we pick a door, one door is opened and shows a goat, and the other door remains closed. Let's call the door we picked A and the  other closed door B. Now since 1 door has already been opened, our knowledge has changed such that the car can only be behind A or B. Therefore, the problem is equivalent to: given two closed doors (A and B) and one car, which door should be chosen (we know it's a 50/50 thing)? Then, not switching door = choosing A, and switching door = choosing B. Therefore, it seems that switching should be equally likely, instead of more likely.   Another way to think: no matter which door we choose from the three, we know BEFOREHAND that we can definitely open a door with a goat in the remaining two. Therefore, showing an open door with a goat reveals nothing new about which door has the car.   What's wrong with this thinking process? (Note that I know the argument why switching gives advantage, and I know experiments have been done to prove that. My question is why the above thinking, which seems legit, is actually wrong.) Thanks. Why doesn't a block rotate due to friction? Can you attack with different weapons using Extra Attack? The fighter's  feature (PHB, p. 72) says:     Beginning at 5th level, you can attack twice, instead of once, whenever you take the Attack action on your turn.   Assuming I am holding two different weapons, and don't want to spend my bonus action on Two-Weapon Fighting, can I attack once with each weapon? Is expression for law of equipartion of energy valid for real gas? I know that according to law of equipartion of energy ,energy per molecule per degree of freedom is 1/2 Kb T I wanted to know if it is true for a real gas ? Are there any free/open source alternatives to Adobe After Effects? I've been a illustrator and graphic designer for a number of years and now I'm looking to go more into motion graphics and visual effects. Is there anything that is open source/free (not a demo, education version or trial) that is as complex and feature-rich as Adobe After Effects but for Linux? I've tried Cinlerra, kdenlive, openshot and Blender and whilst they are good at video editing (and 3d modelling in Blender's case) they fall short in effects and compositing features.  I've also tried , but the project recently closed and the last update was quite buggy.  Also,  doesn't work and hasn't been updated in many many years, so don't mention it ;-) How do ideal quotients behave with respect to localization? Suppose $R$ is commutative ring with unity. For ideals $I$, $J \subseteq R$, the ideal quotient $(J:I)$ is $$(J:I) := \{x\in R \, : \, xI \subseteq J\}$$ Let $S\subset R$ be a multiplicative set. When does localization at $S$ commute with taking quotients, i.e. when does the equality $$(S^{-1} J : S^{-1} I) = S^{-1} (J:I)$$ hold? More generally, when is it true that $$S^{-1} \text{Ann}_{R} (M) = \text{Ann}_{S^{-1} R} (S^{-1} M)$$ for an $R$-module $M$? "detached entity passed to persist error" with JPA/EJB code I am trying to show that $a^{12} \equiv 1 \mod 32760$ for each $a \in \mathbb{Z}$ coprime to $32760$. I have found the prime decomposition $32760 = 2^3 \cdot 3^3 \cdot 5 \cdot 7 \cdot 13$ and determined $\phi(32760)$, where $\phi$ is the Euler's totient function. This gives me that $\phi (32760) = 8640$.   Using Euler's congruence, this gives that $a^{8640} \equiv 1 \mod 32760$, but this is still far from the result I want to show... I also know a consequence of Eulers congruence, which states that $e \equiv e' \mod \phi (n)$ implies that $a^e \equiv a^{e'} \mod n$, but I do not see how to use this...  Any hints would be appreciated.  $\textbf{EDIT:}$ I made a mistake in my primefactorization, it is edited now. Young Adult Fantasy about children living with an elderly woman and learning magic related to their skills