|
ah... good old Excel.
thanks 
|
|
|
|
|
You can also probably try a log base 10 transform.
|
|
|
|
|
If you simplify the combinations, you end up with:
((10 * 9 * 8) / (3 * 2)) * (The second forumula from my original post).
I'm not sure where that coefficient (which evaluates to 120) comes from -- possibly 120 different placements for the black marble selections?
If you decide to become a software engineer, you are signing up to have a 1/2" piece of silicon tell you exactly how stupid you really are for 8 hours a day, 5 days a week
Zac
|
|
|
|
|
Chris Losinger wrote: it's been a long time since i had to do this stuff, and i can't figure out how to solve what seems like it should be a simple calculation...
you have 6000 marbles in a box. 300 of them are black, the rest are white. you draw ten marbles without replacement.
what are the odds that three of the marbles you draw are black ?
Hi Chris, I think you want the hypergeometric probability distribution for this problem. This will give you the probability that in a sample of n objects drawn from a population, k will be black (no replacement).
Let:
N = 6000 be the total number of marbles <br />
n = 10 be the number of marbles drawn (your sample)<br />
B = 300 be the number of black marbles <br />
k = 3 be the number you are interested in
Then the probability of having k black marbles in a sample n of the total population N where f() is the probability, is:
f(k;N,B,n) = (B choose k) * ( (N-B) choose (n-k) ) / ( N choose n)
That is, there are N choose n total samples without replacement and B choose k ways to choose k black marbles and N-B choose n-k remaining ways to select.
Hope that helps.
|
|
|
|
|
It's been a while, what's choose again? Is that like: a choose b = a!/b!
Logifusion[^]
If not entertaining, write your Congressman.
|
|
|
|
|
Dustin Metzgar wrote: It's been a while, what's choose again? Is that like: a choose b = a!/b!
Almost, it's a choose b = a!/[b!(a-b)!].
--
Marcus Kwok
|
|
|
|
|
My dumb-dumb Stats 100 textbook says that you can approximate the answer by using the binomial probability distribution.
Conditions:
1. The procedure has a fixed number of trials (10)
2. The trials must be independent.*
3. Each trial must have all outcomes classified into two categories (black and white).
4. The probabilities must remain constant for each trial.
n = # of trials = 10
x = # of successes among n trials = 3
p = prob. of success in any one trial = 300/6000 = 0.05
q = prob. of failure in any one trial = (1 - p) = 0.95
Then
P(3) = (10!) / ((10 - 3)! * 3!) * (0.05)^3 * (0.95)^(10-3)
Which, when I calculated it out, equals 0.0104750594. My TI's binompdf function agrees.
Stats/Math nerds, if this is wrong, please let us know.
* The justification for using this as an approximation even though we're selecting without replacement is this:
"When sampling without replacement, the events can be treated as if they were independent if the sample size is no more than 5% of the population size. (That is, n <= 0.05N.)" 10 <= 300, so we're good.
|
|
|
|
|
Nice solution Jon. I didn't even think of that and sent the poor guy towards the hypergeometric distribution. Then I forgot he had to evaluate these huge factorials... 
|
|
|
|
|
|
Last day I learned something about Fourier series.
how we can use it in actual application? what's the purpose of the same in computer programming area? I heard that it is used in graphics filters and all. Could you please add some more points on it?
|
|
|
|
|
I haven't worked with Fourier Series or Transforms but according to this wiki article[^], it looks like it has many potential applications in computer programming.
Also, take a look around at mathworld[^] if you haven't already 
too much daily WTF for someone... - Anton AfanasyevLast modified: Sunday, August 20, 2006 1:04:07 PM --
|
|
|
|
|
Fourier Series/Transforms have some interesting properties. One of the reasons that the FFT is so popular is because of those properties. You can grade a photo based on "sharpness" by looking at the output of the FFT, because of that you can actually provide focus "grading" as well as "grading" of atmospheric distortion. FFT and its output allows a great deal of information in evaluating noise vs. clarity, fuzziness vs. sharpness, etc.
read the article suggested above and do some google searches.
_________________________
Asu no koto o ieba, tenjo de nezumi ga warau.
Talk about things of tomorrow and the mice in the ceiling laugh. (Japanese Proverb)
|
|
|
|
|
fourier series just like laplace transforms forms an important foundation in digital signal processing(DSP). Devices such as mobile phones, digital cameras, signal analysers, heart monitoring devices all use DSP and some aspect of fourier series is utilised. Look at the JPEG image compression thats based on discrete cosine transform (a type of fourier series), i think from memory.
Fourier series is a fascinating aspect of maths. I totally enjoyed it when I was going engineering mathematics a long time ago at uni.
|
|
|
|
|
Do you know how we can program this using C++ or C?
|
|
|
|
|
yes, the internet has plenty examples...
even on CP : FFT[^] for example...
|
|
|
|
|
danx toxy
|
|
|
|
|
I saw the example. the GUI can be more user friendly
|
|
|
|
|
still criticising...
the GUI is just a matter or representation, not a matter of calculation 
|
|
|
|
|
|
and what about this[^] ???
|
|
|
|
|
toxcct wrote:
and what about this[^] ???
sigview sure looks nice
too much daily WTF for someone... - Anton Afanasyev
|
|
|
|
|
Reliable Software[^] has a couple of neat articles and examples in their freeware and science sections.
"I know which side I want to win regardless of how many wrongs they have to commit to achieve it." - Stan Shannon
Web - Blog - RSS - Math - LinkedIn
|
|
|
|
|
In addition to DSP and other engineering fields, Fourier analysis has equally important applications in many science fields. Here I list some from my experience:
1) Atmospheric science: weather prediction, global wraming
2) Geophysics: ancient climatology, glacial analysis
3) Ocean science: wave analysis, surge prediction
4) Radio physics: spectral analysis
5) Computer science: data compression, pattern recognition
Best,
Jun
|
|
|
|
|
Dear Jun
Thanks for your reply. even if we know the areas where there Fourier series used, it's hard to understand in what sense it helping to solve the problems. for eg.
Jun Du wrote: Computer science: data compression, pattern recognition
how it solves the problems in the quoted domain?
|
|
|
|
|
Firstly, you need to understand the concepts of fourier series. Secondly, you need to then to have a thorough understanding of the domain you are interested in. Only then you will understand how concepts of fourier series can be used to solve problems.
If you are truly interested in fourier etc, then my recommendation will be to download a DSP pdf book from Analog Devices titled "The Scientist & Engineer's Guide to Digital Signal Processing". This is a great book and any DSP engineer will recommend it. Just ask Eric Jaccobson. Here is the URL:
http://www.analog.com/processors/learning/training/dsp_book_index.html
My other recommendation will be to learn matlab to gain an understanding in programming aspects of fourier series. This was the best way I had learnt fourier, laplace transforms etc.
My final recommendation will be to get yourself a engineering mathematics book i.e. Advanced Engineering Mathematics by Peter O'Neil here is a link: http://www.amazon.com/gp/product/0534400779/102-2429887-6445756?v=glance&n=283155 I have used this book and its an excellent reference in learning fourier laplace etc.
I dont want to sound harsh but to learn fourier requires dedication and it wont happen via osmosis nor will it happen overnight.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
