1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
charle [14.2K]
3 years ago
7

What is the cube root of 2197

Mathematics
2 answers:
ziro4ka [17]3 years ago
5 0
The cube root of 2197 is 13
kifflom [539]3 years ago
3 0
13. I hope this helped. :) Brainliest answer please. :)
You might be interested in
Which statement is true about the end behavior of the graphed function? (ignore my answer)
hoa [83]
The answer is the first choice:

As the x-values go to positive infinity, the functions values go to negative infinity
7 0
3 years ago
Write a quadratic function in standard form whose graph passes through (-11,0), (1,0), and (-3,64).
densk [106]

Answer: (-2,25)

Step-by-step explanation:

6 0
3 years ago
Quadrilaterals ABCD and PQRS shown below are two similar figures.<br>Find the values of x and y.​
nadezda [96]

Answer:

x = 12, y = 16

Step-by-step explanation:

Since the figures are similar then the ratios of corresponding sides are equal, that is

\frac{AD}{PS} = \frac{DC}{SR} , substitute values

\frac{20}{2x+6} = \frac{18}{27} ( cross- multiply )

18(2x + 6) = 540 ( divide both sides by 18 )

2x + 6 = 30 ( subtract 6 from both sides )

2x = 24 ( divide both sides by 2 )

x = 12

-------------------------------------------

and

\frac{AB}{PQ} = \frac{DC}{SR} , substitute values

\frac{y}{24} = \frac{18}{27} ( cross- multiply )

27y = 432 ( divide both sides by 27 )

y = 16

3 0
3 years ago
You are given 4 matrices M1, M2, M3, M4 and you are asked to determine the optimal schedule for the product M1 ×M2 × M3 ×M4 that
alexandr1967 [171]

Answer:

Step-by-step explanation:

first method is to try out all possible combinations and pick out the best one which has the minimum operations but that would be infeasible method if the no of matrices increases  

so the best method would be using the dynamic programming approach.

A1 = 100 x 50

A2 = 50 x 200

A3 = 200 x 50

A4 = 50 x 10

Table M can be filled using the following formula

Ai(m,n)

Aj(n,k)

M[i,j]=m*n*k

The matrix should be filled diagonally i.e., filled in this order

(1,1),(2,2)(3,3)(4,4)

(2,1)(3,2)(4,3)

(3,1)(4,2)

(4,1)

<u>                  Table M[i, j]                                             </u>

             1                      2                  3                    4

4    250000          200000        100000                0  

3      

750000        500000            0

2      1000000             0

1            

0

Table S can filled this way

Min(m[(Ai*Aj),(Ak)],m[(Ai)(Aj*Ak)])

The matrix which is divided to get the minimum calculation is selected.

Table S[i, j]

           1          2         3        

4

4          1           2         3

3          

1          2

2            1

1

After getting the S table the element which is present in (4,1) is key for dividing.

So the matrix multiplication chain will be (A1 (A2 * A3 * A4))

Now the element in (4,2) is 2 so it is the key for dividing the chain

So the matrix multiplication chain will be (A1 (A2 ( A3 * A4 )))

Min number of multiplications: 250000

Optimal multiplication order: (A1 (A2 ( A3 * A4 )))

to get these calculations perform automatically we can use java

code:

public class MatrixMult

