I am so upset

[Karsun]

I just went to take an online exam in my forensics class. This class is very hard but I started the exam and was doing quite well until it got stuck loading between pages. I'd only done about 10 out of 44 questions. I sat there for more than 10 minutes waiting and waiting and finally thought perhaps I could reload the page. Big mistake...it locked me out of the exam. So now I'm waiting to hear back from the professor to see if there's any way I can get back in. I sat there just yelling "fvck fvck fvk" over and over after I locked myself out. I am so upset I could just cry.
:crying:

[Agriv8r]

as it is an online test, i am sure the professor has encountered similiar stories before....its not like you exited early to cheat the system...it will be alright....

[KenP]

That sucks.

[wpage]

Hang in there. Your not the only one! Testing this way is problematic and in many cases unproven. It would be interesting to know the reliability factor vs the anxiety results for this method of test.:mad: :violin: :confused:

[bparker]

Sux and sorry to hear, but it sounds like you had a connectivity problem and when you refreshed the page your IP had changed thus causing the lock out as it thought someone else was trying to access your test from a diffrent source...

Welcome to the world of technology.... aint it great?

[Karsun]

I got back in. One of the teacher/students unlocked me and I'm almost done. I'm just waiting on some help with a probability question. Questions like this:
You are a professor making up a 4-answer multiple-choice question pool for a test. You make up 20 questions and distribute the four options for answers equally among the questions. You want four questions from the pool to be inserted randomly into your test. In how many ways will you get all of the questions having the same option as the answer?
I hate math questions! Thank you all for your sympathy...I was so very upset even though I knew it'd probably work out.

[CO Hummer]

You are a professor making up a 4-answer multiple-choice question pool for a test. You make up 20 questions and distribute the four options for answers equally among the questions. You want four questions from the pool to be inserted randomly into your test. In how many ways will you get all of the questions having the same option as the answer?

Factorials and permutations:

The factorial function is formally defined by
http://upload.wikimedia.org/math/f/0/6/f06eb9403ca1f410055f763de0b6bd9f.png The above definition incorporates the instance
http://upload.wikimedia.org/math/d/e/9/de99b4b53fe479345eef7a1bafcc0504.png as an instance of the fact that the product of no numbers at all (http://en.wikipedia.org/wiki/Empty_product) is 1. This fact for factorials is useful, because

