Twenty-one thousand and sixty-three divided by three is 7021
First, take any number (for this example it will be 492) and add together each digit in the number (4+9+2 = 15). Then take that sum (15) and determine if it is divisible by 3. The original number is divisible by 3 (or 9) if and only if the sum of its digits is divisible by 3 (or 9).If a number is a multiplication of 3 consecutive numbers then that number is always divisible by 3. This is useful for when the number takes the form of (n * (n - 1)*(n + 1))Example: 492 (The original number). 4 + 9 + 2 = 15 (Add each individual digit together). 15 is divisible by 3 at which point we can stop. Alternatively we can continue using the same method if the number is still too large: 1 + 5 = 6 (Add each individual digit together). 6 ÷ 3 = 2 (Check to see if the number received is divisible by 3). 492 ÷ 3 = 164 (If the number obtained by using the rule is divisible by 3, then the whole number is divisible by 3)
Answer:
Original claim is 
Opposite claim is 
Null and alternative hypotheses:
Significance level: 0.01
Test statistic:
We can use TI-84 calculator to find the test statistic and P-value. The steps are as follows:
Press STAT and the scroll right to TESTS
Scroll down to 2-SampTTest... and scroll to stats.
Enter below information.
Pooled: Yes
Calculate.
The output is in the attachment.
Therefore, the test statistic is:
P-value: 0.4412
Reject or fail to reject: Fail to reject
Final Conclusion: Since the p-value is greater than the significance level, we, therefore, fail to reject the null hypothesis and conclude that the there is sufficient evidence to support the claim that the samples are from populations with the same mean.
Answer:
Step-by-step explanation:
1. ok so you need to use Pythagoras which is a^2 + b^2 = c^2
substituting 16 and 12 into 'a' and 'b' you get 16^2 + 12^2 = c^2
256 + 144 = c^2
400 = c^2 (square root each side to get ride of the square)
c = 20cm
2. doing the same thing you get c = 22.36 in
3. again doing it you get c = 15Ft
Hope this helps!
