Answer:
Following are the program in python language the name of the program is factors.py
num= int(input("Please enter a positive integer: "))#Read the number by user
print("The factors of ",num,"are:")
for k in range(2,num): #iterating over the loop
if(num%k==0): #checking the condition
print(k)#display the factor
Output:
Please enter a positive integer: 12
The factors of 12 are:
2
3
4
6
Explanation:
Following are the description of the program
- Read the number by user in the "num" variable
- Iterating the for loop from k=2 to less then "num".
- In the for loop checking the factor of "num" variable by using % operator.
- Finally display the factor by using print function
The first one is d the second one is true the third one is false
Answer:
Both careers speak to an audience; however, people involved in the performing arts speak only to a live audience.
Explanation:
sorry im late but im not sure
Answer:
a lan party
Explanation:
because it's your personal party
Answer:
Running RECURSIVE-MATRIX-CHAIN is asymptotically more efficient than enumerating all the ways of parenthesizing the product and computing the number of multiplications of each.
the running time complexity of enumerating all the ways of parenthesizing the product is n*P(n) while in case of RECURSIVE-MATRIX-CHAIN, all the internal nodes are run on all the internal nodes of the tree and it will also create overhead.
Explanation:
