Hello,
function minmax(int p1,int p2,int p3, int adr_big, int adr_small)
{ int mini=p1,maxi=p1;
if (p1>p2) {mini=p2;}
else {maxi=p2;};
if (p3>maxi) maxi=p3;
if (p3<mini) mini=p3;
*adr_big=maxi;
*adr_small=mini;
};
// main
int a=31,b=5,c=19,big,small;
minmax(a,b,c,&big,&small);
<h3>☂︎ Answer :- </h3>
<h3>☂︎ Solution :- </h3>
- LCM of 5 , 18 , 25 and 27 = 2 × 3³ × 5²
- 2 and 3 have odd powers . To get a perfect square, we need to make the powers of 2 and 3 even . The powers of 5 is already even .
In other words , the LCM of 5 , 18 , 25 and 27 can be made a perfect square if it is multiplied by 2 × 3 .
The least perfect square greater that the LCM ,
☞︎︎︎ 2 × 3³ × 5² × 2 × 3
☞︎︎︎ 2² × 3⁴ × 5²
☞︎︎︎ 4 × 81 × 85
☞︎︎︎ 100 × 81
☞︎︎︎ 8100
8100 is the least perfect square which is exactly divisible by each of the numbers 5 , 18 , 25 , 27 .
I can not see your ferris wheel and so I can not answer it.
1 and 2 i can't answer without proper data.
3. x+2x+2x+6 = 86
5x+6 = 86
-6 -6
5x = 80
x = 16
Side one: x is 16
Side two: 2x is 2(16) = 32
Side three: 2x+6 is 38
Answer:
Before raise: 65 chocolates/hour*60=3900 chocolates
Raise=65 * (15%=15/100=.15) .15=9.75 more chocolates per hour
With raise 74.75 chocolates/hour*60=4485 chocolates
4485-3900=585 more chocolates per 60 hour week
Step-by-step explanation:
