just wondering about this

So I was wondering if it was possible to make a program that can make every possible combination of letters numbers symbols that are on a keyboard. for example of letters

a
ab
ac
ad

and so on untill you get to zzzzzzzzzzzzzzzzzzzzzzzzzz (theres 26 z's)
and an exampl for numbers
1
12
13
14
and so on until you get to 9999999999(theres ten 9's_

and with symbols for example
!@
!#
!$
!%
!^
until you get to ????????????????????????????????(theres 32 ?'s)

and then on top of that be able to add them togather. for example...
a1!
a2!
a3!
and so on until you get to zzzzzzzzzzzzzzzzzzzzzzzzzz9999999999????????????????????????????????(theres 68 total)

I was just wondering if it was possible to make a progam to list every single combination of letters, numbers, symbols, and mixed. because there are 160,059,109,085,386,090,080,713,531,498,405,298,176 letter combos, 46,768,052,394,588,893,382,517,914,646,921,056,628,989,841,375,232 symbol combos, 100,000,000,000 number combos
and there are 2,774,054,420,890,685,265,384,258,480,761,524,420,016,717,632,080,884,787,173,283,895,178,070,928,165,091,329,013,484,207,653,879,399,636,868,118,593,099,922,373,869,568 mixed combos. I want to make a program to write these for me because it would take me forever to write out all those combos. to get the total numbers of combos add those three large numbers togather.

Comments

just wondering ...

bubbachunk ... The program listing below does the opposite of what you want to do. It accepts a decimal number and converts it to a string variable that compresses the decimal number to a base n number, where n goes from 2 to 62. Base 62 numbers need to have 10+26+26=52 unique symbols, including zero. In this program, they must be printable ASCII characters, which are available on the English language computers. Regards ... Tom M


! filename: decbas62a.tru t. maresca, 8 sep 93, rev 10-28-05
! converts decimal numbers to base 2-to-62 strings
LET D$="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"
PRINT
PRINT " Converts a positive decimal integer to a base 2-to-62 number"
PRINT
INPUT prompt " Base (2 to 62) = " :B
LET b=int(b)
IF B<2 THEN LET B=2
IF B>62 THEN LET B=62
DO
PRINT
INPUT prompt " Decimal (base 10) number = ": N
IF N<0 THEN exit do
LET NN=int(N)
IF NN<0 THEN LET NN=-NN
LET D=0
LET C$=""
DO WHILE NN<>0
LET D=D+1
LET Q=INT(NN/B)
LET R=NN-B*INT(NN/B)
LET NN=Q
LET C$=D$[R+1:r+1] & C$
LOOP
IF N=0 THEN LET C$="0"
PRINT
PRINT USING "###,###,###,###,###,### ": N;
PRINT "( base ";10;") = ";C$;" ( base";B;")"
LOOP
PRINT
PRINT " Thanks for using DECBAS62.TRU ... Tom M"
END
! 3,843 (base 10) = zz (base 62)
! 238,327 (base 10) = zzz (base 62)
! 14,776,335 (base 10) = zzzz (base 62)
! 916,132,831 (base 10) = zzzzz (base 62)
! 56,800,235,583 (base 10) = zzzzzz (base 62)
! 3,521,614,606,207 (base 10) = zzzzzzz (base 62)
! 218,340,105,584,896 (base 10) = zzzzzzzz (base 62)

Large numbers

Hi,

You could be dealing with very large numbers here. The largest number that TB can handle is:
1.79769 e+308

It is likely that you might exceed this with the calculation you intend so you will need HUGELIB.trc.

HUGLIB.trc will allow you to calculate with integers and decimals with up to 100,000 digits.

Big John