Answer:
The amount is sufficient to make 75 tarts.
Step-by-step explanation:
We have been given that a recipe for individual chocolate hazelnut tarts calls for ½ cup of hazelnuts per tart and 1 cup of hazelnuts weighs 4 ounces.
The half cup of hazelnuts will weigh 2 ounces
.
1 kg equals 35.274 ounces.


Since each tart needs ½ cup of hazelnuts and half cup of hazelnuts will weigh 2 ounces, so we will divide 176.37 ounces by 2 to find number of tarts.

Since we can make 88 tarts from 5 kg hazelnuts, therefore, the 5-kilogram bag of hazelnuts be sufficient to make 75 tarts.
Answer:

Step-by-step explanation:
<u>Firstly, we'll do prime factorization of these numbers.</u>
70 = 2 × 5 × 7
112 = 2 × 2 × 2 × 2 × 7
<u>So, The Greatest Common Factor can be written as:</u>
GCF = 2 × 7 <u>[Since Only one 2 and one 7 is common]</u>
<u></u>
Hope this helped!
<h2>~AnonymousHelper1807</h2>
Answer:
<h3> The equation has one valid solution and no extraneous of solutions.</h3>
Step-by-step explanation:
Given the expression;
4x/3x+1 = x/2x+10
We are to get the nature of the value of x
Cross multiply;
x(3x+1) = 4x(2x+10)
3x²+x = 8x²+40x
Collect like terms;
3x²-8x² + x - 40x = 0
-5x²+x -40x = 0
-5x²-39x = 0
-5x² = 39x
-5x = 39
x = -39/5
<em>Since we have just one value of x hence, the equation has one valid solution and no extraneous of solutions.</em>
<em></em>
<em></em>
Firstly, we'll fix the postions where the
women will be. We have
forms to do that. So, we'll obtain a row like:

The n+1 spaces represented by the underline positions will receive the men of the row. Then,

Since there is no women sitting together, we must write that
. It guarantees that there is at least one man between two consecutive women. We'll do some substitutions:

The equation (i) can be rewritten as:

We obtained a linear problem of non-negative integer solutions in (ii). The number of solutions to this type of problem are known: ![\dfrac{[(n)+(m-n+1)]!}{(n)!(m-n+1)!}=\dfrac{(m+1)!}{n!(m-n+1)!}](https://tex.z-dn.net/?f=%5Cdfrac%7B%5B%28n%29%2B%28m-n%2B1%29%5D%21%7D%7B%28n%29%21%28m-n%2B1%29%21%7D%3D%5Cdfrac%7B%28m%2B1%29%21%7D%7Bn%21%28m-n%2B1%29%21%7D)
[I can write the proof if you want]
Now, we just have to calculate the number of forms to permute the men that are dispposed in the row: 
Multiplying all results:

Have two sets of parallel sides