lucky_Numbers using recursion.py

#problem statement
'''Lucky numbers are subset of integers.let us see the process of arriving at lucky numbers,
Take the set of integers
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,……
First, delete every second number, we get following reduced set.
1, 3, 5, 7, 9, 11, 13, 15, 17, 19,…………
Now, delete every third number, we get
1, 3, 7, 9, 13, 15, 19,….….
Continue this process indefinitely……
Any number that does NOT get deleted due to above process is called “lucky”.'''
class Solution:
    def lucky(self,n,i):
        if(n%i==0):
            return False
        elif(n<i):
            return True
        p=n-(n//i)
        return self.lucky(p,i+1)
    def isLucky(self, n): 
        #RETURN True OR False
        return self.lucky(n,2)
 
# Driver Code Starts
if __name__ == '__main__':
    t=int(input())
    
    for tcs in range(t):
        n=int(input())
        obj = Solution()
        if obj.isLucky(n):
            print(1)
        else:
            print(0)
        
# } Driver Code Ends