Difference between revisions of "83Plus:BCALLs:80B1"

From WikiTI
Jump to: navigation, search
m
 
 
Line 1: Line 1:
'''Note:''' Do not take the information on this template page as actual documentation!
+
[[Category:83Plus:BCALLs:By Name:Math:Integer|Div32By16]] [[Category:83Plus:BCALLs:By Name:Math|Div32By16]] [[Category:83Plus:BCALLs:By Name|Div32By16]] [[Category:83Plus:BCALLs:By Address|80B1 - Div32By16]]
 
+
Use this template for ROMCalls on calculators that don't use banked OS calls. Simply replace every occurance of bcall/BCALL/b_call with romcall/ROMCall/call.
+
 
+
The BCALLs are named by their b_call address, in hexadecimal. An example is [[83Plus:BCALLs:4009]].
+
 
+
Also, please put the following code (edited to reflect your call) in your page:
+
NaodW29-nowiki65e132483462823800000001
+
This will cause your page to show in the appropriate categories. (Change the ProveTheRiemannHypothesis, 0042, and Utility to match your call. Also, change the 83Plus to whatever category, and change the BCALLs to ROMCalls if needed.) You may put a BCALL in any number of "By Name" categories. Put it in all the ones that make sense.
+
 
+
----
+
 
+
 
== Synopsis ==
 
== Synopsis ==
'''Official Name:''' ProveTheRiemannHypothesis
+
'''Official Name:''' Div32By16
  
'''BCALL Address:''' 0042
+
'''BCALL Address:''' 80B1
''Use "Call Address" for regular 83.''
+
  
Proves the Riemann Hypothesis, storing the proof in an AppVar.
+
Divide a 32-bit number stored in OP1 by DE.
  
 
=== Inputs ===
 
=== Inputs ===
* [[83Plus:RAM:8478|OP1]]: AppVar to save proof into
+
* [[83Plus:RAM:8478|OP1]]: 32-bit big endian dividend
* HL: Maximum length of proof, in pages (must be at least 200)
+
* DE: divisor
* bit proofCorrect, (iy + proofFlags): Set to generate a correct proof
+
  
 
=== Outputs ===
 
=== Outputs ===
* Proof stored in AppVar
+
* [[83Plus:RAM:8478|OP1]]: 32-bit big endian quotient
* Zero Flag: Set if successful
+
* [[83Plus:RAM:8483|OP2]]: 32-bit big endian remainder
  
 
=== Destroys ===
 
=== Destroys ===
* af
+
* AF, BC, HL, IX
 +
* [[83Plus:RAM:8251|bootTemp]]: 4 bytes
  
 
== Comments ==
 
== Comments ==
This B_CALL proves the Riemann Hypothesis, giving a proof under the required number of pages. It does this by randomly guessing proofs until it finds one that works. Needless to say, the calculator's batteries will run out before this B_CALL completes.
+
This routine is rather inefficient.
 
+
== Example ==
+
NaodW29-nowiki65e132483462823800000002
+
 
+
== Credits and Contributions ==
+
* '''/dev/null:''' For not answering my questions about this B_CALL
+

Latest revision as of 14:55, 30 March 2005

Synopsis

Official Name: Div32By16

BCALL Address: 80B1

Divide a 32-bit number stored in OP1 by DE.

Inputs

  • OP1: 32-bit big endian dividend
  • DE: divisor

Outputs

  • OP1: 32-bit big endian quotient
  • OP2: 32-bit big endian remainder

Destroys

Comments

This routine is rather inefficient.