Sure, here is a Python program that will solve the problem:

```python
def perfect_numbers(a, b):
perfect_nums = []
for num in range(a, b+1):
sum = 0
for i in range(1, num):
if(num % i == 0):
sum = sum + i
if (sum == num):
perfect_nums.append(num)
if not perfect_nums:
return "No perfect numbers"
else:
return ' '.join(map(str, perfect_nums))

a, b = map(int, input().split())
print(perfect_numbers(a, b))
```

This program works by iterating over each number in the range from `a` to `b` (inclusive). For each number, it finds all of its divisors (excluding the number itself) and sums them up. If the sum of the divisors equals the number, then the number is a perfect number and it is added to the list of perfect numbers. If no perfect numbers are found, the program returns "No perfect numbers". Otherwise, it returns a string of all the perfect numbers separated by a space.

Question

Sure, here is a Python program that will solve the problem:

```python
def perfect_numbers(a, b):
    perfect_nums = []
    for num in range(a, b+1):
        sum = 0
        for i in range(1, num):
            if(num % i == 0):
                sum = sum + i
        if (sum == num):
            perfect_nums.append(num)
    if not perfect_nums:
        return "No perfect numbers"
    else:
        return ' '.join(map(str, perfect_nums))

a, b = map(int, input().split())
print(perfect_numbers(a, b))
```

This program works by iterating over each number in the range from `a` to `b` (inclusive). For each number, it finds all of its divisors (excluding the number itself) and sums them up. If the sum of the divisors equals the number, then the number is a perfect number and it is added to the list of perfect numbers. If no perfect numbers are found, the program returns "No perfect numbers". Otherwise, it returns a string of all the perfect numbers separated by a space.

Knowee AI · Accepted Answer

Sure, here is a Python program that will solve the problem:

```python
def perfect_numbers(a, b):
    perfect_nums = []
    for num in range(a, b+1):
        sum = 0
        for i in range(1, num):
            if(num % i == 0):
                sum = sum + i
        if (sum == num):
            perfect_nums.append(num)
    if not perfect_nums:
        return "No perfect numbers"
    else:
        return ' '.join(map(str, perfect_nums))

a, b = map(int, input().split())
print(perfect_numbers(a, b))
```

This program works by iterating over each number in the range from `a` to `b` (inclusive). For each number, it finds all of its divisors (excluding the number itself) and sums them up. If the sum of the divisors equals the number, then the number is a perfect number and it is added to the list of perfect numbers. If no perfect numbers are found, the program returns "No perfect numbers". Otherwise, it returns a string of all the perfect numbers separated by a space.

Question

Solution

Similar Questions

Upgrade your grade with Knowee