A bag has three marbles: one red, one blue, and one yellow. The marbles are pulled from the bag one at a time without replacing them. In how many different orders could the marbles be pulled from the bag?
Since we pull the marbles out without replacing them, there are 3 choices for the first marble, 2 choices for the second marble, and 1 choice for the third marble. This means there are $3\cdot 2 \cdot 1=\boxed{6}$ different orders in which the marbles could be pulled from the bag.
To determine the number of different orders the marbles can be pulled from the bag, we can use the concept of factorial.
Factorial is denoted by the exclamation mark (!) and represents the product of an integer and all the positive integers below it.
In this case, we have three marbles: one red, one blue, and one yellow. We need to find the number of different orders in which these three marbles can be pulled.
The number of different orders is equal to the factorial of the number of marbles.
Therefore, the number of different orders is 3!.
Calculating 3!:
3! = 3 × 2 × 1 = 6
Hence, there are 6 different orders in which the marbles can be pulled from the bag.