Kommentare:Bayrische Abitur 2012 Analysis I: Unterschied zwischen den Versionen

Version vom 29. April 2013, 18:40 Uhr

Anleitungen: Bayrische Abitur 2012 Analysis I

CAS Beispiele: Bayrische Abitur 2012 Analysis I

Testinhalt

Mod[ <Integer a>, <Integer b> ]: Yields the remainder when integer a is divided by integer b.; Beispiel:
Mod[9, 4] yields 1.
Mod[ <Polynomial>, <Polynomial>]: Yields the remainder when the first entered polynomial is divided by the second polynomial.; Beispiel:
Mod[x^3 + x^2 + x + 6, x^2 - 3] yields 4 x + 9.

Mod[ <Integer a>, <Integer b> ]: Yields the remainder when integer a is divided by integer b.; Beispiel:
Mod[9, 4] yields 1.
Mod[ <Polynomial>, <Polynomial> ]: Yields the remainder when the first entered polynomial is divided by the second polynomial.; Beispiel:
Mod[x^3 + x^2 + x + 6, x^2 - 3] yields 4 x + 9.

@@ Zeile 5: / Zeile 5: @@
 Testinhalt
+;Mod[ <Integer a>, <Integer b> ]
+:Yields the remainder when integer ''a'' is divided by integer ''b''.
+:{{example|1=<div><code><nowiki>Mod[9, 4]</nowiki></code> yields ''1''.</div>}}
+;Mod[ <Polynomial>, <Polynomial>]
+:Yields the remainder when the first entered polynomial is divided by the second polynomial.
+:{{example|1=<div><code><nowiki>Mod[x^3 + x^2 + x + 6, x^2 - 3]</nowiki></code> yields ''4 x + 9''.</div>}}
+==CAS Syntax==
+;Mod[ <Integer a>, <Integer b> ]
+:Yields the remainder when integer ''a'' is divided by integer ''b''.
+:{{example|1=<div><code><nowiki>Mod[9, 4]</nowiki></code> yields ''1''.</div>}}
+;Mod[ <Polynomial>, <Polynomial> ]
+:Yields the remainder when the first entered polynomial is divided by the second polynomial.
+:{{example|1=<div><code><nowiki>Mod[x^3 + x^2 + x + 6, x^2 - 3]</nowiki></code> yields ''4 x + 9''.</div>}}