Answer:
5, 10 and 16
Explanation:
The sum of their ages is √961 = 31
If Joe is x years old, the equation that follows is:
x + (x+5) + (x+5+6) = 31
This simplifies to
3x = 31 - 11 - 5 = 15
so x=5
From that you can find
Joe = x = 5
Kate = x+5 = 10
Jody = x+5+6 = 16
Answer:
// program in Python.
#read year
i_year=int(input("Please Enter a year:"))
#check leap year
if((i_year % 4 == 0 and i_year % 100 != 0) or (i_year % 400 == 0)):
print("{} is a leap year.".format(i_year))
else:
print("{} is not a leap year.".format(i_year))
Explanation:
Read year from user and assign it to variable "year".If year is completely divisible by 4 and not divisible by 100 or year is completely divisible by 400 then year is leap year otherwise year is not a leap year.
Output:
Please Enter a year:2003
2003 is not a leap year.
Answer:
The answer is "Contained in"
Explanation:
Its term refers to the classified information of the extraction process, even though outlined in an authorized categorization instruction origin without extra explanation or review, and incorporates these data in a new document.
In this concept, the information appears in the extracted word-for-word, its definition of 'in' will apply, or if its data has been paraphrased or restated from the current text, that's why we can say that this concept derivatively classifies the statement in new documents.
Answer:
Given that:
A= 40n^2
B = 2n^3
By given scenario:
40n^2=2n^3
dividing both sides by 2
20n^2=n^3
dividing both sides by n^2 we get
20 = n
Now putting n=20 in algorithms A and B:
A=40n^2
= 40 (20)^2
= 40 * (400)
A= 16000
B= 2n^3
= 2 (20)^3
= 2(8000)
B= 16000
Now as A and B got same on n = 20, then as given:
n0 <20 for n =20
Let us take n0 = 19, it will prove A is better than B.
We can also match the respective graphs of algorithms of A and B to see which one leads and which one lags, before they cross at n= 20.
