Hi, you haven't provided the programing language in which you need the code, I'll explain how to do it using Python, and you can follow the same logic to make a program in the programing language that you need.
Answer:
import math
def rectangle(perimeter, area):
l1_1 = (perimeter+math.sqrt((perimeter**2)-(16*area)))/4
l1_2 = (perimeter-math.sqrt((perimeter**2)-(16*area)))/4
l2_1 = area/l1_1
l2_2 = area/l1_2
print(l1_1,l2_1)
print(l1_2,l2_2)
if l1_1.is_integer() and l2_1.is_integer() and l1_1>0 and l2_1>0:
return(int(max(l1_1,l2_1)))
elif l1_2.is_integer() and l2_2.is_integer() and l1_2>0 and l2_2>0:
return(int(max(l1_2,l2_2)))
else:
return(None)
Explanation:
- We import math to make basic operations
- We define the rectangle function that receives perimeter and area
- We calculate one of the sides (l1_1) of the rectangle using the quadratic equation to solve 2h^2 - ph + 2a = 0
- We calculate the second root of the quadratic equation for the same side (l1_2)
- We calculate the second side of the rectangle using the first root on w = a/h
- We calculate the second side of the rectangle using the second root on w= a/h
- We verify that each component of the first result (l1_1, l2_1) is an integer (using the build-in method .is_integer) and greater than 0, if True we return the maximum value between them (using the max function) as w
- If the first pair of sides evaluate to False we check the second root of the equation and if they meet the specification we return the max value
- if all the if statements evaluate to false we return None to indicate that not positive or integer sides were found
Answer:
Explanation:
The following code is written in Java and is a function/method that takes in an int array as a parameter. The type of array can be changed. The function then creates a counter and loops through each element in the array comparing each one, whenever one element is found to be a duplicate it increases the counter by 1 and moves on to the next element in the array. Finally, it prints out the number of duplicates.
public static int countDuplicate (int[] arr) {
int count = 0;
for(int i = 0; i < arr.length; i++) {
for(int j = i + 1; j < arr.length; j++) {
if(arr[i] == arr[j])
count++;
}
}
return count;
}
Answer:
all except keeping your hands higher than your elbows
Answer:(c) abstract class A { abstract void unfinished(); }
Explanation:
A legal abstract class must have the keyword abstract before the class and an abstract class has abstract functions with the keyword abstract written and a void as the return type.
Answer:
def main():
# Accept data from the user
n=int(input('Enter the value of n:'))
k=2;
sum=0
print('The list of the prime numbers are as follows:')
# This loop runs from k to n
while k<=n:
# Call is_prime() method,
# to check whether k is a prime or not
sum=sum+is_prime(k)
k=k+1
print('Sum of the prime numbers:',sum)
# is_prime() Method
def is_prime(k):
prime=0
i=1
# Check k is a prime or not
while i<=int(k):
# Find the factors of k
if (k % i) == 0:
prime=prime+1
i=i+1
# If k as two factors
if(prime==2):
print(k)
return k;
# If k as more than two factors
else:
return 0;
# Call the main() method
main()
Explanation: