Difference between revisions of "RecursiveSequence1"
Paultpearson (talk | contribs) m |
(add historical tag and give links to newer problems.) |
||
(2 intermediate revisions by one other user not shown) | |||
Line 1: | Line 1: | ||
+ | {{historical}} |
||
+ | |||
+ | <p style="font-size: 120%;font-weight:bold">This problem has been replaced with [https://openwebwork.github.io/pg-docs/sample-problems/Sequences/RecursiveSequence.html a newer version of this problem]</p> |
||
+ | |||
<h2>Sequences and Recursively Defined Functions</h2> |
<h2>Sequences and Recursively Defined Functions</h2> |
||
Line 5: | Line 9: | ||
This PG code shows how to add a named function to the context and use it to ask students to come up with a recursive formula. |
This PG code shows how to add a named function to the context and use it to ask students to come up with a recursive formula. |
||
</p> |
</p> |
||
− | * Download file: [[File:RecursiveSequence1.txt]] (change the file extension from txt to pg when you save it) |
||
+ | * File location in OPL: [https://github.com/openwebwork/webwork-open-problem-library/blob/master/OpenProblemLibrary/FortLewis/Authoring/Templates/Sequences/RecursiveSequence1.pg FortLewis/Authoring/Templates/Sequences/RecursiveSequence1.pg] |
||
− | * File location in NPL: <code>FortLewis/Authoring/Templates/Sequences/RecursiveSequence1.pg</code> |
||
+ | * PGML location in OPL: [https://github.com/openwebwork/webwork-open-problem-library/blob/master/OpenProblemLibrary/FortLewis/Authoring/Templates/Sequences/RecursiveSequence1_PGML.pg FortLewis/Authoring/Templates/Sequences/RecursiveSequence1_PGML.pg] |
||
− | |||
<br clear="all" /> |
<br clear="all" /> |
||
Line 130: | Line 133: | ||
Context()->texStrings; |
Context()->texStrings; |
||
BEGIN_SOLUTION |
BEGIN_SOLUTION |
||
− | ${PAR}SOLUTION:${PAR} |
||
Solution explanation goes here. |
Solution explanation goes here. |
||
END_SOLUTION |
END_SOLUTION |
Latest revision as of 07:44, 18 July 2023
This problem has been replaced with a newer version of this problem
Sequences and Recursively Defined Functions
This PG code shows how to add a named function to the context and use it to ask students to come up with a recursive formula.
- File location in OPL: FortLewis/Authoring/Templates/Sequences/RecursiveSequence1.pg
- PGML location in OPL: FortLewis/Authoring/Templates/Sequences/RecursiveSequence1_PGML.pg
PG problem file | Explanation |
---|---|
Problem tagging: |
|
DOCUMENT(); loadMacros( "PGstandard.pl", "MathObjects.pl", "parserFunction.pl", ); TEXT(beginproblem()); |
Initialization:
We will be defining a new named function and adding it to the context, and the easiest way to do this is using |
Context("Numeric")->variables->are(n=>"Real"); parserFunction(f => "sin(pi^n)+e"); $fn = Formula("3 f(n-1) + 2"); |
Setup:
We define a new named function |
Context()->texStrings; BEGIN_TEXT The current value \( f(n) \) is three times the previous value, plus two. Find a recursive definition for \( f(n) \). Enter \( f_{n-1} \) as \( f(n-1) \). $BR \( f(n) \) = \{ ans_rule(20) \} END_TEXT Context()->normalStrings; |
Main Text: We should tell students to use function notation rather than subscript notation so that they aren't confused about syntax. |
$showPartialCorrectAnswers=1; ANS( $fn->cmp() ); |
Answer Evaluation: |
Context()->texStrings; BEGIN_SOLUTION Solution explanation goes here. END_SOLUTION Context()->normalStrings; COMMENT('MathObject version.'); ENDDOCUMENT(); |
Solution: |