Checksum

This program computes a weighted checksum digit for a six-digit number. The user enters each digit individually, after which the program applies alternating weights of 1 and 2 (1, 2, 1, 2, 1, 2) to the digits and sums the results. It then repeatedly extracts and re-sums the decimal digits of that total until a single digit remains, using a cross-sum (digital root) reduction loop at lines 210–240. The final single-digit result is displayed as the check digit.

---

Program Analysis

Program Structure

The program is straightforward and linear, divided into three logical phases:

1. Input phase (lines 10–111): Prompts the user to enter six digits one at a time, storing them in variables A through F.
2. Computation phase (lines 180–240): Applies a weighted sum then reduces it to a single digit.
3. Output phase (lines 160–290): Displays the original number and the computed check digit.

Checksum Algorithm

Line 180 computes a weighted sum S = A + 2*B + C + 2*D + E + 2*F, applying weights 1 and 2 alternately to each digit position. Lines 210–240 implement a digital root reduction: the sum is split into its tens digit (T = INT(S/10)) and units digit (U = S - T*10), then S is replaced by T + U. This loop repeats until S is a single digit (≤ 9). The result is a form of iterative digit summing rather than a standard modulo-10 check.

Key BASIC Idioms

• The widely spaced line numbers (10, 30, 50, 70…) leave room for future insertions between input steps.
• GOTO 210 at line 240 implements a simple conditional loop without a FOR/NEXT construct, appropriate since the iteration count is data-dependent.
• The trailing comma on line 170’s PRINT statement moves the cursor to the next print zone but doesn’t suppress the newline entirely; combined with the semicolons, this produces a specific layout for the six digits.

Variable Usage

Variable	Purpose
A–F	The six input digits
S	Running weighted sum, updated in-place during reduction
T	Tens portion of S (quotient of division by 10)
U	Units portion of S (remainder after division by 10)

Notable Techniques

The digital root loop at lines 210–240 reuses variable S rather than introducing new variables for each iteration, keeping memory use minimal. The reduction is guaranteed to terminate since the digit sum of any positive integer is strictly smaller than the integer itself once it exceeds a single digit.

Bugs and Anomalies

The program accepts any numeric value from INPUT, not just single digits 0–9. Entering a non-digit value (e.g. a multi-digit number or a negative number) will silently produce an incorrect checksum. There is no input validation. Additionally, line 2 (LIST) executes immediately after the auto-run SAVE, causing the program listing to be displayed before the title screen — this is likely an unintentional remnant left in during development.