Park-Miller Algorithm

[hughng92]

Thanks. I did not mean to put my whole code up here and asked people to look at my code and fix the errors for me. Here is my complete code.

class Random:
   def __init__(self,seed):
       self.n = seed
   def next(self,range):
       self.n = ((pow(7,5)*self.n)%(pow(2,31)-1))
       self.m = (self.n)%(int(range))
       return self.m
   def choose(self,letters):
       self.s = letters
       charak = self.s[self.next(len(self.s))]
       return charak
class Mnemonic:
   def __init__(self,seed):
       self.random = Random(seed)
       self.follow = {'a':'','b':'','c':'','d':'','e':'','f':'','g':'','h':'','i':'','j':'','k':'','l':'','m':'','n':'','o':'','p':'','q':'','r':'','s':'','t':'','u':'','v':'','w':'','x':'','y':''}
       self.letters = {0:'z',1:'q',2:'abc',3:'def',4:'ghi',5:'jkl',6:'mno',7:'prs',8:'tuv',9:'wxy'}
   def add(self,word):
       self.w = word
       for i in range(0,len(self.w)-2):
           self.follow[self.w]+=self.w[i+1]

   def make(self,number):
       self.num = number
       self.s1=''
       self.s2=''
       self.s3=''
       i = 0
       self.s1+=self.random.choose(self.letters[int(self.num[0])])

       while i < len(self.num):
           # self.s1 +=self.random.choose(self.letters[int(self.num)])
           self.s2 += self.follow[self.s1[-1]]
           i=+1
           j = 0
           while j < len(self.s2):
               found_char = True
               if self.s2[j]==self.s1:
                   self.s3+=self.s2[j]
                   found_char = True
               elif found_char == False:
                   return ''
               j+=1
       self.s1 += self.random.choose(self.letters[self.s3])
       return self.s1

---

I am sorry but did I make a mistake by putting my whole code up here? I am sorry I did not mean to break the rules.