Mr. Sanford left half of his fortune to April, his daughter. He left of the remaining half to his uncle Jed. He left half of the
1 answer:
You might be interested in
Answer:
4 acres of wheat and 4 acres of rye.
Step-by-step explanation:
Given: Farmer has only 7 acre, he has plant at least 7 acres.
Farmer has only $1200 to spend.
Each acre of wheat will cost $200 and rye will cost $100.
Planting time is only 12 hours
Wheat planting take 1 hour per hour and rye take 2 hours per acre.
Profit on wheat is $500 per acre and rye $300 per acre.
As to find out maximum profit, we need to plant maximum wheat.
While dividing number of acres of land for wheat and rye for plantation, we need to keep two constraint in the mind; Constraint of cost and time as given.
Lets assume few number considering these constraint to get maximum profit.
First assumption, 5 acres of wheat and 2 acres of rye
Time taken=
Total time taken 7 hours
Amount spent=
Total cost is $ 1200.
Profit=
Maximum profit= $3100.
Second assumption, 4 acres of wheat and 4 acres of rye.
Times taken=
Total time taken is 12 hours
Amount spent=
Total cost is $1200.
Profit=
Maximum profit= $3200.
∴ By using hit and trail method, we can see that we are getting maximum profit when farmer is planting 4 acres of wheat and 4 acres of rye.
Answer:
The result is 19
Step-by-step explanation:
Step 1: Parenthesizing (5-2)=3
Step 2: Exponentiation
Step 3: Multiplication and division 3x4=12 and 6/3=2
Step 4: Addition and subtraction 9+12=21, and 21-2=19
21-2
19
The operations are ordered from highest to lowest in the order:
1. Parenthesizing,
2. Factorial,
3. Exponentiation,
4. Multiplication and division,
5. Addition and subtraction.
Hope this helps!
Answer:
(a)
(b)
(c)
Step-by-step explanation:
The Euclidean algorithm is an efficient method for computing the greatest common divisor of two integers, without explicitly factoring the two integers.
The Euclidean algorithm solves the problem:
<em> Given integers </em><em>, find </em>
<em />
Here is an outline of the steps:
- Let
,
.
- Given
, use the division algorithm to write
.
- If
, stop and output
; this is the gcd of
.
- If
, replace
by
. Go to step 2.
The division algorithm is an algorithm in which given 2 integers N and D, it computes their quotient Q and remainder R.
Let's say we have to divide N (dividend) by D (divisor). We will take the following steps:
Step 1: Subtract D from N repeatedly.
Step 2: The resulting number is known as the remainder R, and the number of times that D is subtracted is called the quotient Q.
(a) To find we apply the Euclidean algorithm:
The process stops since we reached 0, and we obtain .
(b) To find we apply the Euclidean algorithm:
The process stops since we reached 0, and we obtain .
(c) To find we apply the Euclidean algorithm:
The process stops since we reached 0, and we obtain .