How to check downloaded file against its hash (SHA-256 Hash, SHA-1 Hash, MD5 Hash) on windows?
Is there a built-in checksum/hash utility on Windows 7?
The ideal $I= \langle x,y \rangle\subset k[x,y]$ is not a principal ideal.   I don't know how to consider it. Any suggestions? Can't install jdk on Fedora with yum nor with rpm In the following question  the notation $c\in ]a,b[$ is used. What does this mean? I have never seen it before. Looking for illustrator script to swap all objects with another I have a map with small circles for over 200 cities. I need to change all of the circles into map pins. Is there a way to do this? I think it's a script maybe.   I know how to select all objects of the same appearance and give them a new graphic style but that will only let me change the color, stroke, etc. not replace with a new shape. Is it a scam if the person only wants to deposit into my account, not make a withdrawal? A man in  west  coast  Austria wants to deposit money  into  my account.  I'm in Alabama.  I had to get an online  account.  I did that, but he says his bank manager  needs all this information:   DOB SSN    online access username  online access  password   security  question and answer   bank name   bank address   bank number  person who is on the account     their name their address    account no   routing no     OK. Is it safe  to do this or am I being scammed?  I don't want him  to be able to end up withdrawing all my money instead of depositing money. Ubuntu 12.04 APT Proxy? I'm using Ubuntu 12.04 on a password-protected proxy network. My web browser is configured and works, but I cannot install packages from apt or similar. Is there a way to configure apt to use my proxy? Is there a way to configure my entire system to use my proxy? What should be the intuition when working with compactness? I have a question that may be regarded by many as duplicate since there's a  one at MathOverflow. The point is that I think I'm not really getting the idea on compactness. I mean, in $\mathbb{R}^n$ the compact sets are those that are closed and bounded, however the guy who answered this question and had his answer accepted says that compactness is some analogue of finiteness. That's the first problem: In my intuitive view of finiteness, only boundedness would suffice to say that a certain subset of $\mathbb{R}^n$ is in some sense &quot;finite&quot;. On the other hand there's the other definition of compactness (in terms of covers) which is the one I really need to work with and I cannot see how that definition implies this intuition on finiteness. Also, I feel it's pretty strange the covers people use when they want to deal with compact sets. To prove a set is compact I know they must show that for every open cover there's a finite subcover; the problem is that I can't see intuitively how one could show this for every cover. Also when trying to disprove compactness the books I've read start presenting strange covers that I would have never thought about. I think my real problem is that I didn't yet get the intuition on compactness. So, what intuition should we have about compact sets in general and how should we really put this definition to use? Can someone provide some reference that shows how to understand the process of proving (and disproving) compactness? I'd like to know if there is a way to run  program/shell script without typing full path:  /opt/idea/bin/idea.sh Infinite product with sign changes. For infinite products I know the following theorems:  Theorem I. If $a_n \geq 0$ for all $n$ then $\prod (1+a_n)$ converges if and only if $\sum a_n$ converges.  Theorem II. If $-1 &lt; a_n \leq 0$ for all $n$ then $\prod (1+a_n)$ converges if and only if $\sum a_n$ converges.  My question is what are necessary and sufficient conditions (possibly including more restrictions than in I and II) for $\prod (1+a_n)$ convergence/divergence as related to  $\sum a_n$ convergence/divergence  if the sequence of terms $a_n$ can switch signs repeatedly but always stay greater than $-1$.  I already know the trivial equivalence of $\prod(1+a_n)$ and $\sum\ln(1+a_n)$. Nonconstant polynomials do not generate maximal ideals in $\mathbb Z[x]$ What is the black thing on the circuit What is the black thing on the below circuit?   Is it used to hide the IC (or other components) that is used on the circuit?   What material is it? Array#each vs. Array#map Is there a goto or any equivalent in Python to be able to jump to a specific line of code? Want to install VirtualBox Guest Additions on CentOS 7 but get a header mismatch How much does it cost to have a custom ASIC made? I have browsed several ASIC manufacturer's webs, but I haven't found an actual number. I assume there would be a fixed cost associated with creating masks and such and then there will be a cost per unit.     Note: that I don't actually want to have an ASIC made, I'm just curious. What commands (exactly) should replace the deprecated apt-key? Why is integration the inverse of differentiation Deleting 'garbage' nodes after polygon dissolve I work with QGIS 2.10.1 on Windows 7 (x64). I have dissolved polygons from an attribute value and the polygons geometries being not perfectly joined together, I get some 'garbage' nodes I need to delete. I have tried to edit the layer and using nodes tool, selecting and deleting the nodes, but it seems impossible to do (nodes are not deleted at all!). Any idea on how to process this kind of clean-up?  EDIT : you can  for testing. Is there any difference in equals and == for String variables? if ('text'.equals(str))   or   if ('text' == str)   Is there any difference? If yes, then what is it?   Added, after answered.  String q = 'teXt'; system.debug('teXt'.equals(q)); // true system.debug('teXt' == q);      // true system.debug('text'.equals(q)); // false system.debug('text' == q);      // true The moderator agreement is visible at the following URL:       I acknowledge and agree that as a moderator for Stack Exchange Inc.      I will abide by the then-current Terms of Service of Meta Stack   Exchange, and other moderator policies made available to me,      I acknowledge that I may have access to potentially   personally-identifying information about Meta Stack Exchange users and   that in connection with such access      I will use such information solely in accordance with the then-current   Privacy Policy of Meta Stack Exchange,      I will not disclose this information to anyone,      I will not store or copy this information and      I will only use such information in connection with performance as a   Meta Stack Exchange moderator for the benefit of Meta Stack Exchange.      I acknowledge and agree that I am an independent volunteer moderator   to Meta Stack Exchange and I am not an employee, agent or   representative of Stack Exchange Inc., and I have no authority to bind   Stack Exchange Inc. in any manner. Stack Exchange Inc. reserves the   right to terminate my privileges as a moderator at any time without   warning.   It hasn't been updated with the new company name and still refers to Stack Exchange Inc. instead of Stack Overflow (Inc.?).