Sure, here is a Python program that calculates the average of all prime numbers in a given array:

```python
def is_prime(n):
if n

Question

Sure, here is a Python program that calculates the average of all prime numbers in a given array:

```python
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 average_prime(arr):
    prime_sum = 0
    prime_count = 0
    for num in arr:
        if is_prime(num):
            prime_sum += num
            prime_count += 1
    if prime_count == 0:
        return 0
    return prime_sum / prime_count

# Test the function
arr = [2, 3, 4, 5, 6, 7, 8, 9, 10]
print(average_prime(arr))
```

In this program, we first define a helper function `is_prime(n)` to check if a number `n` is prime. Then we define the main function `average_prime(arr)` to calculate the average of all prime numbers in the array `arr`. We iterate over each number in the array, and if the number is prime (checked by `is_prime(num)`), we add it to the sum of prime numbers and increment the count of prime numbers. Finally, we return the average of prime numbers, which is the sum of prime numbers divided by the count of prime numbers. If there are no prime numbers in the array, we return 0.

Knowee AI · Accepted Answer

Sure, here is a Python program that calculates the average of all prime numbers in a given array:

```python
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 average_prime(arr):
    prime_sum = 0
    prime_count = 0
    for num in arr:
        if is_prime(num):
            prime_sum += num
            prime_count += 1
    if prime_count == 0:
        return 0
    return prime_sum / prime_count

# Test the function
arr = [2, 3, 4, 5, 6, 7, 8, 9, 10]
print(average_prime(arr))
```

In this program, we first define a helper function `is_prime(n)` to check if a number `n` is prime. Then we define the main function `average_prime(arr)` to calculate the average of all prime numbers in the array `arr`. We iterate over each number in the array, and if the number is prime (checked by `is_prime(num)`), we add it to the sum of prime numbers and increment the count of prime numbers. Finally, we return the average of prime numbers, which is the sum of prime numbers divided by the count of prime numbers. If there are no prime numbers in the array, we return 0.

Write a Program to Find the average of all Prime Numbers from a Given Array?

Question

Solution

Similar Questions

Upgrade your grade with Knowee