View of /trunk/NationalProblemLibrary/ASU-topics/setCount/sw10_1_7.pg

    1 ## DESCRIPTION
    2 ## Calculus
    3 ## ENDDESCRIPTION
    4 
    5 ## KEYWORDS('Discrete', 'permutation')
    6 ## Tagged by YL
    7 
    8 ## DBsubject('Calculus')
    9 ## DBchapter('Discrete Mathematics')
   10 ## DBsection('Combinatorics')
   11 ## Date('')
   12 ## Author('')
   13 ## Institution('ASU')
   14 ## TitleText1('Calculus')
   15 ## EditionText1('5e')
   16 ## AuthorText1('Stewart')
   17 ## Section1('')
   18 ## Problem1('')
   19 
   20 DOCUMENT();        # This should be the first executable line in the problem.
   21 
   22 loadMacros(
   23 "PG.pl",
   24 "PGbasicmacros.pl",
   25 "PGchoicemacros.pl",
   26 "PGanswermacros.pl",
   27 "PGauxiliaryFunctions.pl"
   28 );
   29 
   30 TEXT(beginproblem());
   31 $showPartialCorrectAnswers = 1;
   32 
   33 $a=random(4,8,1);
   34 
   35 
   36 BEGIN_TEXT
   37 How many different ways can a race with $a runners be completed?
   38 (Assume there is no tie.)
   39 $BR
   40 Your answer is : \{ans_rule(25) \}
   41 $BR
   42 END_TEXT
   43 
   44 $ans = fact($a);
   45 ANS(std_num_cmp($ans));
   46 
   47 ENDDOCUMENT();        # This should be the last executable line in the problem.