Answer:
Step-by-step explanation:
We can get this done by using the code
def digits(n):
count = 0
if n == 0:
return 1
while (n > 0):
count += 1
n= n//10
return count
Also, another way of putting it is by saying
def digits(n):
return len(str(n))
------------------------------------------
print(digits(25)) # Should print 2
print(digits(144)) # Should print 3
print(digits(1000)) # Should print 4
print(digits(0)) # Should print 1
Doing this way, we've told the system to count the number of figures that exist in the number. If it's 1000 to 9999, then it records it as 4 digits. If it's 100 - 999, then it records it as 3 digits. If it's 10 - 99, it records as 2 digits. If it's 0 - 9, then it has to record it as a single digit.
Thanks
Answer: A & C
<u>Step-by-step explanation:</u>
HL is Hypotenuse-Leg
A) the hypotenuse from ΔABC ≡ the hypotenuse from ΔFGH
a leg from ΔABC ≡ a leg from ΔFGH
Therefore HL Congruency Theorem can be used to prove ΔABC ≡ ΔFGH
B) a leg from ΔABC ≡ a leg from ΔFGH
the other leg from ΔABC ≡ the other leg from ΔFGH
Therefore LL (not HL) Congruency Theorem can be used.
C) the hypotenuse from ΔABC ≡ the hypotenuse from ΔFGH
at least one leg from ΔABC ≡ at least one leg from ΔFGH
Therefore HL Congruency Theorem can be used to prove ΔABC ≡ ΔFGH
D) an angle from ΔABC ≡ an angle from ΔFGH
the other angle from ΔABC ≡ the other angle from ΔFGH
AA cannot be used for congruence.
Answer:
120 6th graders
Step-by-step explanation:
You need to set up a proportion...
2/3= x/180
360=3x
x=120
False.
Replace x with 0 and solve:
2(0) + 3 = 0+ 3 = 3
3 is not greater than 13 so the answer is false.
Step-by-step explanation:
We need to find an expression for 
.
We can solve it as follows.
We know that,
So,
or
Hence, this is the required solution.
