BCALLs Template

Synopsis

Official Name: ProveTheRiemannHypothesis

BCALL Address: 0042

Proves the Riemann Hypothesis, storing the proof in an AppVar.

Inputs

• OP1: AppVar to save proof into
• HL: Maximum length of proof, in pages (must be at least 200)
• bit proofCorrect, (iy + proofFlags): Set to generate a correct proof

Outputs

• Proof stored in AppVar
• Zero Flag: Set if successful

Registers Destroyed

• af

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.

Example

ld  hl, ProofAppVar
rst rMOV9TOOP1
ld  hl, 1000
B_CALL ProveTheRiemannHypothesis

Credits and Contributions

• /dev/null: For not answering my questions about this B_CALL