import Foundation
// Helper function to check if a number is prime
func isPrime(_ n: Int) -> Bool {
if n <= 1 { return false }
if n <= 3 { return true }
if n % 2 == 0 || n % 3 == 0 { return false }
var i = 5
while i * i <= n {
if n % i == 0 || n % (i + 2) == 0 {
return false
}
i += 6
}
return true
}
// Main function to check if deleting one digit makes the number prime
func canBePrimeByDeletingOneDigit(_ number: Int) -> Bool {
let strNum = String(number)
// Iterate through each digit position
for i in 0..<strNum.count {
var tempStr = strNum
let index = tempStr.index(tempStr.startIndex, offsetBy: i)
// Remove the digit at current index
tempStr.remove(at: index)
// Convert back to Int and check if it's prime
if let newNum = Int(tempStr), isPrime(newNum) {
return true
}
}
return false
}
let n = 78919
if canBePrimeByDeletingOneDigit(n) {
print("Yes, \(n) can be prime after deleting one digit.") // Example: 61 is prime
} else {
print("No.")
}
/*
run:
Yes, 78919 can be prime after deleting one digit.
*/