Answer:
how many times as strong would what?
put your question in the replies to this answer and I'll gladly answer it
Explanation:
May I have brainliest please? :)
Answer:
b. structured
Explanation:
Based on the information being described within the question it can be said that the type of decisions being mentioned are known as structured decisions. These are decisions which have various processes in place in order to handle a certain situation. Usually due to the problem having occurred countless times and are predictable.
Answer:
// program in Python to check perfect number
#function to find number is perfect or not
def is_Perfect_Number(n):
#total variable
tot = 1
i = 2
#sum of all divisor of number
while i*i<=n:
if n%i==0:
tot = tot + i + n/i
if tot == n and n != 1:
return 1
i = i+1
return 0
#read until user enter a perfect number
while True:
#read integer
num = int(input("Input an integer: "))
#call the function
if(is_Perfect_Number(num)):
print(num,"is perfect number")
#if perfect number break
break
else:
print(num,"is not a perfect number")
#ask again
print("try again.")
Explanation:
Read number from user and then call the function is_Perfect_Number() with parameter "num".This will find the sum of all divisor of number.If sum is equal to number then it will return 1 else return 0.If the number is not perfect then it will again ask to enter a number until user enter a perfect number.
Output:
Input an integer: 24
24 is not a perfect number
try again.
Input an integer: 28
28 is perfect number
Answer:
876100
019343
Explanation:
10s complement of a decimal number is obtained by the following process:
- Obtain 9s complement ( Subtract each digit by 9)
- Add 1 to the result
1) 123900
9s complement => (9-1)(9-2)(9-3)(9-9)(9-0)(9-0)
= 876099
Adding 1 , 10s complement of 123900 = 876100
2) 980657
9s complement = (9-9)(9-8)(9-0)(9-6)(9-5)(9-7)
= 019342
Adding 1 , 10s complement of 980657 = 019343
