I want to create a batch file which is capable of downloading any files from direct links.  I already tried this:   chrome start http://dl2.romhustler.net/download/MTOeeo3FWffukwoWvagsXw/1430069124/psx_full/Dino%20Crisis%20%5BU%5D%20%5BSLUS-00922%5D.rar   The commands are all in the same line and I tried with quotes and without quotes.  I always get a Forbidden 403 error.  However when I copy and past the link in search bar the file starts downloading without any issue.  Is there any way to make this work?  I am using Windows 7 Ultimate 32-bit.
Without using any non-standard (Windows included) utilities, is it possible to download using the Windows command line?  The preferred version is Windows XP, but it's also interesting to know for newer versions.  To further clarify my question:   It has to be using HTTP The file needs to be saved Standard clean Windows install, no extra tools   So basically, since everybody is screaming , I want simple Wget functionality, without using Wget.
I'm about to start exploring the world of long exposure shots, using my Canon EOS M. The camera has a standard max exposure time of 30 seconds, but in bulb mode I can keep the shutter open indefinitely (using a wireless remote to control the shutter.)  How long can I leave the shutter open without running the risk of prolonged exposure to light damaging my sensor?  For the purposes of this question assume I'm shooting in summer daylight, so that we can go by the worst case. Why can't I sort questions by "votes" or "unanswered" without logging in? I am looking for system monitoring tools which are GUI and CLI or web-based which include basic functions such as:   CPU Usage Ram Usage Swap Usage Disk Usage ( Space / I/O ) Heat Monitoring   I know there are many tools I can use, but I am looking for a single tool that has these basic functions. How to show path-connectedness of $GL(n,\mathbb{C})$ Well, I am not getting any hint how to show $GL_n(\mathbb{C})$ is path connected. So far I have thought that let $A$ be any invertible complex matrix and $I$ be the idenity matrix, I was trying to show a path from $A$ to $I$ then define $f(t)=At+(1-t)I$  for $t\in[0,1]$ which is possible continous except where the $\operatorname{det}{f(t)}=0$ i.e. which has $n$ roots and I can choose a path in $\mathbb{C}\setminus\{t_1,\dots,t_n\}$ where $t_1,\dots,t_n$ are roots of $\operatorname{det}{f(t)}=0$, is my thinking was correct? Could anyone tell me the solution? Taken from :  Show that it cannot be the case that $U=X+Y$ where $U$ is uniformly distributed on [0,1] and $X$ and $Y$ are independent and identically distributed. You should not assume that X and Y are continuous variables.  A simple proof by contradiction suffices for the case where $X$, $Y$ are assumed discrete by arguing that it always possible to find a $u$ and $u'$ such that $P(U\leq u+u') \geq P(U\leq u)$ while $P(X+Y \leq u) = P(X+Y \leq u+u')$.  However this proof does not extend to $X,Y$ being absolutely continuous or singular continuous. Hints/Comments/Critique? A question about a primitive root mod $p=2^{2^k}+1$, where $p$ is prime. Should one downvote answers to off-topic questions? It annoys me when people post answers to obviously off-topic questions like , especially after those questions have already received several close votes. Migrations seem to happen rather infrequently these days, so there's probably no reputation to gain for questions that are likely to be closed. And although sure, the answer may help the OP, it also encourages bad behavior (posting off-topic questions.)  Is it appropriate to downvote these answers?   Personally, I think I could make a case for both sides. Alert on edit after a downvote I wonder if it would be possible to extend the current notification system.   Namely, if I downvote a question and that thing had an edit, I'd be happy to see that in my inbox. As possibly the cause for downvote was cleaned up and it should be undone. In a ring $(A,+, \cdot)$ if $aba = a$ then $bab = b$ and all non zero elements in $A$ are invertible. Let $\left(A,+, \cdot\right)$ be a ring with $1$  that satisfies the following condition:  For any nonzero $a\in A$, there exists a unique $b\in A$ such that $aba = a$.  Show that $b$ also satisfies $bab = b$, and that all nonzero elements of $A$ are invertible. How do I count the number of occurrences of a char in a String? Blender worked fine before I installed a GPU to my PC. Is it the GPU? How can I fix this? I already reinstalled to the latest version. When I try to move a cube, the orange outline only moves but not the cube and I cant click it. Schwarz's Lemma, fixed points question This is from an old qualifying examination question.  If f is holomorphic in the unit disk $D$ and $|f(z)|&lt;1$ for all $z\in D$. Suppose also that $f$ has two distinct fixed points in $D$ then $f(z)=z$ for every $z\in D$  I know that I have to use the Schwarz's lemma and may be make use of Möbius transformations. I tried setting $g(z)=\phi_a\circ f\circ \phi_{-a}$. But that does not seem to work because I don't see why $|g(z)|=|z|$ for some non zero $z$.   Any helpful hints are greatly appreciated.  Edit: Of course the $a$ above is one of the fixed points. We have played a 7-team competition, all seven teams met, we eliminated the team with the lowest points. After that the remaining six teams played knock out games and the three winning teams will go direct to semi-finals.  We decided that 4 teams should be picked to go for semi-final and that the best loser will join the other three to make it four teams to battle at the semi-final and final.  During the quarter final games, one team is beaten 2-0, another is beaten 3-0 and the third team is beaten in a penalty shoot-out by 4-0.  Now should you want a best loser to join the other three teams making four teams to play in the semi-final, who among these three teams would be in the best losers position. Its very easy to prove $p\mid n^p-n$ for p=3,5,7, it fails for p=9 because $$     (n+1)^9-(n+1)= n^9+9n^8+36n^7+84n^6+126n^5+126n^4+84      n^3+36n^2+8n $$ and $84= 2²\times 3\times7$. Is it true for any $p$ prime? I have checked many primes, but have no idea for the general case. Just noticed the "meta user" link under the picture and reputation on the Stack Exchange user's page. It doesn't seem to work for all users. Error is "Page Not Found".   Not working:  /  Working:  /    My guess is this is because they've never logged into the meta site. 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? Why Normality assumption in linear regression "Much more easy" versus "much easier" Integrating Factor Method. Why Can We Set the Constant of Integration to Zero? My textbook gives a demonstration of the use of the integrating factor method for solving first order ordinary differential equations:  $\dfrac{dx}{dt} + p(t)x = r(t)$  $\implies g(t)\dfrac{dx}{dt} + g(t)p(t)x = g(t)r(t)$  $\dfrac{d}{dt}[g(t)x]$  We use the product rule and compare the expression to the left-hand side of the above equation:  $g(t)\dfrac{dx}{dt} + \dfrac{dg}{dt}x = g(t)\dfrac{dx}{dt}+g(t)p(t)x$  $\therefore \dfrac{dg}{dt} = g(t)p(t)$  The above equation is separable.  $\therefore \int\dfrac{dg}{g(t)} = \int p(t) dt$  $\implies ln[g(t)] = \int p(t)dt$  My textbook then says that, "We can set the constant of integration to zero -- any function that satisfies $\dfrac{dg}{dt} = g(t)p(t)$ will do for our purposes". However, it gives no explanation as to why this is the case. Why can we set the constant of integration to zero? Why is any function that satisfied $\dfrac{dg}{dt} = g(t)p(t)$ appropriate for our purposes?  I would greatly appreciate it if people could please take the time to elaborate on this. How to check if installing a package will require a reboot? I often install packages and updates for them, although sometimes it is not convenient to do a reboot if one of the packages needs it, so is there any way of telling BEFORE installing the package/update whether or not it will require you to do a reboot? I have already looked  and the solutions there don't solve my problem, nor the more or less same one described there.