Math
in [Science]
|
What gives you the right.? You have been told, by many here, that you are very disruptive. Many tried to form a group, with the exlusive and explicit purpose of avoiding you. Does this matter to you at all, or do you think it is O.K for you to do your work at everyone else's expense.? Do you believe that your rights end where others' ... 16 Jul 2010 16:35
9/11 was an inside job by BP's cap&trade ideologs, circa '91 here we go, again: prove that Bush knew he was lying about just *one* thing, please (such as, that cap&trade is "cap&tax," which he must've believed, because he didn't sign the God-am Kyoto Protocol). thank *you*, " ." Bush and Cheney told a lot of lies. thus&so: the other one -- which he apparently also... 6 Jul 2010 22:15
ONLY 2 CHRISTMAS GROUPS GOOD, ALL OTHERS WILL FAIL There are only 2 good groups the group of Malou and that of combined Hu Jintao and the most powerful Owan.com, all to the right with proven records and service. The rest are mukhang pera and stupid managers. They better not pursue with their groups. Puro sabit, puro sayad, up and down, left and right. And... 6 Jul 2010 21:09
Linear approximations If z = sin(x) and sin(1) = a then, using the first order approximation, the value of sin(1.1) is equal to: A 0.1(1 - a ^ 2) ^ (1 / 2) B 0.1cos(1) C 0.1(1 - a ^ 2) ^ (1 / 2) + a D a + 0.1 E 0.1a Here's my working out and what I got up to: sin(1 + 1 / 10) approximately = sin(1) + (1 / 10)f'(1) ... 10 Jul 2010 06:14
P = NP if and only if there exists a Turing machine T and a natural number k such that <j>(ri) < nk, P = NP if and only if there exists a Turing machine T and a natural number k such that <j>(ri) < nk, ... 6 Jul 2010 20:03
"Transitive closure"-like relation One possible definition of the transitive closure R+ of a relation R is (R subset R+) and (R+ is transitive) and (for all R': R subset R' and R' is transitive ==> R+ subset R') While specifying some operations for a set-theory software library, I stumbled with the need to define a relation that I will call R... 31 Jul 2010 10:43
wgUrlProtocols="http\\:\\/\\/|https\\:\\/\\/|ftp\\:\\/\\/|irc\\:\\/\\/|gopher\\:\\/\\/|telnet\\:\\/\\/|nntp\\:\\/\\/|worldwind\\:\\/\\/|mailto\\:|news\\:|svn\\:\\/\\/", wgUrlProtocols="http\\:\\/\\/|https\\:\\/\\/|ftp\\:\\/\\/|irc\\:\\/\\/| gopher\\:\\/\\/|telnet\\:\\/\\/|nntp\\:\\/\\/|worldwind\\:\\/\\/|mailto \\:|news\\:|svn\\:\\/\\/", ... 6 Jul 2010 18:56
Collatz-like conjecture using integer square root A quick Google search for some of the numbers below doesn't seem to turn anything up on this, so I thought I'd post it here to see if anyone else has come across it, or finds it interesting. Conjecture; the transformation: x -> floor(sqrt(x)) * ( x - floor(sqrt(x))^2 ) [for x a non-negative integer, and floo... 7 Jul 2010 09:03
Minimum distribution from two seperate distributions Hey all, I have a problem where I have two 1D distributions represented with mean/variance. I need to calculated a third distribution that is the minimum of a random choice from both. For example, if the distributions aren't overlaping you can just take the lower distribution, but as overlap is added there will ... 7 Jul 2010 15:41
NEWSFLASH! Meami.org finds: As it turns out P.NP-complete problems are a set of problems which any other NP-problem can be reduced to in polynomial time, but which retain the ability to have their solution verified NEWSFLASH! Meami.org EXCLUSIVE UPDATE finds: As it turns out P.NP- complete problems are a set of problems which any other NP-problem can be reduced to in polynomial time, but which retain the ability to have their solution verified in polynomial time. http://meami.org/gibraltar.htm ... 6 Jul 2010 17:49 |