FREQ=12345678 'Frequency in Hz
PRINT FREQ
print format$(freq,"%9.0f")

ABC% = 12345

'*********************************************************** *
'Add 2 x 12 digit integers. Result is a 13 Digit integer
'
'*********************************************************** *
Function AddBig$(a$,b$)

Local A(12),B(12),C(13),I,J,C$(1) length 13

'Split A$ into A()
J=0
for I=Len(a$) to 1 step -1
A(J)=val(Mid$(A$,I,1))
J=J+1
next I

'Split B$ into B()
J=0
for I=Len(B$) to 1 step -1
B(J)=val(Mid$(B$,I,1))
J=J+1
next I

Local Carry
Carry=0
'Add each element of A() to B() result into c()
For I = 0 to 11
C(I)=A(I) + B(I) + Carry
if C(I)>9 then
Carry=1
C(I)=c(I)-10
else
Carry=0
endif
Next I

C(12)=Carry

For I=12 to 0 step -1
c$(1)=c$(1) + str$(c(I))
next

AddBig$=TrimLZero$(C$(1))

End Function

Function TrimLZero$(A$)

local I
for I= 1 to Len(A$)

If Mid$(A$,I,1)<>"0" then
TrimLZero$= Mid$(A$,I)
exit function
endif

next I

TrimLZero$="0"

end function

'
'Returns A$ x B$ as a string
'Usage A$="12345678", B$="1234"
'C$=MulBCD$(A$,B$)
'This algorithm works on Triplets of digits
'
Function MulBCD$(A$, B$)
Local Cy, I, J, K, L, M, N

'Arrays into which we will unpack the BCD numbers
Local A1(4), B1(4)

'Arrays for the answers
Local D(12), C1(8)

Local C$(1) Length 3, C2$(1) Length 24

Local A2$(1) Length 12, B2$(1) Length 12

M = Len(A$)
N = Len(B$)

'Optimise the speed by making sure the Multiplier is the shorter of the
'2 arguments
If N > M Then
A2$(1) = B$
B2$(1) = A$
Else
A2$(1) = A$
B2$(1) = B$
EndIf

M = Len(A2$(1))
N = Len(B2$(1))

'Are the numbers in multiples of 3 digits
J = 0
If M Mod 3 <> 0 Then
For I = 3 To 12 Step 3
If M < I Then
J = I - M
M = I
Exit For
EndIf
Next I
EndIf
A2$(1) = String$(J, "0") + A2$(1)

'Are the arguments in multiples of 3 digits
J = 0
If N Mod 3 <> 0 Then
For I = 3 To 12 Step 3
If N < I Then
J = I - N
N = I
Exit For
EndIf
Next I
EndIf

B2$(1) = String$(J, "0") + B2$(1)

'Unpack the Numbers from String into Numeric array
J = 0
For I = M - 2 To 1 Step -3
A1(J) = Val(Mid$(A2$(1), I, 3))
J = J + 1
Next I

J = 0
For I = N - 2 To 1 Step -3
B1(J) = Val(Mid$(B2$(1), I, 3))
J = J + 1
Next I

'Now Do the Long Multiplication of the two numbers
'Set Units first
L = 0
K = 0

For I = 0 To M \ 3 Step 1
Cy = 0
For J = 0 To N \ 3 Step 1

C1(J) = (A1(I) * B1(J)) + Cy

If C1(J) > 999 Then
Cy = C1(J) \ 1000
C1(J) = C1(J) Mod 1000
Else
Cy = 0
EndIf

Next J

'Add the partial result to the overall total
'Add each element of C() to D() result into D()
Cy = 0

For J = 0 To 23 \ 3
K = J + L
D(K) = D(K) + C1(J) + Cy
If D(K) > 999 Then
Cy = D(K) \ 1000 '100
D(K) = D(K) Mod 1000 '- 1000
Else
Cy = 0
EndIf
Next J

L = L + 1

Next I

'Build result string
For I = 23 \ 3 To 0 Step -1
C$(1)=""
If D(I) < 100 Then C$(1)="0"
If D(I) < 10 then C$(1)="00"
C2$(1) = C2$(1) + C$(1)+(Str$(D(I)))
Next I

C2$(1) = TrimL$(C2$(1), "0")
MulBCD$=C2$(1)

End Function

'====================================
'
'Remove leading CHARacters from a string
'If char$ is ommitted or blank then trim ZEROES
'
Function TrimL$(A$, Char$)

Local I, CH$(1) Length 1

ch$(1) = Left$(Char$, 1)
If ch$(1) = "" Then ch$(1) = "0"
For I = 1 To Len(A$)

If Mid$(A$, I, 1) <> "0" Then
TrimL$ = Mid$(A$, I)
Exit Function
EndIf

Next I

TrimL$ = CH$(1)

End Function