You are not logged in.
Hi ilovealgebra;
You are given
First get the derivative:
Now get the slope m by plugging in -3 in the right hand side
Now get
Now you have
Just plug into the slope tangent formula
simpllfy
Hi nurshodiq;
I think that
Since it factors into:
Your welcome.
Hi mathsyperson;
Thanks for checking my work, probability is so error prone and so counter intuitive.
Hi dannyv;
Haven't read that one yet. The first thing I ever saw a random walk used on was getting any element of an inverted matrix without inverting the matrix, thought that was so great.
Hi dreamalot;
I'm afraid Jane is right about learning correct proofs but if you are determined to see this, here is a link that I know of.
http://en.wikipedia.org/wiki/False_proof
Hi eclipse;
Looks like a binary tree so you multiply and add:
So there is almost a 19% chance that event won't happen.
or somewhat easier:
Hi eclipse;
You would be able to add them if they are independent of each other. If that is what you mean by separate ( they are independent ) then just add. There is a formula for when they aren't independent but you haven't provided enough info for me to use it. You were probably given a Venn diagram, provide me with that info.
logician
Tulsa
predator
Sometimes I think, wouldn't be great if they would just transport Hollywood to some other country.
Hi dannyv;
Random walks are really a powerful and beautiful piece of math. Along with generating functions and graph theory they are the cornerstone of the new discrete approach to mathematics. I have always been partial to problems 6,7,12,14 on that page.
girdle
Texas
hunt
Hi dannyv and MathsisFun;
Like those fields, but I am just an untalented amateur in them. I took up computing so that I wouldn't have to do anymore math, but discovered I needed more math than ever before.
That is generally true with coding. A piece of code starts out pretty, small and readable, but as I add bells and whistles. it turns into a monstrosity. I also like to get the job done. I find the drive to achieve good structure, boring. Just let it rip, is the fun way to program.
Hi dannyv;
From my notes I can answer question 2:
If n is of the form 4m then the eigenvalues are:
m+1 eigenvalues that equal 1
m eigenvalues that equal -1
m eigenvalues that equal -i
m-1 eigenvalues that equal i
If n is of the form 4m+1 then the eigenvalues are:
m+1 eigenvalues that equal 1
m eigenvalues that equal -1
m eigenvalues that equal -i
m eigenvalues that equal i
If n is of the form 4m+2 then the eigenvalues are:
m+1 eigenvalues that equal 1
m+1 eigenvalues that equal -1
m eigenvalues that equal -i
m eigenvalues that equal i
If n is of the form 4m+3 then the eigenvalues are:
m+1 eigenvalues that equal 1
m+1 eigenvalues that equal -1
m+1 eigenvalues that equal -i
m eigenvalues that equal i
Unfortunately my notes are sketchy on deriving the characteristic eqtn (your question #1). So do yourself a favor and keep good notes, don't be like me. Try google for DFT and eigenvalues that may turn up an alternate reference.
waistband
clarinet
salmonella
Hi dannyv;
As far as I can remember the eigenvalues for those matrices are taken from the set of the roots of unity, solutions of z^n-1=0 where n is the size of the matrix. I think there is an easy way to determine how many of each by n modulo 4. I might be mistaken, its been a long time since I have worked with a DFT or FFT. Google will probably provide what you need.
Hi smiyc86;
Hard to believe but I am familiar with manjyome's stuff. Anyway why should we consider his/her answer. After all it is only a probable answer( 3 out of 5). Berry's idea, underneath manjyome's post is right on the money. I don't have any way at present to firm up manjyome's work. If you do I would like to see it.
rubbery
pianoforte
popeye
Sorry Jane, was bleary eyed. Will try harder.
1 deformation
2 organ
3 cabbage
Your welcome
holes
sting
broccoli
Agreed
function
insect
nutritious
Hi quittyqat;
Now I see it! Is the Thanks for me?
summation
cricket
apple