Answer:
Step-by-step explanation:
Given sequence :
To find the first term, we need to put n=1 in the above sequence , we get
To find the fourth term, we need to put n=4, we get
To find the eighth term, we need to put n=8, we get
Answer:
Step-by-step explanation:
Given :
To find :
Solution:
Put n=1,
Put n=4,
Put n=8,
Answer:
Step-by-step explanation:
Given that the weights for a population of North American raccoons have a bell-shaped frequency curve with a mean of about 12 pounds and a standard deviation of about 2.5 pounds
Since bell shaped is given we can assume that this follows a normal distribution symmetrical about the mean.
To find 95% two values we can use Z critical value for 95%
i.e. ±1.96
95% will lie between 12±1.96(2.5)
= 12±4.9
=(7.1, 16.9)
C. 200c
D. 200+c
The sum of the first 39 positive odd numbers is 1521.
To find the sum of the first 39 positive odd numbers, we can use the formula for the sum of an arithmetic series. The formula is: S = (n/2)(a + l), where S is the sum, n is the number of terms, a is the first term, and l is the last term. In this case, n = 39, a = 1, and l = 77. Plugging these values into the formula, we get:
Therefore, the sum of the first 39 positive odd numbers is 1521.
#SPJ2
Answer:
If x is an integer, then for values of x ≤ 0 would -x be positive.
General Formulas and Concepts:
Math
Step-by-step explanation:
We know that integers comprise of the number line from -∞ to ∞. We can have numbers like -3, -2, -1, 0, 1, 2 ,3.
If we say that x is an integer, and that -x must be positive, then that means the integer x must be negative, because a negative times a negative is a positive.
∴ x can only be negative integers, thus giving us x ≤ 0.
In 26*51! ways we can pick 50 cards from a deck of 52 cards using permutation.
Permutation is mathematical technique to get possibiltiy in arrangement with replacement.
We can choose or pick r objects from n objects using permutation in ways.
n! = n*(m-1)*......*3*2*1
We can write n! = n(n-1)!
Total number of matters or cards = 52
We have to pick 50 cards using permutation or replacement.
The required number of ways
Hence we can choose 50 cards from deck of 52 cards in 6*51! ways.
Learn more about Permutation here -
#SPJ2
Answer:
Edge answer is B) 114 shares
Step-by-step explanation:
I gotchu homies