iMathAS e-Proof Creator -

Homepage: http://e-proof.weebly.com - Library: e-Proof-Creator uses ASCIIMathML.js 2.0.2 - LGPL by Peter Jipsen Tutorial: ASCIIMath Tutorial
Licence: GNU Public Licence V3 - Download: e-Proof-Creator - Math-Editor: ASCII-Math-Editor for Proof-Steps

Generated Code: Filename:
Save Current Work as XML - Edit e-Proof Copy the code above and save the generated Code into the filename with an editor. Use e.g. Notepad (Win), Textwrangler (Mac), kate (Linux)
Title of e-Proof:
Author of e-Proof:
e-Mail:
Date:
Comment after the Theorem:
AuthoringMode:
Language (EN or DE):
Show Main-Control in e-Proof:
Show Load-Save-Control in e-Proof:
Show Assessment:
Show Solution of Proof:
Selectbox for Proof Steps:
Allow Own Proof Steps:
Percent Point Reduction per Error:
Unnecessary Preconditions:
Unnecessary Proof Steps:
Unnecessary Connections:
Randomize Proof-Step:	For option=1 it is necessary to include the Background Code 3. Check if setting of Question `New version on reattempt?` is set to `'No - Same Version on reattempt'`
Remap Proof-Step:	It is necessary to have Background Code for Randomizer and Remapper installed
Question-ID Randomizer/Remapper:	Randomize and Remapping Code Steps
Question-ID Background Code 1:
QID for e-Proof (unique):
Preconditions: `ID # Precondition Definition` P1#Sei `U subseteq CC` eine Teilmenge P2#Sei `gamma: [a,b] -> CC` ein stückweise glatter Weg in `U` P3#Sei `f:U - > CC` eine komplexwertige stetige Funktion Precondition: ID: Definition:
Conclusions: `ID # Conclusion Definition` C1#`int_{gamma} f(z) d z` C2# `int_{a}^{b} f(gamma(t)) * gamma'(t) dt` Conclusion: ID: Definition:
Justification: `ID # Justification Definition` DU# `AA_(a,b in CC) : \|a + b\| <= \|a\| + \|b\| ` DG# `AA_(a,b,c in M) : a * (b + c) = a * b + a * c` AG# `AA_(a,b,c in M) : (a + b) + c = a + (b + c)` KG# `AA_(a,b in M) : a * b = b * c ` PG# `AA_{a,b in RR, b!=0} AA_{n in NN} : (a/b)^n = a^n/b^n` WE#Definition (Weg): Sei `U subseteq CC` eine Teilmenge und `a,b in RR` mit `a < b`. Ein Weg `gamma` in `U` ist eine stetige Abbildung `gamma : [a,b] -> CC` mit `gamma(U) subseteq U`. SPU#Definition (Spur): Sei `gamma: [a,b] -> CC` eine Weg. Die Spur von `gamma` ist definiert als: `"Spur"(gamma):= { gamma(t) in CC \| t in [a,b] }`. WZ#Definition (wegzusammenhängend): Sei `U subseteq CC` eine Teilmenge. `U` heißt wegzusammenhängend, wenn es zu beliebigen Punkt `z_1, z_2 in U` einen Weg `gamma:[a,b] -> CC` gibt, mit `gamma(a)=z_1`,`gamma(b)=z_2` und `"Spur"(gamma) subseteq U`. GE#Definition (Gebiet): Eine Teilmenge `G subseteq CC` heißt Gebiet, wenn (1) `G` offen, (2) `G != emptyset` und (3) `G` wegzusammenhängend ist. WG1#Definition (Weg glatt): Ein Weg `gamma: [a,b] -> CC` heißt glatt, wenn dieser stetig differenzierbar ist. UT#Definition (Unterteilung): Sei `[a,b]` ein Intervall, `n in NN` und `a=u_0< ...< u_n = b`. `(u_0, ..., u_{n}) in RR^{n+1}` heißt dann Unterteilung von `[a,b]`. WG2#Definition (Wegunterteilung): Sei `gamma: [a,b] -> CC` ein Weg in `U subseteq CC`, `n in NN`, `(u_0, ..., u_{n})` eine Unterteilung von `[a,b]`, `gamma_k : [u_{k-1} , u_k] -> CC` für alle `k in {1, ... ,n}` ein Weg in `U`. `(gamma_{1}, ..., gamma_{n})` heißt Wegunterteilung von `gamma`, wenn gilt `gamma_n(b) = gamma(b)` und `AA_{k in {1,...,n} } AA_{t in [u_{k-1} , u_k )} : gamma_k(t) = gamma(t)`. WG3#Definition (Weg stückweise glatt): Ein Weg `gamma: [a,b] -> CC` heißt stückweise glatt, wenn eine Wegunterteilung `(gamma_1 ,... gamma_n)` aus glatten Wegen `gamma_k` für alle `k in {1, ... , n}` existiert. WG4#Definition (Wegintegral): Sei `f: U -> CC` eine stetige Funktion und `gamma: [a,b]` ein glatter Weg, dann ist das Wegintegral wie folgt definiert: `int_{gamma} f := int_{gamma} f(xi) d xi := int_{a}^{b} f(gamma(t)) * gamma'(t) dt`. Ist `gamma` stückweise glatt bzgl. einer Wegunterteilung `(gamma_{1}, ..., gamma_{n})`, dann definiert man `int_{gamma} f(xi) d xi := sum_{k=1}^{n} int_{gamma_{k}} f(xi) d xi`. Justification: ID: Definition:
Proof Steps with Justification: `ID#Connection#Justif-IDs#Opt-Justif-IDs#Proof Step Definition` `S1_F2` is an optional FALSE Proof Step for S1 Wrap Compare Operators with Blanks S1# #P1,P3#J2#ProofStep 1 `f(x)` S1_F1#=>#P1,P3##ProofStep 1 False 1 `sin(x^2)` S2#=>#P1,P3#J2#ProofStep 2 `prod_{k=1}^{oo} p_k^{alpha_k}` S3#<#J1,P3,P2#J3#ProofStep 3 `((a,b),(c,d))` S4#=#J3,P2#J3#ProofStep 4 `f(x) := {(x^2,"mit "x >= 0),(-x,"mit " x < 0 ):}` C1#=>### Proof Step: ID: Connect: Justification(-s): Optional Justification(-s): Step Definition:

