Answer:
Step-by-step explanation:
Answer:
She uses 243 beads for the 5th string.
Step-by-step explanation:
In this problem, we can see a pattern. If she triples the number of beads in each of the next strings, that means that we just take the last number and multiply by 3. If the first string uses 3, then:
The second uses 9, 3 * 3 = 9
The third uses 27, 9 * 3 = 27
The fourth uses 81, 27 * 3 = 81
And the 5th uses 243, 81 * 3 = 243.
Answer:
80%
Step-by-step explanation:
The correct answer is C: 1/(x + 4)(x - 5)
Why? Well, let's first simplify x^2 - 3x - 10 and x^2 + x - 12; the two denominators. Each of these should become an (x +/- number), and to figure out the number, as well as whether it is positive or negative, we can do a simple trick
Look at the factors of the right number (In this case, -10 and -12)
-10 -12
1 * -10 1 * -12
-1 * 10 -1 * 12
-2 * 5 -2 * 6
2 * -5 2 * -6
-3 * 4
4 * -3
Now for part 2
Which of these pairs add up to the middle number? One of the pairs of -10 should make -3, and likewise, one of the pairs of -12 should make 1 (when x has no number in front of it you may safely assume it is 1).
2 - 5 = -3 and 4 - 3 = 1, so we now know that the 2 fraction equations simplified is
x + 2 / (x + 2)(x - 5) * x - 3/(x -3)(x + 4)
Notice anything repeating? As long as they are apart of the same fraction, we can cross out anything that has the same x - number. Crossing out both x + 2 and x - 3, we now simply have x - 5 * x + 4. Because we crossed out both numerators, the top numbers both become 1, thus giving our answer, C.
Answer:
![[4,0,3,1,2,5]](https://tex.z-dn.net/?f=%5B4%2C0%2C3%2C1%2C2%2C5%5D)
and ![[6,9,8,7]](https://tex.z-dn.net/?f=%5B6%2C9%2C8%2C7%5D)
Step-by-step explanation:
GIVEN: an array of ten integers 
.
TO FIND: If we partition this array using Quick sort's partition function and using 
for the pivot. List the elements of the resulting array after the partition finishes.
SOLUTION:
quick sort is a divide and conquer algorithm in which an array is partitioned into sub-arrays about an pivot element by checking whether elements are greater than pivot or and then sub arrays are sorted recursively.
Here is the pivot element.
two arrays will be created, in first array element less than or equal to pivot element are stored in other elements greater than pivot element are stored.
Starting from first element of array
elements in first array will be ![=[4,0,3,1,2,5]](https://tex.z-dn.net/?f=%3D%5B4%2C0%2C3%2C1%2C2%2C5%5D)
elements in second array will be ![=[6,9,8,7]](https://tex.z-dn.net/?f=%3D%5B6%2C9%2C8%2C7%5D)
Hence the resulting array after the partition finishes are and
