Here's the item needing to be proofed (this is not homework, but I'm very interested in it).
Show that for each odd prime number y, there is exactly one positive integer x such that x(x+y) is a perfect square.
Thanks for any help/leads, etc..
-Steve
Okay, it would appear that I can shove my foot in my mouth. Anttech appears to be correct, as in the burner is unable to find the beginning of the disk. I've been googling for hours now, and I'm only http://www.google.com/search?q=focus+or+tracking+error&hl=en&lr=&start=120&sa=N".
Anttech...
But you've got that incorrect. This black whole has mass, and therefore something to 'stop' the light. When you shine light at a brick wall does it keep going? Nope. It's merely stopping and being refracted into -blackness- (black is simply the absence of color).
Yes,as andrewchang said. All you are finding is a speed, which is equivelent to s = d / t (speed equals distance divided by time). In your case, however, you are using degrees.
Hope this helped.
But wait up. To pull the ball back in the first place, you have to apply a force greater than the weight of the wrecking ball, no?
So, 1240*-9.8 = -12152N
And, since you are only applying 5480 N, -12152 + 5480 is -6672 (which would be the force holding the wrecking ball in place (something...
If you want a good source for -info- on the Riemann Hypothesis, check http://www.math.ubc.ca/~pugh/RiemannZeta/RiemannZetaLong.html" As I'm not as advanced as I'd like to even be able to read that, I'm 90% sure that's a very good source for the info, as well as the Java Applet :approve:
Steve
The idea of puting the nuclear spin usage into computesr is inegnious. I mean, you think we have fast comptuers now, just think about getting the computations that take several minutes today, take less than a millionth of a second! Shwew!