{

public static int[][] m;

public static int[][] s;

public static void main(String[] args)

{

int[] p = getMatrixSizes(args);

int n = p.length-1;

if (n < 2 || n > 15)

{

System.out.println("Wrong input");

System.exit(0);

}

System.out.println("######Using a recursive non Dyn. Prog. method:");

int mm = RMC(p, 1, n);

System.out.println("Min number of multiplications: " + mm + "\n");

System.out.println("######Using bottom-top Dyn. Prog. method:");

MCO(p);

System.out.println("Table of m[i][j]:");

System.out.print("j\\i|");

for (int i=1; i<=n; i++)

System.out.printf("%5d ", i);

System.out.print("\n---+");

for (int i=1; i<=6*n-1; i++)

System.out.print("-");

System.out.println();

for (int j=n; j>=1; j--)

{

System.out.print(" " + j + " |");

for (int i=1; i<=j; i++)

System.out.printf("%5d ", m[i][j]);

System.out.println();

}

System.out.println("Min number of multiplications: " + m[1][n] + "\n");

System.out.println("Table of s[i][j]:");

System.out.print("j\\i|");

for (int i=1; i<=n; i++)

System.out.printf("%2d ", i);

System.out.print("\n---+");

for (int i=1; i<=3*n-1; i++)

System.out.print("-");

System.out.println();

for (int j=n; j>=2; j--)

{

System.out.print(" " + j + " |");

for (int i=1; i<=j-1; i++)

System.out.printf("%2d ", s[i][j]);

System.out.println();

}

System.out.print("Optimal multiplication order: ");

MCM(s, 1, n);

System.out.println("\n");

System.out.println("######Using top-bottom Dyn. Prog. method:");

mm = MMC(p);

System.out.println("Min number of multiplications: " + mm);

}

public static int RMC(int[] p, int i, int j)

{

if (i == j) return(0);

int m_ij = Integer.MAX_VALUE;

for (int k=i; k<j; k++)

{

int q = RMC(p, i, k) + RMC(p, k+1, j) + p[i-1]*p[k]*p[j];

if (q < m_ij)

m_ij = q;

}

return(m_ij);

}

public static void MCO(int[] p)

{

int n = p.length-1;     // # of matrices in the product

m    =    new    int[n+1][n+1];        //    create    and    automatically initialize array m

s = new int[n+1][n+1];

for (int l=2; l<=n; l++)

{

for (int i=1; i<=n-l+1; i++)

{

int j=i+l-1;

m[i][j] = Integer.MAX_VALUE;

for (int k=i; k<=j-1; k++)

{

int q = m[i][k] + m[k+1][j] + p[i-1]*p[k]*p[j];

if (q < m[i][j])

{

m[i][j] = q;

s[i][j] = k;

}

}

}

}

}

public static void MCM(int[][] s, int i, int j)

{

if (i == j) System.out.print("A_" + i);

else

{

System.out.print("(");

MCM(s, i, s[i][j]);

MCM(s, s[i][j]+1, j);

System.out.print(")");

}

}

public static int MMC(int[] p)

{

int n = p.length-1;

m = new int[n+1][n+1];

for (int i=0; i<=n; i++)

for (int j=i; j<=n; j++)

m[i][j] = Integer.MAX_VALUE;

return(LC(p, 1, n));

}

public static int LC(int[] p, int i, int j)

{

if (m[i][j] < Integer.MAX_VALUE) return(m[i][j]);

if (i == j) m[i][j] = 0;

else

{

for (int k=i; k<j; k++)

{

int   q   =   LC(p,   i,   k)   +   LC(p,   k+1,   j)   +   p[i-1]*p[k]*p[j];

if (q < m[i][j])

m[i][j] = q;

}

}

return(m[i][j]);

}

public static int[] getMatrixSizes(String[] ss)

{

int k = ss.length;

if (k == 0)

{

System.out.println("No        matrix        dimensions        entered");

System.exit(0);

}

int[] p = new int[k];

for (int i=0; i<k; i++)

{

try

{

p[i] = Integer.parseInt(ss[i]);

if (p[i] <= 0)

{

System.out.println("Illegal input number " + k);

System.exit(0);

}

}

catch(NumberFormatException e)

{

System.out.println("Illegal input token " + ss[i]);

System.exit(0);

}

}

return(p);

}

}

output:

7 0
3 years ago
Find IJ. <br> A. 17<br> B. 10.5<br> C. 10<br> D. 13
Zolol [24]

Answer:

B:10.5

Step-by-step explanation:

half of 21 is 10.5

8 0
3 years ago
Read 2 more answers
Other questions:
  • Mariana's swimming pool holds 22,000 gallons of water. If there are approximately 7.5 gallons per cubic foot, what size swimming
    6·1 answer
  • Any one that knows this please help thanks!
    5·1 answer
  • Malik buys and sells car parts. He bought two tires for $45.00 each and later sold them for $65.00 each. He bought three rims fo
    9·2 answers
  • What are the real zeros of f(x) = x^3 +2x^2-5x-6
    13·1 answer
  • 24 slices of cheese for $7.44 or 90 slices of cheese for $28.80 <br><br> witch is better to buy?
    15·1 answer
  • If 3s = t + 5 and se = 4, then t =
    6·1 answer
  • Statement that explains how the values of 36 and 360 are different.
    7·1 answer
  • Suppose that a survey was taken and it showed that 18% of online shoppers in the United States would prefer to do business only
    10·2 answers
  • Dany has 15 toys. This morning Mrs. Bahr woke up to see that Dany ruined one of her toys, so Mrs. Bahr threw it away. If now hal
    10·2 answers
  • Please help I don’t understand
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!