Recall that a partition of a positive integer $n$ means a way of writing $n$ as the sum of some positive integers, where the order of the parts does not matter. For example, there are five partitions of $4$: $$4\qquad 3 1\qquad 2 2\qquad 2 1 1\qquad 1 1 1 1$$ How many partitions of $12$ are there that have at least four parts, such that the largest, second-largest, third-largest, and fourth-largest parts are respectively greater than or equal to $4,3,2,1$

the answer i think is a)

step-by-step explanation:

if gloria has "carry over" minutes, (that is, any minutes paid for but not used in a month can be applied to her payment for minutes in the next month,) her total usage for the three months is: total minutes = 320 + 243 + 489 = 1052 minutes number of 200 minute blocks = 1052/200 = 5 r52 (that is 5 with a remainder of 52) rounding up the number of 200 minute blocks gives her usage for the three months as 6 blocks. the cost for six blocks is 6 x $25 = $150 she also has 200 - 52 or 148 carry over minutes if gloria pays each month and unused minutes are lost, applying the rounding up procedure to each month gives: first month usage of 320 minutes rounds up to 2 blocks of 200 minutes for a payment of 2 x $25 = $50 second month usage of 243 minutes rounds up to 2 blocks of 200 minutes for a payment of 2 x $25 = $50 third month usage of 489 minutes rounds up to 3 blocks of 200 minutes for a payment of 3 x $25 = $75 total payments for the three months are $50 + $50 + $75 = $175 get the plan with carry over minutes!

1. 16.64

a^2+b^2=c^2

pr^2=pq^2+qr^2

pr^2=14^2+ 9^2

pr^2=196+81

pr= sqr root of 277

16.64

2. 11.31

c^2-a^2=b^2

18^2- 14^2=b^2

b^2=324-196

b=sqr root of 126

b=11.31

hope it ! (btw im in connections academy to, good luck! )