the recursive (http://en.wikipedia.org/wiki/Recursion) relation http://upload.wikimedia.org/math/0/4/f/04f0de9cd29fc21e0bb3bf57a31a760b.png works for n = 0;
this definition makes many identities in combinatorics (http://en.wikipedia.org/wiki/Combinatorics) valid for zero sizes.
In particular, the number of combinations or permutations of an empty set is, clearly, 1.[/URL]
Applications


Factorials are used in [URL="http://en.wikipedia.org/wiki/Combinatorics"]combinatorics (http://www.elcovaforums.com/forums/). For example, there are n! different ways of arranging n distinct objects in a sequence. (The arrangements are called permutations (http://en.wikipedia.org/wiki/Permutation).) And the number of ways one can choose k objects from among a given set of n objects (the number of combinations (http://en.wikipedia.org/wiki/Combinations)), is given by the so-called binomial coefficient (http://en.wikipedia.org/wiki/Binomial_coefficient)http://upload.wikimedia.org/math/6/f/4/6f481c5daf8fcb299d23c41262604296.png
In permutations (http://en.wikipedia.org/wiki/Permutation), if r objects can be chosen and arranged in r different ways from a total of n objects, where r ≤ n, then the total number of distinct permutations is given by:http://upload.wikimedia.org/math/7/c/5/7c587a75dfd578eb0c3ebec65623b853.png

[Karsun]

Factorials and permutations:

The factorial function is formally defined by
http://upload.wikimedia.org/math/f/0/6/f06eb9403ca1f410055f763de0b6bd9f.png The above definition incorporates the instance
http://upload.wikimedia.org/math/d/e/9/de99b4b53fe479345eef7a1bafcc0504.png as an instance of the fact that the product of no numbers at all (http://en.wikipedia.org/wiki/Empty_product) is 1. This fact for factorials is useful, because

the recursive (http://en.wikipedia.org/wiki/Recursion) relation http://upload.wikimedia.org/math/0/4/f/04f0de9cd29fc21e0bb3bf57a31a760b.png works for n = 0;
this definition makes many identities in combinatorics (http://en.wikipedia.org/wiki/Combinatorics) valid for zero sizes.
In particular, the number of combinations or permutations of an empty set is, clearly, 1.

Applications

Factorials are used in combinatorics (http://en.wikipedia.org/wiki/Combinatorics). For example, there are n! different ways of arranging n distinct objects in a sequence. (The arrangements are called permutations (http://en.wikipedia.org/wiki/Permutation).) And the number of ways one can choose k objects from among a given set of n objects (the number of combinations (http://en.wikipedia.org/wiki/Combinations)), is given by the so-called binomial coefficient (http://en.wikipedia.org/wiki/Binomial_coefficient)http://upload.wikimedia.org/math/6/f/4/6f481c5daf8fcb299d23c41262604296.png

In permutations (http://en.wikipedia.org/wiki/Permutation), if r objects can be chosen and arranged in r different ways from a total of n objects, where r ≤ n, then the total number of distinct permutations is given by:http://upload.wikimedia.org/math/7/c/5/7c587a75dfd578eb0c3ebec65623b853.png

WTF is that stuff! LOL Math is not my forte, I mean I'm like the Forrest Gump of math. Seriously!

[CO Hummer]

WTF is that stuff! LOL Math is not my forte, I mean I'm like the Forrest Gump of math. Seriously!

Run Forest, Run!

[DRTYFN]

http://www.elcovaforums.com/forums/attachment.php?attachmentid=46663&stc=1&d=1203460543

Fixed:jump:

[Karsun]

Fixed:jump:

ROFL!!

[DRTYFN]

ROFL!!
Glad you like it. That's going to be your avatar.:clapping:

[RubHer Yellow Ducky]

Factorials and permutations:

The factorial function is formally defined by
http://upload.wikimedia.org/math/f/0/6/f06eb9403ca1f410055f763de0b6bd9f.png The above definition incorporates the instance
http://upload.wikimedia.org/math/d/e/9/de99b4b53fe479345eef7a1bafcc0504.png as an instance of the fact that the product of no numbers at all (http://en.wikipedia.org/wiki/Empty_product) is 1. This fact for factorials is useful, because

the recursive (http://en.wikipedia.org/wiki/Recursion) relation http://upload.wikimedia.org/math/0/4/f/04f0de9cd29fc21e0bb3bf57a31a760b.png works for n = 0;
this definition makes many identities in combinatorics (http://en.wikipedia.org/wiki/Combinatorics) valid for zero sizes.
In particular, the number of combinations or permutations of an empty set is, clearly, 1.

Applications

Factorials are used in combinatorics (http://en.wikipedia.org/wiki/Combinatorics). For example, there are n! different ways of arranging n distinct objects in a sequence. (The arrangements are called permutations (http://en.wikipedia.org/wiki/Permutation).) And the number of ways one can choose k objects from among a given set of n objects (the number of combinations (http://en.wikipedia.org/wiki/Combinations)), is given by the so-called binomial coefficient (http://en.wikipedia.org/wiki/Binomial_coefficient)http://upload.wikimedia.org/math/6/f/4/6f481c5daf8fcb299d23c41262604296.png

In permutations (http://en.wikipedia.org/wiki/Permutation), if r objects can be chosen and arranged in r different ways from a total of n objects, where r ≤ n, then the total number of distinct permutations is given by:http://upload.wikimedia.org/math/7/c/5/7c587a75dfd578eb0c3ebec65623b853.png

You are full of it...

n = +- the sum of (n2-n / n2 - N sq) - r2/Pr (K) minus the root of k3+k (0) assuming t 8th is = negative............

[Agriv8r]

I got back in. One of the teacher/students unlocked me and I'm almost done. I'm just waiting on some help with a probability question. Questions like this:
You are a professor making up a 4-answer multiple-choice question pool for a test. You make up 20 questions and distribute the four options for answers equally among the questions. You want four questions from the pool to be inserted randomly into your test. In how many ways will you get all of the questions having the same option as the answer?
I hate math questions! Thank you all for your sympathy...I was so very upset even though I knew it'd probably work out.

3...

[KenP]

Factorials and permutations:

Products and ordering, how blase'.