human
An interesting solution to get all prime numbers smaller than n | Python3 program to prints prime numbers smaller than n.
Compute factorials and apply Wilson 's  theorem..
Driver code"
How can the above be solved in Python?
 Write me a code to an interesting solution to get all prime numbers smaller than n and the other steps required?
assistant
#Here is code to an interesting solution to get all prime numbers smaller than n and the other steps required.
 def primesInRange ( n ) :
	fact = 1
	for k in range ( 2 , n ) :
		fact = fact * ( k - 1 )
		if ( ( fact + 1 ) % k == 0 ) :
			print k
n = 15
primesInRange ( n )