The factorial ! just means we multiply by every natural number less that the value so
6! =6×5×4×3×2×1= 720
for permutations we use the formula n!/(n-r)!
so we have 8!/(8-5)!=8!/3!=8×7×6×5×4
for combinations s we have n!/(n-r)!r!
so we have 12!/(12-4)!4!=12!/8!4!=12×11×10×9/4×3×2=11×10×9/2=99×5
5,6
55,56
65,66
555,556,565,566
655,656.665.666
Looks like there are 14 numbers that use only the digits 5 or 6 or both 5 or 6 that are under 1000.
Answer:
1,712,304 ways
Step-by-step explanation:
This problem bothers on combination
Since we are to select 5 subjects from a pool of 48 subjects, the number of ways this can be done is expressed as;
48C5 = 48!/(48-5)!5!
48C5 = 48!/43!5!
48C5 = 48×47×46×45×44×43!/43!5!
48C5 = 48×47×46×45×44/5!
48C5 = 205,476,480/120
48C5 = 1,712,304
Hence this can be done in 1,712,304ways
Answer:
C. f(5) = 13 and f(-3) = -3
General Formulas and Concepts:
<u>Pre-Algebra</u>
- Order of Operations: BPEMDAS
Step-by-step explanation:
<u>Step 1: Define</u>
f(x) = 2x + 3
x = 5
x = -3
<u>Step 2: Evaluate</u>
x = 5
- Substitute: f(5) = 2(5) + 3
- Multiply: f(5) = 10 + 3
- Add: f(5) = 13
x = -3
- Substitute: f(-3) = 2(-3) + 3
- Multiply: f(-3) = -6 + 3
- Add: f(-3) = -3
