You are not logged in.
Sorry it has been a while since I have done any proper maths. Could you provide the solution please?
Hi, I would like your help in proving the following:
Your help is much appreciated.
Hi all,
I need help answering a question that I am having trouble with. I think it has to do with differentiation, but not too sure.
Question
A farmer wants to put up a fence around a rectangular pen with an area of 128m^2.
One side of the rectangle is a wall, what is the least length of fence needed to cover the perimeter left?
I hope I covered everything in the question.
Thanks in advance!
Thanks in advance!
I'm having trouble with this question, can you help?
Thanks in advance!
Here is the question regarding the Kauffman bracket:
Explain why rule 3 for the Kauffman bracket applies whenever a disjoint unknot
(i.e. an unknot with no crossings with other parts of the diagram) appears in the
diagram, not only if it is outside the rest of the diagram.
Thanks in advance!
Ok i see mathsmypassion. Now does that mean the number of edges are 12?
Well, the stumbling block for me is the vertex part. I'm not quite sure how the vertex points are meant to be read. It says that the set consists of all triples with each x_i equal to 0 or 1, but i thought that a vertex can only be defined by one x_i rather than a triple. Am i wrong?
Consider the graph G defined as follows. The vertex set V(G) consists of all triples
with each equal to 0 or 1. The edge set E(G) consists of all pairs of triples such that there is exactly one number i with ≠.How many vertices does G have? How many edges does G have?
Thanks in advance!
Sorry for the maths looking like superscript compared to the rest of the text. Anyone like to tell me how to deal with that will also be great.
I think JaneFairfax is going about this the right way because Ricky I don't think I can give you an answer to that question you are asking except that there are n elements in X that can be mapped to m elements in Y.
Anyone any ideas?
I understand what you are saying about mapping, but I'm afraid that's all there is to that question.
That's the thing I'm not too sure. I thought it had something to do with the values n and m. I assume n suggests that there are n values in the set X and m values in set Y, then from there we find out how many functions could be mapped. Does that help or was that load of b*ll**ks!
I'm not quite sure how to answer this question:
Let X and Y be sets with
and .Determine the number of functions f mapping X into Y.
of course...we have an equation of a circle in there as well!
does anyone else get 0?
I need to make y as the subject of the following question:
Any suggestions?
Thanks in advance!
Hi there I saw this question and got stuck, could someone tell me how can I solve this:
Find the differential of:
Thanks in advance!
Consider the birth of twins. Let Φ denote the probability that they are identical, in
which case they must be of the same gender. If they are fraternal, that is, not identical
twins, each child is equally likely to be male or female independently of the other child.
(a) Justify the result that
P(twins are of the same gender) =
(b) Let Y be the number of pairs of twins of the same gender out of m pairs of twins.
Then Y has a binomial distribution with parameters m and (1+Φ)/2. Write down the
likelihood for the single observation y of Y .
Thanks in advance!
No idea! What kind of question is this?!
Question that is posing a problem is:
Determine which of the following are linear transformations from P_2 to P_2:
(a) (L(p))(t)=t+p(t)
(b) (L(p))(t)=tp'(t)+p''(t)
Thanks in advance!
Here's the question:
Consider the following vectors in R³:
Can you not just expand the bracket so you are left with
and then use the rule for integrating e?
Hi this is the question that's troubling me:
Show the following
(a) If
is a spanning set for a vector space V and v is any vector in V, then are linearly dependent.(b) If
are linearly independent vectors in a vector space V, then cannot span V.Thanks in advance!
Don't worry people I have it solved.
If you're wondering how, it's to do with the Expectation of Total Probability and not the Gambler's Ruin Problem I originally stated.