find the smallest prime which doesnt devide any 5 digit number in successive order
To find the smallest prime number that does not divide any 5-digit number in successive order, you can follow these steps:
1. Start by assuming the smallest prime number is 2.
2. Look for 5-digit numbers that can be divided by 2 in successive order.
3. If you find a 5-digit number that is divisible by 2 (meaning the number divided by 2 does not leave a remainder), move on to the next prime number.
4. Increase the assumed prime number to the next prime number (next prime after 2 is 3).
5. Repeat steps 2 and 3 until you find a prime number that does not divide any 5-digit number in successive order.
Here is some Python code that implements the steps mentioned above:
```python
import math
def is_prime(n):
if n <= 1:
return False
if n <= 3:
return True
if n % 2 == 0 or n % 3 == 0:
return False
i = 5
while i * i <= n:
if n % i == 0 or n % (i + 2) == 0:
return False
i += 6
return True
def find_smallest_prime():
prime = 2
while True:
is_divisible = False
for n in range(10000, 100000):
if n % prime == 0:
is_divisible = True
break
if not is_divisible:
return prime
prime = is_prime(prime + 1)
# Call the function to find the smallest prime
smallest_prime = find_smallest_prime()
print(smallest_prime)
```
When you run this code, it will output the smallest prime number that does not divide any 5-digit number in successive order.