Answer: i dont know but have an great day
Explanation:
Answer:
Assuming that's in python, the answer would be 4
Explanation:
The ** operator is for raising a number to a power.
The // operator returns the number of times the right number can fit into the left (i.e round division).
So the answer would be three squared over two rounded down, or 4.
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.
Answer:
legal and ethical questions
brick and mortar guidelines
website content
customer information
the facts of life
payment processing
human resources
this is in career explorations 2 please help will mark the brainiest
Explanation: yes he is right this is correct
