human
Largest number in [ 2 , 3 , . . n ] which is co | Python3 code to find Largest number in [ 2 , 3 , . . n ] which is co - prime with numbers in [ 2 , 3 , . . m ].
Returns true if i is co - prime with numbers in set [ 2 , 3 , ... m ].
Running the loop till square root of n to reduce the time complexity from n.
Find the minimum of square root of n and m to run the loop until the smaller one.
Check from 2 to min ( m , sqrt ( n ) ).
def to find the largest number less than n which is Co - prime with all numbers from 2 to m.
Iterating from n to m + 1 to find the number.
checking every number for the given conditions.
The first number which satisfy the conditions is the answer.
If there is no number which satisfy the conditions , then print number does not exist ..
Driver Code"
How can the above be solved in Python?
assistant
#Here is code to largest number in [ 2 , 3 , .
 import math
def isValid ( i , m ) :
	sq_i = math . sqrt ( i )
	sq = min ( m , sq_i )
	for j in range ( 2 , sq + 1 ) :
		if ( i % j == 0 ) :
			return False
	return True
def findLargestNum ( n , m ) :
	for i in range ( n , m , - 1 ) :
		if ( isValid ( i , m ) ) :
			print ( " { } " . format ( i ) ) ;
			return
	print ( " Number Doesn ' t Exists " )
n = 16
m = 3
findLargestNum ( n , m )