Question

In: Economics

                                           &n

                                                                      State and Local Government Expenditures

The city of San Alameda provides free health care services for the medically indigent (poor and uninsured). Suppose the city has $2 million to spend on these services and private goods. One unit of health care services (e.g. a physician office visit) costs $110. Thus, the budget equation for San Alameda for these two types of goods is:

$2 Million = $P + $110H,

where H is the units of indigent health care services provided, and P is total expenditure on private goods (P is measured in dollars because we assume each unit of P costs $1).

1. If the San Alameda spends equal amounts on indigent health care services and the private good, how many units of health care services are purchased by the city?

2. Suppose the city of San Alameda receives a 40-percent matching grant from the state for spending on indigent health services. Specifically, the state spends $0.40 on indigent health care services for every $1 spent by the city on these services.

2a) If, after receiving the grant, San Alameda spends $1 million on the private good, how many units of indigent health care services are purchased? (Round to nearest whole number)

2b) Under matching grant, how much of total indigent health care expenditures is paid by the state?

2c) What is the effective price of health care services for the city of San Alameda under the matching grant? (Enter a formula to calculate the effective price.. show work)

3. Suppose, instead of a matching grant, the state provided the city of San Alameda a block grant equal to what the state would have spent with the matching grant (2b. above). Suppose, also, San Alameda uses its budget plus the block grant to spend equal amounts on indigent health care services and the private good.

3a) How many units of indigent health care services are purchased by San Alameda?

4. Using relevant economic concepts, explain why a matching grant generally leads to more consumption of a public good than an unrestricted block grant.

Solutions

Expert Solution

1. total budget 2000000
spend on indigent (half of budget) 1000000
cost per visit 110
number of visits (spend / cost per visit) 9091
2a. Spend on indigent healthcare by the city 1000000
additional money from state (grant 40%) 400000
total money available for indigent healthcare 1400000
cost per visit 110
number of visits (total money for spend / cost per visit) 12727
2b. Amount of money paid by the state 400000
2c. Effective price per visit incurred by the city 78.57143
price per visit / (1+40%, where 40% represents the contribution from state)
3a. Total money available to the city 2400000
its own budget + grant by the state as per 2b
spend on indigent (half of budget) 1200000
cost per visit 110
number of visits (spend / cost per visit) 10909
4. matching grants work more effectively than an unrestricted block grant
since a matching grant is available only when the recipient (city in this case)
spends its own money first on the public good or service in question. This
creates demand for such public good. If, on the other hand, the grant is
unrestricted the recipient would like to spend the money in any manner it likes
this could lead to the money being spent on things (goods or services) other than
the public good in question

Related Solutions

RecursiveFunction(n) // n is an integer { if (n > 0){ PrintOut(n % 2); RecursiveFunction(n /...
RecursiveFunction(n) // n is an integer { if (n > 0){ PrintOut(n % 2); RecursiveFunction(n / 3); PrintOut(n % 3); } } What is the output of this RecursiveFunction Pseudocode algorithm if it is initially called with 10 for n? Explain how you arrived at that answer; by writing call stack for the execution of his function at each step. What is the Big O running time of the RecursiveFunction described above? Explain your answer.
Which codes add 1 to integer n? 1) n=n+1; 2) n++; 3)++n; 4) n+=1; 5) n=--n+2
Which codes add 1 to integer n? 1) n=n+1; 2) n++; 3)++n; 4) n+=1; 5) n=--n+2
Let f : N → N and g : N → N be the functions defined...
Let f : N → N and g : N → N be the functions defined as ∀k ∈ N f(k) = 2k and g(k) = (k/2 if k is even, (k + 1) /2 if k is odd). (1) Are the functions f and g injective? surjective? bijective? Justify your answers. (2) Give the expressions of the functions g ◦ f and f ◦ g? (3) Are the functions g ◦ f and f ◦ g injective? surjective? bijective?...
Show for the following recurrence that T(n) = T(n/3) + n*log(n) is O(n*log(n)) (not using the...
Show for the following recurrence that T(n) = T(n/3) + n*log(n) is O(n*log(n)) (not using the Master theorem please)
If f(n) = 3n+2 and g(n) = n, then Prove that f(n) = O (g(n))
If f(n) = 3n+2 and g(n) = n, then Prove that f(n) = O (g(n))
Suppose f : N→N satisestherecurrencerelation f(n + 1) (f(n) 2 if f(n)iseven 3f(n)+ 1 if f(n)isodd...
Suppose f : N→N satisestherecurrencerelation f(n + 1) (f(n) 2 if f(n)iseven 3f(n)+ 1 if f(n)isodd . Notethatwiththeinitialcondition f(0) 1,thevaluesofthefunction are: f(1) 4, f(2) 2, f(3) 1, f(4) 4, and so on, the images cyclingthroughthosethreenumbers. Thus f isNOTinjective(andalso certainlynotsurjective). Mightitbeunderotherinitialconditions?3 (a) If f satisestheinitialcondition f(0) 5,is f injective? Explain whyorgiveaspecicexampleoftwoelementsfromthedomain withthesameimage. (b) If f satisestheinitialcondition f(0) 3,is f injective? Explain whyorgiveaspecicexampleoftwoelementsfromthedomain withthesameimage. (c) If f satisestheinitialcondition f(0) 27,thenitturnsoutthat f(105) 10 and no two numbers less than 105 have the same...
convergent or divergent infinity sigma n = 1 sqrt(n^5+ n^3 -7) / (n^3-n^2+n)
convergent or divergent infinity sigma n = 1 sqrt(n^5+ n^3 -7) / (n^3-n^2+n)
find zero state response y[n+4]-y[n]=x[n], if x[n]= e^-n u[n]
find zero state response y[n+4]-y[n]=x[n], if x[n]= e^-n u[n]
a) write a program to compute and print n, n(f), f(f(n)), f(f(f(n))).........for 1<=n<=100, where f(n)=n/2 if...
a) write a program to compute and print n, n(f), f(f(n)), f(f(f(n))).........for 1<=n<=100, where f(n)=n/2 if n is even and f(n)=3n+1 if n is odd b) make a conjecture based on part a. use java
Find the smallest n ∈ N such that 2(n + 5)^2 < n^3 and call it...
Find the smallest n ∈ N such that 2(n + 5)^2 < n^3 and call it n^0,Show that 2(n + 5)^2 < n^3 for all n ≥ n^0.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT