You are not logged in.
can anyone give an example of a linear map such that Im(f)=Ker(f)
im(f)=image of f
ker(f)=kernal of f
i've factorised it to get:
hey can anyone factorise the following equation:
Im trying to solve this system of simultaneous equations
as solutions i got:
i have the following function:
i have the following question:
An experiment on 25 cars is carried out. 15 of these cars are classed as flawed. 10 are classed as flawless.
assuming this has a poisson distribution
my solution so far:
ive taken the average no of flaws to be 15/25=0.6
So
As the question asked for the probability that a car has a flaw in terms of
air at pressure p=p0 is above a layer of oil of depth A and density D1.
the oil lies on water of density D2>D1.
find the pressure at a distance B>0 below the oil water boundary.
Ive looked at examples of pressure below water without an oil layer and i can see clearly how the fundamental equation of hydrostatics can be used:
but im not quite sure how to apply this to this type of question.
Here the pressure is a continuous function of position and the density varies.
can anyone please help me understand this example
i can see that but i dont understand where i get ad-bc=0 from
suppose
does anyone know how i do this.
i know to show something is linearly independent i would do as follows:
so i've looked up the fundamental theorem of arithmetic and ive tried to apply this to n
i got
is n not already expressed as its product of distinct primes then?
i have the following question
write
yes kn is the complete graph of order n
so kn is of odd order.
but i still dont understand how to show ri is not equal to bi
suppose that n=3 mod4 and we colour the edges of kn red or blue
take ri to be the no. of red edges and bi=n-1-ri to be the no. of blue egdes
show that it is not possible to have ri=bi for all i
1<=i<=n
does anyone know how i would go about answering this question.
Im unsure what the value of n would be as i dont really know what n=3 mod 4 equals. please help
hey
i've found a question in the book "a course in combinatorics" which i need help solving
problem:
"The girth of a graph is the length of the smallest polgon in the graph. Let G be a graph with girth 5 for which all vertices have degree>=d. show that G has atleast d^2+1 vetices."
can anyone please help me to understand this question
ok so i've done this and i've got
im not sure how to integrate
can i rearrange this to be
Thank you that was actually very simple!
another integration problem which has left me unsure is the following
hi i'm not sure wether im integrating the following function properly
can anyone show that
I have a revision question which asks me to prove two graphs are isomorphic.
from the definition i know that 2 graphs G and H are isomorphic if there exists a bijection
Does anyone know what steps i would take to prove they are isomorphic?
please help