&n

Williams Roberts

Cash 160,000 50,000

Inventory 550,000 160,000

Equipment 1,500,000 670,000

Totals 2,210,000 880,000

Totals Liabilities 740,000 280,000

c/s $20 par 600,000 300,000

other contr cap 375,000 105,000

retained earnings 495,000 195,000

totals 2,210,000 880,000

inventory has a FMV of 170,000 for Roberts and the equipment has a FMV of 715,000. The book value and FMV of liabilities are the same. Assuming Williams wishes to acquire Roberts for cash in an asset acquisition, determine the following cutoff amounts:

Purchase price above which Williams would record goodwill?
Purchase price which Williams would record a 60,000 gain?
Purchase price below which Williams would obtain a bargain?
Purchase price which Williams would record 85,000 of goodwill?

Expert Solution

ROBERTS ASSETS NET MARKET VALUE:
	AMOUNT
Assets:
Cash	50000
Inv.	170000
Equip	715000
Less:Liabilities	-280000
Net Assets Market Value	655000

Req 1) Purchse price above which Williams would record goodwill = B/V of assets - Liabilities = 880000-280000= 600000

Req 2) Purchse price which Williams would record a 60000 gain = (B/V of assets - Liabilities)-60000 = 880000-280000-60000= 540000

Req 3) Purchse price below which Williams would obtain a bargain = Net Assets Market Value = 655000

Req 4) Purchse price which Williams would record 85000 of goodwill = (B/V of assets - Liabilities) + 85000= 880000-280000 + 85000= 685000

ekkarill92 answered 10 months ago

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) + nlog(n) is O(nlog(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))

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)

find zero state response y[n+4]-y[n]=x[n], if x[n]= e^-n u[n]

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.

def annoying_factorial(n): if n == 0 or n == 1: return 1 if n == 2:...

def annoying_factorial(n): if n == 0 or n == 1: return 1 if n == 2: return 2 if n == 3: return 6 if n == 4: return 4 * annoying_factorial(3) if n == 5: return 5 * annoying_factorial(4) if n == 6: return 6 * annoying_factorial(5) else: return n * annoying_factorial(n-1) def annoying_fibonacci(n): if n==0: return 0 if n==1: return 1 if n==2: return 1 if n==3: return 2 if n==4: return annoying_fibonacci(4-1)+annoying_fibonacci(4-2) if n==5: return annoying_fibonacci(5-1)+annoying_fibonacci(5-2) if...

Prove via induction the following properties of Pascal’s Triangle: •P(n,2)=(n(n-1))/2 • P(n+m+1,n) = P(n+m,n)+P(n+m−1,n−1)+P(n+m−2,n−2)+···+P(m,0) for all...

Prove via induction the following properties of Pascal’s Triangle: •P(n,2)=(n(n-1))/2 • P(n+m+1,n) = P(n+m,n)+P(n+m−1,n−1)+P(n+m−2,n−2)+···+P(m,0) for all m ≥ 0

Question

&n

Solutions