| Thread | Last Post | Replies |
|
| simplification involving sec and ln | 28 Feb 2007 23:33 GMT | 1 |
I need to simplify [ln (sec x)] where x=pi/4
|
| conditional probability | 28 Feb 2007 15:24 GMT | 11 |
I hope this is the right place for my post. My question is about conditional probability. In all the sources I consulted, P(A|B) is undefined if P(B)=0. Then, I don't know how to face problems as the following: 1) A value for a standard normal variable X is generated, until one of ...
|
| primes, fermats little theorem, help needed please... | 28 Feb 2007 12:32 GMT | 3 |
I'm having a little bother clearly understanding a proof. Would be grateful for feedback on my approach and on any tips/suggestions etc from you knowledgables. So I'm proving (supposedly) that "a^p ? a (mod p) where p is a prime and a
|
| graphing (Sine & Cosine) | 28 Feb 2007 04:57 GMT | 2 |
I've been programming for a while using sine & cosine and just started taking trigonometry and I am trying to make a relation between the two. Using a graphing calculator, How do you graph a circle using sine & cosine. I am already familuar with x^2 + y^2 = r^2.
|
| Not math, physics problem... | 27 Feb 2007 01:15 GMT | 19 |
Heya, I'm self-studying physics (and math as well), and I just started into upper-undergrad level classical mechanics. I'm using the second edition of Marion's Classical Dynamics of Particles and Systems, and my god, this is so much harder than it was before. I'm on the easy ...
|
| computing closed form | 26 Feb 2007 22:28 GMT | 10 |
I have the following recursion and I'd like to compute its closed form: Base: T(1,j) = j, 1<=j<=n; T(i,1) = 1, 1 <=i<=m Recursion: T(i,j) = T(i, j-1) + T(j-1, i) + 1, 2 <=j <=n, 2 <= i <= m
|
| standard exponential! | 26 Feb 2007 22:06 GMT | 1 |
Z1,Z2 are IID nad Z~N(0,1), W=(Z1^2 + Z2^2) / 2 is standard exponentioal? P(W<w)=P(((Z1^2 + Z2^2) / 2) <w) = P((Z1^2 + Z2^2) <2w) = P(Z1^2<2w)+P(Z2^2<2w)?? if not then how can we approach this..
|
| Inequality | 23 Feb 2007 11:54 GMT | 4 |
Could anyone help? How to show (m^2+n^2)/(m+n)^2 > (m(m-1) + n(n-1))/((m+n)(m+n-1)) for m,n positive integers. Thanks for any help. Tad
|
| Polynomials over an integral domain? | 23 Feb 2007 00:35 GMT | 4 |
I need to show that polynomials of degree n over an integral domain have at most n zeros. I know this holds true for fields, but without a field we lose the division algorithm and its corollaries, so how should i go about proving it?
|
| Differential problem | 22 Feb 2007 15:55 GMT | 8 |
The problem says "Show by means of differentials that 1/(x+dx) = 1/x - dx/x^2 How do I go about it? Thanks.
|
| + DOING ASSIGNMENTS INSTEAD OF YOU + | 22 Feb 2007 06:51 GMT | 3 |
Dear Students, I am a scientist, providing help for undergrad, postgrad, distance education and adult students in doing assignments, theses, projects, dissertations, essays, etc.
|
| Terms of a Sequence | 21 Feb 2007 16:57 GMT | 2 |
Ok, perhaps I should have extended the decimal numbers, including 1.4142135 & 2.828427) toward [infinity].... then what I stated would have been more correct. If everyone is going to quibble over such small matters then you are going to miss the real gist of all the Col's ...
|
| calculus | 20 Feb 2007 23:32 GMT | 4 |
Can someone find for me the value of dk/dx=0, for k=x^2/-b+ax/b.
|
| Puzzle of Brevity | 20 Feb 2007 16:43 GMT | 2 |
Suppose we have two cartesian graph points in 3-dimension, stated as: ****** z= 0 x= 2
|
| Comparing cardinality of sets | 20 Feb 2007 08:06 GMT | 9 |
Knowing that A is an uncountable set and P(A) is the power set of A, we want to prove that
|A| < | P(A) | which means there exists a mapping from P(A) to A but there is no mapping from P(A) to A
|