## DESCRIPTION
## Calculus
## ENDDESCRIPTION

## KEYWORDS('Discrete', 'permutation')
## Tagged by YL

## DBsubject('Calculus')
## DBchapter('Discrete Mathematics')
## DBsection('Combinatorics')
## Date('')
## Author('')
## Institution('ASU')
## TitleText1('Calculus')
## EditionText1('5e')
## AuthorText1('Stewart')
## Section1('')
## Problem1('')

DOCUMENT();        # This should be the first executable line in the problem.

loadMacros(
"PG.pl",
"PGbasicmacros.pl",
"PGchoicemacros.pl",
"PGanswermacros.pl",
"PGauxiliaryFunctions.pl"
);

TEXT(beginproblem());
$showPartialCorrectAnswers = 1;

$a=random(4,8,1);


BEGIN_TEXT
How many different ways can a race with $a runners be completed? 
(Assume there is no tie.)
$BR
Your answer is : \{ans_rule(25) \}
$BR
END_TEXT

$ans = fact($a);
ANS(std_num_cmp($ans));

ENDDOCUMENT();        # This should be the last executable line in the problem.