Multiplying doubles in Java create "longer" values... ¿How to fix it?
Is floating point math broken?
The screenshot below says it all, really. The object is offset in both the X and the Z axes, though only the X axis says 1. No other modifiers are on it, no constraints, no locked axes, and I can't think of anything else that would affect this. How can I make it stop doing this? Map display not filling window in QGIS on Mac? A word for a symbol which has outlived its origin I am quite sure that there is a word for a symbol which was originated by a real-life, physical prototype but has since then outlived its origin.  Most notable example: the save button with floppy drive on it. Also, to a lesser degree, envelopes in email clients, and so on.  The "anachronism" or "metonymy" are close, but not exactly what I'm searching for. Why have header files and .cpp files? Why does C++ have header files and .cpp files? Differential form is closed if the integral over a curve is rational number. The following problem comes from do Carmo's book Differential Forms and Applications, Chapter 2, Exercise 4:  Let $\omega$ be a differentiable 1-from defined on an open subset $U\subset \mathbb{R}^n$. Assume that for each closed differential curve $C$ in $C$, $\int_C \omega$ is a rational number. Prove that $\omega$ is closed.   Can anyone give some hints? My idea was that we could try to show the integral vanishes if the curve lies in $N_\epsilon (p)$ (i.e. a small neighborhood around $p$) for any $p$ in $U$ and use the Poincare Lemma, but failed. Cannot remove a repository that complains it has no public key \texttt overfull hbox problem I asked a question earlier about \verb and overfull hbox :   And regarding the solution there, changed many of my \verbs to \texttt{}s.  I have come up with a new problem now.  An example:  \documentclass {article} \begin{document} \section {Introduction}      The entry point is in \texttt{TRCS.Main()} (\texttt{TRCS\char`\\TRCS.cs}).    The stateless (see \S 3.4.3) forms are started immediately, then another controller   is invoked, namely  \texttt{Workflow}. \end{document}   Compiling this example will show my problem.  \texttt{Workflow} causes an overflow, and a rather significant one.  What should I do to alleviate the problem?  Thanks in advance for your help! A coin is tossed $n$ times. What is the probability of getting odd number of heads?   I started this chapter sometimes ago and faced in front of a tough problem. At first I started considering cases. Case-I : The probability of getting 1 head.Case-II : The probability of getting 3 head and so on. But there are many cases. So how can I solved this . Please help me. Thank you! With regards to  post about  and the part about retaining reputation earned from deleted posts that have a score of 3 or better and were visible on the site for 60 days, does this also apply to self-deleted posts and will it continue to do so? I culled a few of my own answers over the weekend that were less than stellar, and my reputation dropped 1.8k, but the rep is back today after the changes were announced. I thought it would be useful to clarify that this also applies to self-deleted stuff. Why can't the indefinite integral $\int\frac{\sin(x)}{x}\mathrm dx$ be found? I came across a list of functions in my calculus textbook whose indefinite integral cannot be found. It was written that the integral $$\int \frac{\sin(x)}{x} dx$$ cannot be evaluated without any explanation as to why.  I did some research over the internet and found out that the definite integral $$\int_{0}^{\infty} \frac{\sin(x)}{x} dx$$ can be evaluated using Laplace transformation and is equal to $\pi /2$. But I still couldn't find answer to my original question. I read somewhere that the integral cannot be expressed using 'elementary functions'. A little help is appreciated, I'm in Calc 1 going advanced than my course but I am sorry if my post shows lack of research. Thank you! Consequences of not showing up for one leg of journey A and B disjoint, A compact, and B closed implies there is positive distance between both sets Claim: Let $X$ be a metric space. If $A,B\in X$ are disjoint, if A is compact, and if B is closed, then $\exists \delta&gt;0: |\alpha-\beta|\geq\delta\;\;\;\forall\alpha\in A,\beta\in B$.  Proof. Assume the contrary. Let $\alpha_n\in A,\beta_n\in B$ be chosen such that $|\alpha_n-\beta_n|\rightarrow0$ as $n\rightarrow \infty$.  Since A is compact, there exists a convergent subsequence of $\alpha_n\;(n\in\mathbb{N})$, $\alpha_{n_m}\;(m\in\mathbb{N})$, which converges to $\alpha\in A$.  We have   $$|\alpha-\beta_{n_m}|\leq|\alpha-\alpha_{n_m}|+|\alpha_{n_m}-\beta_{n_m}|\rightarrow0 \;\;\;as\;\;m\rightarrow\infty.$$ Hence $\alpha$ is a limit point of B and since B is closed $\alpha\in B$, contradiction.  Is my proof correct? I feel as though I am missing something simple which would trivialize the proof. How should a GM deal with "standing orders?" How can I highlight text before a character with listing? All is in the title. I would like to add a color to the text before a character with listing package.  For example, I would like to add a color to text between the beginning of a line and : or =, in a makefile.  I tried to use moredelimiters but I did not succeed.    \documentclass{article}  \usepackage{listings} \usepackage{xcolor} \definecolor{keycolor}{RGB}{172, 42, 42} \definecolor{mbleu}{RGB}{64,96,127} \definecolor{vimvert}{RGB}{46, 139, 87}  \lstdefinestyle{global}{   basicstyle=\ttfamily\scriptsize\color{black!90},%   stringstyle=\itshape\color{magenta},%   showstringspaces=false,%   keywordstyle={\bfseries\color{keycolor}},%   commentstyle=\color{blue}\slshape,%   framexleftmargin=1mm,%   backgroundcolor=\color{black!2},% }  \lstdefinestyle{makefile}{   style=global,%   morecomment=[l][commentstyle]{\#},%   emphstyle={\color{vimvert}},%   moredelim=[s][emphstyle]{\$(}{)}% }  \begin{document}  \begin{lstlisting}[style=makefile] .SUFFIXES: .inc .f .f90 .F  # all CPP processed fortran files have the extension .f90 SUFFIX=.f90  #----------------------------------------------------------------------- # this release should be fpp clean # we now recommend fpp as preprocessor # if this fails go back to cpp CPP_=fpp -f_com=no -free -w0 $*.F $*$(SUFFIX)  vasp: $(SOURCE) $(FFT3D) $(INC) main.o      rm -f vasp     $(FCL) -o vasp main.o  $(SOURCE)   $(FFT3D) $(LIB) $(LINK) makeparam: $(SOURCE) $(FFT3D) makeparam.o main.F $(INC)     $(FCL) -o makeparam  $(LINK) makeparam.o $(SOURCE) $(FFT3D) $(LIB) zgemmtest: zgemmtest.o base.o random.o $(INC)     $(FCL) -o zgemmtest $(LINK) zgemmtest.o random.o base.o $(LIB) dgemmtest: dgemmtest.o base.o random.o $(INC)     $(FCL) -o dgemmtest $(LINK) dgemmtest.o random.o base.o $(LIB)  ffttest: base.o smart_allocate.o mpi.o mgrid.o random.o ffttest.o $(FFT3D) $(INC)     $(FCL) -o ffttest $(LINK) ffttest.o mpi.o mgrid.o random.o smart_allocate.o base.o $(FFT3D) $(LIB) kpoints: $(SOURCE) $(FFT3D) makekpoints.o main.F $(INC)     $(FCL) -o kpoints $(LINK) makekpoints.o $(SOURCE) $(FFT3D) $(LIB)  clean:       -rm -f *.g *.f *.o *.L *.mod ; touch *.F \end{lstlisting}  \end{document} Let $\{E_n\}_{n\in\mathbb{N}}$ be a sequence of countable sets and let $S=E_1\times\cdots\times E_n\times\cdots $. Show $S$ is uncountable. Prove that the same statement holds if each $E_n=\{0,1\}$.  By the definition of Cartesian product of sets,   $$\displaystyle S=\Pi_{n\in\mathbb{N}} \{f\colon\mathbb{N}\rightarrow\cup_{n\in\mathbb{N}}E_n\mid\forall n, f(n)\in E_n\}$$  If $E_n=\{ 0,1\}$, then  $$\displaystyle S_{01}=\Pi_{n\in\mathbb{N}}\{0,1\}=E^{\mathbb{N}}$$, where $E=\{0,1\}$.  By a theorem, $\cup_{n\in\mathbb{N}} E_n$ is countable since the sequence is countable.  I'm not sure how to go on from here to show $S$ is uncountable. Can we say anything about the function $f$ that maps a countable $\mathbb{N}$ to another countable union of sequence of countable sets? As we know a first order theory $T$ is finitely axiomatizable if there is a finite set $F\subseteq T$ of axioms such that $F\vdash \sigma$ for every $\sigma \in T$.   How we can prove if $\mathsf{ZF}$ is consistent, then $\mathsf{ZF}$ is not finitely axiomatizable? By using the Reflection Theorem or any other if we could use? I have a very simple jQuery Datepicker calendar:  $(document).ready(function(){     $("#date_pretty").datepicker({      }); });   and of course in the HTML...  &lt;input type="text" size="10" value="" id="date_pretty"/&gt;   Today's date is nicely highlighted for the user when they bring up the calendar, but how do I get jQuery to pre-populate the textbox itself with today's date on page load, without the user doing anything?  99% of the time, the today's date default will be what they want. I'd like to create a Categorized style in QGIS, classify with it data in a shapefile and then save the shapefile with the new categorized style. Is it possible? Remove duplicates from a List in C# Anyone have a quick method for de-duplicating a generic List in C#? story on forest timescale I'm looking for the title of a short story by Ursula Le Guin about a scientist (?) who is given a drug that slows the timescale of his perception enormously, so that he can perceive that an alien (?) forest is actually behaving as a sentient being, reacting to current events, but at an enormously slow (from a normal human point of view) timescale. It might be in , but I don't remember the title (and it doesn't jump out at me from the list of titles) and don't have access to that collection right now. It is not &quot;The Word for World is Forest&quot;, nor &quot;Direction of the Road&quot; (from ), nor &quot;Vaster than Empires and More Slow&quot;, the latter two of which look at similar plant perception/time-scale issues. Update: it turns out that the description was right, but I had most of the details wrong: not Le Guin, not alien, not a scientist ...