| Thread | Last Post | Replies |
|
| New way to factor? Yes! | 10 Feb 2005 14:44 GMT | 19 |
Now I want to appeal to reason, once again. Factoring is important in our world. I have found a new way to factor, as I can show in a few lines: Take the two quadratics
|
| Random numbers & probabilities | 10 Feb 2005 12:52 GMT | 2 |
Can anyone help me with this little lot? 1. Is it possible in principle to choose a uniformly random real number from, say, the interval [0,1]? (By "uniformly random" I mean that every real number has an equal chance of being chosen.) I know that in
|
| Proof factoring solution is closed form | 10 Feb 2005 02:07 GMT | 5 |
One of the most important points to make, which should end the debate and get someone to contact the US Government so that authorities can be informed is the closed form proof of surrogate factoring. By closed form I mean the proof that it is a complete solution which
|
| JSH: Time is not on your side | 10 Feb 2005 01:14 GMT | 9 |
To me the basic surrogate factoring method, where you factor T and also j is not an elegant solution. However, it's the easiest to show, so I posted the equations, and I've shown I'm right.
|
| Re: Volume Solid Revolution Question | 09 Feb 2005 20:54 GMT | 2 |
It would help if I could draw a picture: A)The y axis from 0 to 1 is a boudary B)The x axis from 0 to infinity is another boundary C)There is a function whose curve describes the x axis as an asymtote
|
| Polynomial root finding procedure | 09 Feb 2005 13:38 GMT | 5 |
Hi, i have this problem and need some helps. Write a procedure which test if a given polynomial has an interger root or not. Why do we not have to worry about rational root? My thoughts were: We dont have to worry about rational root because
|
| Computability | 09 Feb 2005 13:38 GMT | 4 |
Hi, is it true that " If L1, L2 are languages over the same alphabet, L1 is subset of L2 and L2 is undecidable, then L1 is also undecidable " ? Cheers.
|
| Definition of ordered field | 09 Feb 2005 07:38 GMT | 4 |
My book states Definition of ordered field as follows: If a field F has nonempty subset S satisfying (i) For all x,y in S, x+y in S, x*y in S (ii) For all x in F, x in S or x=0 or x in -S
|
| Factoring problem, my assertion revisited | 08 Feb 2005 23:49 GMT | 12 |
Well I can at least give some idea why I figured I'd solved the factoring problem, and kept talking about theoretically, while my attempts at implementing the theory have so far failed to live up to even my expectations:
|
| Another Trig limit question | 08 Feb 2005 20:37 GMT | 10 |
I started with: lim sin(x-1) x>1 x^2+x-2 then I factored the denominator and got:
|
| Proof of Stirling formula by central limit theorem? | 08 Feb 2005 20:03 GMT | 1 |
Hi. I look for a proof of the famous Stirling formula by central limit theorem.
|
| Intermediate Value Theorem and Finding Roots | 08 Feb 2005 18:57 GMT | 1 |
Greetings! :] Could someone please explain to me how one would go about solving the following question? That would be much appreciated! Using the Intermediate Value Theorem, find the roots of cos(x) = x in
|
| Fibonacci sequence proof | 08 Feb 2005 15:37 GMT | 6 |
Does anyone have a suggestion on how to start this proof: Given the Fibonacci sequence defined as F_1=F_2=1, F_n+2=F_n+1 + F_n for n>=1. Show that F_n+1*F_n+2 - F_n*F_n+3 = (-1)^n. I'm new at the typing so it is read as F sub n+1 times F sub n+2 minus F sub n times
|
| Need help with Countable Set | 08 Feb 2005 12:09 GMT | 3 |
Q1. Show that : every infinite set has countable subset which is equipotent to N(atural numbers). Could someone give me a hint or sketch of the proof ?
|
| JSH: Reality versus what you say | 08 Feb 2005 08:46 GMT | 16 |
Whether you realize it or not, I get a kick out of neat experiments like putting my prime counting function in an actual encyclopedia article, and it was fun to write that article, and seeing how you dance to try and yet again claim that my work is of no utility.
|