Support/Tutorial: ASCII Math Syntax

Export and Import e-Proof as XML-File:

XML Edit e-Proof - Create Code
Use the export/import feature to save and store your current work in a text file.

Quantoren:
Folgen-Def.:
Summe:
≤:
Betrag:
Griechisch:
Funktion `f:[a,b] -> RR` :
Matrix/Vektor:

TPL1

//--------------------------------------------------------------------------------------
//-----e-PROOF: ___TITLE___
//--------------------------------------------------------------------------------------
//-----Author:  ___AUTHOR___
//-----e-Mail:  ___EMAIL___
//-----created: ___DATE___
//-----Language: ___LANGUAGE___
//--------------------------------------------------------------------------------------

//--------------------------------------------------------------------------------------
//-------1-COMMON CONTROL: Settings and Definition of Theorem and Proof-----------------
//--------------------------------------------------------------------------------------
// Documentation: see http://e-proof.weebly.com 
// e-Proof-Creator: http://e-proof.weebly.com/download--tools.html
//--------------------------------------------------------------------------------------
  $Theorem_Title = "___TITLE___"
//--------------------------------------------------------------------------------------
  $Theorem_Appendix = "___THEOREM_APPENDIX___"
//--------------------------------------------------------------------------------------

//--------------------------------------------------------------------------------------
//---ASSESSMENT-SETTINGS: e.g.Point Reduction per Error or per Used Support Features--------
$Per_Error_Minus_Percent  = ___PER_ERROR_MINUS_PERCENT___ // means ___PER_ERROR_MINUS_PERCENT___% less Points per Error per Step
$Assessment_Minus_Percent = 2 // means 2% less Points per Use of Assessment for Step (default 100%)
$Suggestion_Minus_Percent = 17 // means 17% less Points per Use of Suggestions for Step (default 20%)

