Based on the given description above, the planet that is being described would be planet EARTH. It is the only planet where humans can walk without the aid of a space suit, and the only planet that can provide humans the necessary oxygen to survive. Hope this answers that question.
Answer:
A or B would work.
If the developer tell you how to, which depends on what you ask then A would work
But Following links could give several smaller bits of info and resources required which makes B able to work
Answer:
False
Explanation:
The scheme where you can find the greatest common divisor (GCD) of two integers by repetitive application of the division algorithm is known as Euclidean Algorithm.
The Euclidean Algorithm for calculating GCD of two numbers X and Y can be given as follows:
- If X=0 then GCD(X, Y)=Y since the Greatest Common Divisor of 0 and Y is Y.
- If Y=0 then GCD(X, Y)=X since the Greates Common Divisor of 0 and X is X.
- Let R be the remainder of dividing X by Y assuming X > Y. (R = X % Y)
- Find GCD( Y, R ) because GCD( X, Y ) = GCD(Y, R ).
- Repeat the above steps again till R = 0.
