C) 180 − (140 − 7a) = (70 − 3a)
Answer:
C) 180 − (140 − 7a) = (70 − 3a)
Explanation:
i got it wrong by clicking D on usatestprep
The correct answer is 1: B new tech and 2:C we can tell by the way businesses are incorporating things like social media like how Wendys got more popular because of their sassy tweets
Answer:
Shows the programming checking if num1 is greater than num2
Explanation:
So num1 and num2 are inputs
for you to code this you would need to put
num1=int(input("What is your first number? ))
and the same for num2 except change num1 for num 2 and first for second
When the input is completed, the computer will check if num 1 is greater than num2
it will do this by using a code something like:
if num1>num2:
Print("Your first input was greater than your second")
But in this example if it greater it just ends
But if it was less than you would put
if num1>num2:
Print("Your first input was greater than your second")
elif num1<num2:
Print("Your first input is less than your second")
So basically this code shows the computer checking if one number is greater than the other or not
Answer:
Flowchart of an algorithm (Euclid's algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≥ A yields "yes" or "true" (more accurately, the number b in location B is greater than or equal to the number a in location A) THEN, the algorithm specifies B ← B − A (meaning the number b − a replaces the old b). Similarly, IF A > B, THEN A ← A − B. The process terminates when (the contents of) B is 0, yielding the g.c.d. in A. (Algorithm derived from Scott 2009:13; symbols and drawing style from Tausworthe 1977).
Explanation:
Flowchart of an algorithm (Euclid's algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≥ A yields "yes" or "true" (more accurately, the number b in location B is greater than or equal to the number a in location A) THEN, the algorithm specifies B ← B − A (meaning the number b − a replaces the old b). Similarly, IF A > B, THEN A ← A − B. The process terminates when (the contents of) B is 0, yielding the g.c.d. in A. (Algorithm derived from Scott 2009:13; symbols and drawing style from Tausworthe 1977).
