
import random

from .binary_exp_mod import bin_exp_mod



def        UpperCamelCase    (							lowerCAmelCase__ ,			lowerCAmelCase__=1000		):
					'''simple docstring'''
					if n < 2:
										return False

					if n % 2 == 0:
										return n == 2

					# this means n is odd
					lowercase							=						n - 1
					lowercase							=						0
					while d % 2 == 0:
										d /= 2
										exp += 1

					# n - 1=d*(2**exp)
					lowercase							=						0
					while count < prec:
										lowercase							=						random.randint(2 ,			n - 1		)
										lowercase							=						bin_exp_mod(lowerCAmelCase__ ,			lowerCAmelCase__ ,			lowerCAmelCase__		)
										if b != 1:
															lowercase							=						True
															for _ in range(lowerCAmelCase__		):
																				if b == n - 1:
																									lowercase							=						False
																									break
																				lowercase							=						b * b
																				b %= n
															if flag:
																				return False
															count += 1
					return True


if __name__ == "__main__":
							lowercase__		:Tuple   =    abs(int(input("Enter bound : ").strip()))
							print("Here's the list of primes:")
							print(", ".join(str(i) for i in range(n + 1) if is_prime_big(i)))






def        UpperCamelCase    (							lowerCAmelCase__		):
					'''simple docstring'''

					if edge <= 0 or not isinstance(lowerCAmelCase__ ,			lowerCAmelCase__		):
										raise ValueError('''Length must be a positive.'''		)
					return 3 * ((25 + 10 * (5 ** (1 / 2))) ** (1 / 2)) * (edge**2)



def        UpperCamelCase    (							lowerCAmelCase__		):
					'''simple docstring'''

					if edge <= 0 or not isinstance(lowerCAmelCase__ ,			lowerCAmelCase__		):
										raise ValueError('''Length must be a positive.'''		)
					return ((15 + (7 * (5 ** (1 / 2)))) / 4) * (edge**3)


if __name__ == "__main__":
							import doctest

							doctest.testmod()




