| Thread | Last Post | Replies |
|
| Euclid's algorithm | 31 Jan 2009 22:04 GMT | 4 |
How can one show that the Euclid's algorithm requires at most floor{log_2(x)+log_2(y)}divisions in order to find gcd(x,y) ? What would be an example of an algorithm that used at most floor{sqrt(x)}divisions to find a proper factor of x or deduce that x is prime? Any help would ...
|
| Folium of Descarte | 31 Jan 2009 21:10 GMT | 1 |
Anyone know if there's anyway to plot the Folium of Descarte using Geometer's Sketchpad? If not, is there any cheep software that can do it?
|
| JSH: Probably right, but kind of depressing, you know? | 30 Jan 2009 14:11 GMT | 54 |
Several months ago I found a general solution to binary quadratic Diophantine equations. In retrospect it kind of makes sense that with that first in human history, a solution to the factoring problem might kind of spontaneously emerge, but this thing I'm considering now is so
|
| big O notation | 30 Jan 2009 05:41 GMT | 1 |
show that 2^n is O(n!) ! = factorial 2^n = 2 to the power n
|
| time function | 30 Jan 2009 04:15 GMT | 3 |
order the growth rates of the following functions , from lowest to highest (functions are in image below) http://www.oniva.com/upload/1356/math.jpg
|
| cannot get in contact | 30 Jan 2009 04:11 GMT | 1 |
I'm trying to e-mail you to ask you for the solutions for this book, but the e-mail masking is not allowing me to unlock your e-mail address... Introduction to Microelectronic Fabrication: Volume 5 of Modular
|
| Carpenterial angles | 29 Jan 2009 23:01 GMT | 7 |
January 23, 2009 How is the math done in the following situation? You wish to cut down an 8-foot sheet of plywood from 96 inches to 92-5/8 inches. You position the hook of your steel tape measure on
|
| JSH: Real world is complicated | 29 Jan 2009 22:12 GMT | 6 |
I am the most influential person who posts here. It's that simple. And if you care you can find out I am, but of course, many of you believe that's a delusion or some narcissistic fantasy no matter what Google search results I can show you.
|
| Statistics? | 29 Jan 2009 13:48 GMT | 8 |
Hi, I'm very interested in statistics (and probability too). I would like to become reasonably knowledgeable in this area. I'm particularly drawn to prediction using multiple regression etc. The problem is that I quit school very early and thus I'm not able to solve (even ...
|
| Solutions Manuals | 29 Jan 2009 00:00 GMT | 7 |
I am selling solution manuals for $5.00. I only accept payments through PAYPAL. Please do not post back on this site, send me an email if you are interested and i will reply with instructions. You will have your solutions manual within 24 hours, USUALLY WITHIN THE HOUR!!
|
| finding volume of complex shape | 28 Jan 2009 13:44 GMT | 2 |
The problem requires taking the region enclosed by the line x=2, the x axis, the y axis, and the curve y=2e^x + 3x and rotating it around the y axis to produce a 3D shape. The solution needs to include a definite integral and antiderivatives.
|
| JSH: Why many of you hate simple | 28 Jan 2009 01:37 GMT | 4 |
Complicated and abstruse mathematical texts that take a lot of effort to decipher give many of you in "pure math" at least the feeling that with all that effort, you must have learned something important, but over a hundred years ago a subtle error entered your field. But it is
|
| thermal simulation problem | 27 Jan 2009 18:04 GMT | 1 |
i am having some problem in ques. no. 6.14 (design of thermal systems) of design of thermal system by W.F.Stoecker(third edition).if u have the solution please send me.its very urgent thanks
|
| Solutions Manual, Test Bank, Instructor's Manual *** NEW Colloection 22/12/2008 | 27 Jan 2009 16:03 GMT | 2 |
Student Plus is the place where you can find or ask for a comprehensive solution manuals and test banks in digital formats. Those instructors’ resources save your time and effort and let you definitely understand what you are studying and get an amazing marks
|
| modular arthimetic, primes, and stuff. | 26 Jan 2009 08:19 GMT | 3 |
i) "Let p be an odd prime not equal to 5. Prove there exists an integer n such that n divides p-1 and 10^n = 1 (mod p)." I have proved that if n | p-1 then 10^n = 1 (mod p) but I haven't proved that there exists an n that divides all p-1 which would then complete the
|