If p is any positive number between 0 and 1, then p4 + C(4,3) p3(1–p) + C(4,2) p2(1–p)2 + C(4,1) p (1–p)3 + (1–p)4 = 1. Explain why without performing any calculation.
Please explain the concept behind this to me, and not just the chain of calculations or mathematical proofs.
In: Math
Problem 7-19A Determination of account balances and preparation of journal entries-percent of receivables allowance method of accounting for uncollectible accounts LO 7-2
The following information is available for Quality Book Sales’
sales on account and accounts receivable:
| Accounts receivable balance, January 1, Year 2 | $ | 80,100 | ||
| Allowance for doubtful accounts, January 1, Year 2 | 5,030 | |||
| Sales on account, Year 2 | 566,000 | |||
| Collection on accounts receivable, Year 2 | 572,000 | |||
After several collection attempts, Quality Book Sales wrote off
$3,050 of accounts that could not be collected. Quality Book Sales
estimates that 4 percent of the ending accounts receivable balance
will be uncollectible.
Required
a. Compute the following amounts:
amount of uncollectible accounts
net realizable value
b. Record the general journal entries to:
In: Accounting
In order to use a 90% confidence interval to compare admission exam scores for sophomores (group #1) and freshmen (group #2), two independent random samples were selected. The results showed:
1-Sophomores: Sample mean = 85, sample standard deviation = 10, sample size = 50.
2-Freshmen: Sample mean = 78, sample standard deviation = 12, sample size = 72.
For forming a 90% confidence interval for μ 1 − μ 2, the standard error is __________ .
Group of answer choices
12
2
None of the other choices represent a suitable response.
10
4
In: Statistics and Probability
Consider a monopolist which produces two different products, each having the following demand functions: q1 = 14-1/4 p1; q2 = 24-1/2 p2; where q1 and q2 represent the output levels of product 1 and product 2 and p1 and p2 represent their prices. The monopolistís joint cost function is given as C (q1; q2) = q1^2 + 5q1q2 + q2^2 :
(a) Write out the monopolist's profit function.
(b) Show the Hessian, H; for this problem. What does the second-order condition require for this problem? Show if it is satisfied
In: Economics
10.36 Management of Blossom Automotive, a manufacturer of auto
parts, is considering investing in two projects. The company
typically compares project returns to a cost of funds of 17.00
percent.
| Year | Project 1 | Project 2 | ||||
| 0 | - $508,224 | - $548,471 | ||||
| 1 | 316,000 | 127,750 | ||||
| 2 | 100,000 | 181,170 | ||||
| 3 | 124,500 | 265,700 | ||||
| 4 | 144,000 | 296,050 | ||||
Compute the IRRs based on the cash flows. Which project(s) will be
accepted? (Round final answer to 2 decimal places, e.g.
15.25%.)
| The IRR of project 1 is % and
the project should be
rejectedaccepted . |
| The IRR of project 2 is % and
the project should be
rejectedaccepted . |
In: Finance
What is the reaction A(g) + B(g) + C(g)------------> D(g) Experiment Initial [A] (mol/L) Initial [B] (mol/L) Initial [C] (mol/L) Initial rate (M/s) 1 0.0500 0.0500 0.0100 6.25*^(-3) 2 0.1000 0.0500 0.0100 1.25*^(-2) 3 0.1000 0.1000 0.0100 5*10^(-2) 4 0.0500 0.0500 0.0200 6.25*10^(-3)
1) What is the order with respect to each reactant?
2) Write the rate law
3) Calculate K (using the data from experiment 1)
In: Chemistry
Lab # 4 Multidimensional Arrays
Please write in JAVA.
Programming Exercise 8.5 (Algebra: add two matrices)
Write a method to add two matrices. The header of the method is as follows:
public static double[][] addMatrix(double[][] a, double[][] b
In order to be added, the two matrices must have the same dimensions and the same or compatible types of elements. Let c be the resulting matrix. Each element cij is aij + bij. For example, for two 3 * 3 matrices a and b, c is
Write a test program that prompts the user to enter two 3 * 3 matrices and displays their sum. Here is a sample run
Example run:
Enter matrix1: 1 2 3 4 5 6 7 8 9 (enter)
Enter martix2: 0 2 4 1 4.5 2.2 1.1 4.3 5.2 (enter)
The matrices are added as follows:
1.0 2.0 3.0 0.0 2.0 4.0 1.0 4.0 7.0
4.0 5.0 6.0 + 1.0 4.5 2.2 = 5.0 9.5 8.2
7.0 8.0 9.0 1.1 4.3 5.2 8.1 12.3 14.2
Programming Exercise 8.6 (Algebra: multiply two matrices)
Write a method to multiply two matrices. The header of the method is:
public static double[][] multiplyMatrix(double[][] a, double[][] b)
To multiply matrix a by matrix b, the number of columns in a must be the same as the number of rows in b, and the two matrices must have elements of the same or compatible types. Let c be the result of the multiplication. Assume the column size of matrix a is n. Each element cij is ai1 * b1j + ai2 * b2j + c + ain * bnj. For example, for two 3 * 3 matrices a and b, c is
where cij = ai1 * b1j + ai2 * b2j + ai3 * b3j. Write a test program that prompts the user to enter two 3 * 3 matrices and displays their product. Here is a sample run:
Example run:
Enter matrix1: 1 2 3 4 5 6 7 8 9 (enter)
Enter matrix2: 0 2 4 1 4.5 2.2 1.1 4.3 5.2 (enter)
The multiplication of the matrices is
1 2 3 0 2.0 4.0 5.3 23.9 24
4 5 6 * 1 4.5 2.2 = 11.6 56.3 58.2
7 8 9 1.1 4.3 5.2 17.9 88.7 92.4
In: Computer Science
Inversion Count for an array indicates – how far (or close) the
array is from being sorted. If array is already sorted then
inversion count is 0. If array is sorted in reverse order that
inversion count is maximum.
Formally speaking, two elements a[i] and a[j] form an inversion if
a[i] > a[j] and i < j
Example:
The sequence 2, 4, 1, 3, 5 has three inversions (2, 1), (4, 1), (4,
3).
What would the complexity of a brute force approach be? Code an O(nlog(n)) algorithm to count the number of inversions. Hint - piggy back on the merging step of the mergesort algorithm.
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Complete the code in the functions indicated to count inversions
// countlnv.cpp file
#include <iostream>
#include <vector>
using namespace std;
int numinv;
void mergeSort(vector<int>& numvec, int left, int
right);
int merge(vector<int>& numvec , int left, int mid, int
right);
int countInv(vector<int>& numvec) {
numinv = 0;
mergeSort(numvec, 0, numvec.size());
cout << "Sorted output: ";
for (auto ele : numvec)
cout << ele << " ";
cout << endl;
return numinv;
}
//Sorts the input vector and returns the number of inversions in
that vector
void mergeSort(vector<int>& numvec, int left, int
right){
// Your code here
}
int merge(vector<int>& numvec , int left, int mid, int
right){
// Your code here
}
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Use the following test code to evaluate your implementation
// countlnv_test.cpp
/* Count the number of inversions in O(n log n) time */
#include <iostream>
#include <vector>
using namespace std;
int countInv(vector<int>& numvec);
int main()
{
int n;
vector<int> numvec{4, 5, 6, 1, 2, 3};
n = countInv(numvec);
cout << "Number of inversions " << n << endl; //
Should be 9
numvec = {1, 2, 3, 4, 5, 6};
n = countInv(numvec);
cout << "Number of inversions " << n << endl; //
Should be 0
numvec = {6, 5, 4, 3, 2, 1};
n = countInv(numvec);
cout << "Number of inversions " << n << endl; //
Should be 15
numvec = {0, 0, 0, 0, 0, 0};
n = countInv(numvec);
cout << "Number of inversions " << n << endl;; //
Should be 0
}
---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Thank you for your time and help!
In: Computer Science
|
Sales of People magazine are compared over a 5-week period at four Borders outlets in Chicago. |
| Weekly Sales | |||
| Store 1 | Store 2 | Store 3 | Store 4 |
| 103 | 95 | 87 | 100 |
| 105 | 73 | 89 | 117 |
| 106 | 79 | 74 | 88 |
| 115 | 78 | 106 | 101 |
| 114 | 99 | 94 | 100 |
|
Fill in the missing data. (Round your p-value to 4 decimal places, mean values to 1 decimal place, and other answers to 3 decimal places.) |
| Treatment | Mean | n | Std. Dev |
| Store 1 | |||
| Store 2 | |||
| Store 3 | |||
| Store 4 | |||
| One-Factor ANOVA | |||||
| Source | SS | df | MS | F | p-value |
| Treatment | |||||
| Error | |||||
| Total | |||||
| (a) | You will need to run the One-Way ANOVA to test the following hypotheses: |
| H0: μ1 = μ2 = μ3 = μ4 | |
| H1: Not all the means are equal | |
| α = 0.05 | |
| |
| (b) | Determine the value of F. (Round your answer to 2 decimal places.) |
| F-value |
(c)Determine the p-value. (Round your answer to 4 decimal places.)
p-value
| (d) |
On the basis of the above-determined values, choose the correct decision from below. |
||||
|
In: Statistics and Probability
Question: Conversion Program
* This program will ask the user to input meters
* After input, a menu will be displayed:
* 1. Convert to kilometers
* 2. Convert to inches
* 3. Convert to feet
* 4. Quit
* * The user will select the conversion and the converted answer will be displayed.
* The program should redisplay the menu for another selection.
* Quit program when user selects 4.
Hi, my instructor requirement fix the bug in the code and run the code. I try to do some code but still not running thats are below. Please someone is expert review and fix my problem..
public class MetersConversion {
public static void main(String[] args) {
// Initialize variables
int selection;
double meters;
double kilo;
double inch;
double feet;
// Input the distance in Meters to be Converted
Scanner input = new Scanner(System.in);
System.out.print("Enter distance in meters: " + meters);
selection = input.nextInt();
meters = input.nextDouble();
while (selection); {
System.out.print("1. Convert to kilometers");
System.out.print("2. Convert to inches");
System.out.print("3. Convert to feet");
System.out.print("4. Quit the program\n\n");
if(selection == 1){
kilo = meters * 0.001;
}
else if(selection == 2){
inch = meters * 36.37;
}
else if(selection == 3){
feet = meters * 3.201;
}
else if(selConv == 4){
System.out.println("Bye!");
}
}
}
}
In: Computer Science