Question

In: Accounting

delete

delete

Solutions

Expert Solution

Equity method income accrual for 2018
      25% of $589,000 for ½ year $             73,625
      21% of $589,000 for ½ year $             61,845
Total income accrual $           135,470
Gain on sale (Refer Below) $           118,680
Total income statement effect–2018 $           254,150
Gain on sale of 13,800 shares of Halstead
Initial acquisition- 2016 $        1,510,000
25% income accrual- 2016: (25% × $362,000) $             90,500
Dividend - 2016 (25%*137,000) $           (34,250)
25% income accrual- 2017: (25% × $505,000) $           126,250
Dividend - 2017 (25%*134,000) $           (33,500)
25% income accrual for ½ year- 2018 $             73,625
(25%*589000/2)
25% of dividends for ½ year- 2018 $           (20,625)
(25%*165000/2)
Book value of 80,000 shares on July 1, 2018 $        1,712,000
Cash proceeds from the sale of 13,800 shares $           414,000
(13,800*30)
Less: Book value of shares sold $           295,320
          ($1,712,000*(13,800 ÷ 80,000))
Gain on Sale $           118,680

Related Solutions

delete this
delete this
Delete
Delete
delete
delete
unix Delete the second character from every line in a file Delete the last word from...
unix Delete the second character from every line in a file Delete the last word from every line in a file. Swap the first and second letter of every line in a file. Swap the first and last characters of every line in a file.
The programming language is Python Instructions: Create a function that will delete a node in a...
The programming language is Python Instructions: Create a function that will delete a node in a Linked List based on position number. On below example, if you want to delete position #2, it will remove the Banana (arrangement of nodes below is Apple, Banana, Cherry, Grapes, Orange). myLinkedList = LinkedList() myLinkedList.append("Banana") myLinkedList.append("Cherry") myLinkedList.append("Grapes") myLinkedList.append("Orange") myLinkedList.prepend("Apple") myLinkedList.deleteByPositionNum(2) node = myLinkedList.head while node: print(node.value, " ") node = node.next_node You may start with the function head: def deleteByPositionNum(self, positionNum):
Delete an item from a circular queue and return the index of the next item. (in...
Delete an item from a circular queue and return the index of the next item. (in Java)
Data Manipulation In this lab, you will be manipulating the database to add, delete and modify...
Data Manipulation In this lab, you will be manipulating the database to add, delete and modify the values in the database. Please use a "select * from..." after each query to show the effects of your data manipulation query. 1. The title 'Time Flies' now has a new track, the 11th track 'Spring', which is 150 seconds long and has only a MP3 file. Insert the new track into Tracks table (Don’t hand-code any data for insert that can be...
What are the UNIX commands for each of these steps? 1. Delete all the files in...
What are the UNIX commands for each of these steps? 1. Delete all the files in the Classes and Backup directories only. 2. Redirect echo step 23 to mark this step in the lab3.txt file 3. Display all of the directories and sub-directories including files so I can verify you completed all the steps correctly. 4. Repeat the above step and redirect the output to the file lab3.txt without erasing what is already in it! 5. Redirect echo step 26...
IN JAVA: Delete an item from a circular queue and return the index of the next...
IN JAVA: Delete an item from a circular queue and return the index of the next item
Java Language Add a method (deleteGreater ()) to the LinkedList class to delete the node with...
Java Language Add a method (deleteGreater ()) to the LinkedList class to delete the node with the higher value data. Code: class Node { int value; Node nextNode; Node(int v, Node n) { value = v; nextNode = n; } Node (int v) { this(v,null); } } class LinkedList { Node head; //head = null; LinkedList() { } int length() { Node tempPtr; int result = 0; tempPtr = head; while (tempPtr != null) { tempPtr = tempPtr.nextNode; result =...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT