I just finished watching Fullmetal Alchemist 2003 series. I would like to read/watch the manga/Brotherhood anime now. Does anyone know at what chapter the story of FMA2003 and the story of the manga/Brotherhood anime go their separate ways?
Some of the Puella Magi seem to have magical powers related to the wishes that they made. Sayaka has regeneration abilities, and she wished to heal someone. Homura has time manipulation abilities, and she wished to go back in time.  But other magical girls, like Mami and Kyouko, don't appear to have powers related to their respective wishes.  So, is there a connection, or is it only a coincidence for Sayaka and Homura? If it's the former, how do Mami and Kouko's wishes relate to their powers?
\AtEveryBibitem{\clearfield{Title}} in beamer? In my beamer presentation, I want to cite the reference without title. So, I tried:  \documentclass{beamer} \usepackage[   backend=bibtex8,   defernumbers=true,   sorting=none,   firstinits=true,   uniquename=init,   uniquelist=false,   refsegment=section,   citestyle=numeric ]{biblatex} \addbibresource{mini.bib} \AtEveryBibitem{\clearfield{Title}} \begin{document} \section{Start} \begin{frame}   first cite\footfullcite{Julie2006}   %\printbibliography \end{frame} \section{2nd} \begin{frame}   Second cite\footfullcite{gyof} \end{frame} \end{document}   with the mini.bib :  @article{gyof,   Author={BLJ},   Title={Some Title},   Journal={joural1},   volume={15},   pages={1337},   Year={1985} } @article{Julie2006,   Author={JBS},   Title={Some Other Title},   Journal={journal2},   volume={74},   pages={144411},   Year={2006} }   with \AtEveryBibitem{\clearfield{Title}} I was expecting no title will be produced, but thats not the case:   Is there any incompatibility between clearfield and footfullcite? Or I am just missing something? How does bash interpret the equal operator with no surrounding spaces in a conditional? The following script does not behave as I would have expected.  Adding spaces around the '=' in the conditional made it perform how I wanted, but it got me thinking, what is it actually doing inside the conditional?  #!/bin/bash S1='foo' S2='bar' if [ $S1=$S2 ]; then     echo "S1('$S1') is equal to S2('$S2') fi echo $S1 echo $S2   The output is:  S1('foo') is equal to S2('bar') foo bar   The contents of S1 and S2 don't change from what they are assigned, so the = doesn't perform an assignment. Do newer laptop batteries still need to be drained before recharging? 10 years ago when I was doing hardware support it was best practice to fully drain a laptop battery prior to recharging in order to maximize its life.  Is this still the case or can a battery now be recharged at any point without worrying about shortening the lifespan? 'The average person' or 'an average person'? order of a sylow p-subgroup HSA - Continue to Invest? Seeing through objects in Game engine Cleaning my Macbook Pro Retina leaves greasy 'streaks' across the screen Is $\emptyset \in \emptyset$ or $\emptyset \subseteq \emptyset$? Recurrence relation for the determinant of a tridiagonal matrix Let  $$f_n := \begin{vmatrix} a_1 &amp; b_1 \\ c_1 &amp; a_2 &amp; b_2 \\ &amp; c_2 &amp; \ddots &amp; \ddots \\ &amp; &amp; \ddots &amp; \ddots &amp; b_{n-1} \\ &amp; &amp; &amp; c_{n-1} &amp; a_n \end{vmatrix}$$  Apparently, the determinant of the tridiagional matrix above is given by the recurrence relation   $$f_n = a_n f_{n-1} - c_{n-1} b_{n-1}f_{n-2}$$  with initial values $f_0 = 1$ and $f_{-1} = 0$ (according to Wikipedia). Can anyone please explain to me how they came to this recurrence relation?  I don't really understand how to derive it. How to use \def to redefine \end{split}? When I use \def to redefine \end{split}, there is an error.  \documentclass{article} \usepackage{amsmath}  \begin{document} \def\be{\begin{equation}} \def\ee{\end{equation}} \def\bs{\begin{split}} \def\es{\end{split}}  \be     \bs         a\\         b     \es \ee  \end{document}   The error is:      Runaway argument?      a\ b \es \ee       ! Paragraph ended before \split was complete.   However, if I don't use \def\es{\end{split}} and just modify the code to be  \documentclass{article} \usepackage{amsmath}  \begin{document} \def\be{\begin{equation}} \def\ee{\end{equation}} \def\bs{\begin{split}} \def\es{\end{split}}  \be     \bs         a\\         b     \end{split} \ee  \end{document}   it's OK. What's the problem? Thank you! Execute an installed Python package as a script? public class doublePrecision {     public static void main(String[] args) {          double total = 0;         total += 5.6;         total += 5.8;         System.out.println(total);     } }   The above code prints:  11.399999999999   How would I get this to just print (or be able to use it as) 11.4? Hom is a left-exact functor How can I use the MS JDBC driver with MS SQL Server 2008 Express? My configuration:     windows XP SP3 JDBC 2005 MS SQL Server 2008 Express, exposed via tcp/ip on port 1433 sqljdbc.jar in class path    I tried:  try {     Class.forName("com.microsoft.sqlserver.jdbc.SQLServerDriver").newInstance();     con = DriverManager.getConnection("jdbc:microsoft:sqlserver://localhost:1433/SQLEXPRESS2008;databaseName=Test;selectMethod=cursor", "sa", ""); } catch (Exception e) {     e.printStackTrace(); }   But it always throws an exception:  java.sql.SQLException: No suitable driver   I also tried the following urls:  localhost:1433/SQLEXPRESS2008  localhost/SQLEXPRESS2008  localhost   Same results.  Any help? Inverse metric in linearised gravity Let $G$ be a finite group and $F$ a field with $\mathrm{char}(F)=0$ or coprime to $|G|$. Let $V$ be a $FG$-module in a way that every $ FG$-homomorphism $ f : V \to V $ is given by $f(x)= \lambda x $. Then $V$ is irreducible.   I already managed to proof this by contradiction, using Maschke's Theorem. We can  write $V$ as $U\oplus W$ and get a $FG$-homomorphism $\pi:U\oplus W \to U\oplus W$, $\pi (u+w)=u$, then $\pi(u+w)=\lambda (u+w)=u $ then either $U$ or $W$ are trivial and thus $V$ is irreducible.  My question is if this statements still holds if the characterictic of $F$ divides the order of $G$, since I only used this fact in my proof to use Maschke's theorem. I want to prove this:  Prove that if $a \in \mathbb{Z}$ is divisible by $4$, then there exist $b$ and $c$ where $b,c \in \mathbb{Z}$ such that $a = b^2 - c^2$  I want to prove this directily:  $4\mid a $,  $a\in \mathbb{Z} \implies \exists b,c \in \mathbb{Z}, \quad$ s.t. $a=b^2-c^2$  Let $k\in \mathbb{Z}$. Then $4=a\cdot k$ and $k$ can divide $4$. Hence,  $\frac{4}{k} =b^2 - c^2 = (b-c)(b+c) \implies \dfrac{4}{k\cdot(b-c)} = b+c$  Is this proof correct? Where to ask question about hardware? How to load JAR files dynamically at Runtime?