//--------------------------------------------------------------------------------------
//-----unnecessary options make the proof step more difficult---------------------------
//--- ... = 0 means very simple
$unnecessary_preconditions = ___UNNECESSARY_PRECONDITIONS___
$unnecessary_proofsteps    = ___UNNECESSARY_PROOFSTEPS___
$unnecessary_connections   = ___UNNECESSARY_CONNECTIONS___
//--------------------------------------------------------------------------------------
//------Use Values 1 or 0 --------------------------------------------------------------
//--------------------------------------------------------------------------------------
$selectbox_proofsteps    = ___SELECTBOX_PROOFSTEPS___
$allow_own_proofsteps    = ___ALLOW_OWN_PROOFSTEPS___
$remap_proofstep_IDs     = ___REMAP_PROOFSTEP_IDS___
$randomize_proofstep_IDs = ___RANDOMIZE_PROOFSTEP_IDS___
//-----for Novices----------------------
$show_feedback_score = ___SHOW_FEEDBACK_SCORE___
$show_proof_solution = ___SHOW_PROOF_SOLUTION___
//---For AUTHORS------------------------
$show_Load_Save_Control = '___SHOW_LOAD_SAVE___'
$show_Main_Control      = '___SHOW_MAIN_CONTROL___'
$AuthoringMode = '___AUTHORINGMODE___'
$AssessmentMode = '0'
//---Miscellaneous Settings-------------
$LANGUAGE='___LANGUAGE___'  //EN or DE for German e-Proofs
$cryptkey='ACBSD'  // used if solution graph is encrypted in e-Proof-XML
$show_links='1'  // set to '0' for electronic assessment to remove external links
$MathFormat='AM_HTMLorMML'  // ASCIImath, alter settings for LaTeX math expression (for MathJax-Offline use only)
// $vQID='___QID___'  //uncomment for use of unique Question-ID
//----Questionnumbers for Backgroundcode
$COMMONCONTROL='___COMMONCONTROL___'
$QUESTIONTEXT='___COMMONCONTROL___'
$alertDOM='0'

//--------------------------------------------------------------
//--------------PRECONDITION------------------------------------
//--------------------------------------------------------------
$pi = 0
___PRECONDITIONS___
//--------------------------------------------------------------
//--------------CONCLUSION--------------------------------------
//--------------------------------------------------------------
$pi = 0
___CONCLUSIONS___
//--------------------------------------------------------------
//--------------JUSTIFICATIONS----------------------------------
//--------------------------------------------------------------
$pi = 0
___JUSTIFICATIONS___

//--------------------------------------------------------------
//--------------PROOFSTEP---------------------------------------
//--------------------------------------------------------------
$pi = 0
___PROOFSTEPS___
//--------------------------------------------------------------
//--------------SOLUTION DEFINITION-----------------------------
//--------------------------------------------------------------

//-[0]Previous_Step---[1]StepID---[2]Connection---[3]necessary_Justification---[4]optional_Just.
$so=0
___SOLUTION___
$MinimalProofSteps = $so

//--------------------------------------
//------INCLUDE LIBRARIES---------------
//--------------------------------------

includecodefrom(___CODE_ID_0___)  //QID of Background Code 0 - Scoring and Code Generation
includecodefrom(___CODE_ID_1___)  //QID of Background Code 1 - Scoring and Code Generation
includecodefrom(___CODE_ID_2___)  //QID of Background Code 2 - Scoring and Code Generation
includecodefrom(___CODE_ID_3___)  //QID of Background Code 3 - Scoring and Code Generation

//-----------------------------------------------------------------------
//----QUETIONTEXT: uncomment the following 6 lines by removing '//'------
//----and insert the code in Question Text of your IMathAS question------
//-----------------------------------------------------------------------

// <SCRIPT type='text/javascript'>
// includeqtextfrom(___CODE_ID_1___)
// includeqtextfrom(___CODE_ID_2___)
// includeqtextfrom(___CODE_ID_3___)
// </SCRIPT>
// includeqtextfrom(___CODE_ID_0___)

//----------------------------------------------------------
//----------------------------------------------------------

LOOP1 Preconditions

LOOP2 Conclusions

LOOP3 Justifications

LOOP4 Proof Steps

LOOP5 Solution

iMathAS e-Proof Creator - document.write(vVersion);

Export and Import e-Proof as XML-File:

iMathAS e-Proof Creator -