Answer:
LOL ur cheating
Step-by-step explanation:
Answer:
(a) 2min/15units
(b) 1min/20units
(c) The bottleneck stage is cutting. The process capacity is 450units/hour
(d) The capacity of the new employee should be 1unit/2sec. The process capacity will increase four times
Step-by-step explanation:
(a) Cycle time for stage cutting for 2 employees = 16sec/2units × 1min/60sec = 2min/15units
(b) Cycle time for stage sealing for 1 employee = 3sec/1unit × 1min/60sec = 1min/20units
(c) Process capacity of stage cutting = 15units/2min × 60min/1hour = 450units/hour
(d) If the capacity of the new employee is 1unit/2sec, the process capacity = 1unit/2sec × 3600sec/1hour = 1800units/hour. The process capacity increases 4 times (1800/450 = 4)
Answer:
37 is the smallest positive integer n such that n(n+1)(n+2) is divisible by 247.
Step-by-step explanation:
First we will find the prime factors of 247:
247 = 13 x 19 (which are both prime).
So now we need to find a number (the smallest one) that is of the form (n)(n+1)(n+2) (the product of three consecutive numbers) and that is divisible by both 13 and 19 (and therefore divisible by 247)
Let's take a look at the multiples of 13: 13, 26, 39, 52...
Let's take a look at the multiples of 19: 19, 38, 57...
We can see that the first time we have two multiples close together are the 38 (for 19) and the 39 (for 17).
So, if our number has both 38 and 39 as factors, then it will be divisible by 247.
However, we need not two but three consecutive numbers, and since we want the number to be the smallest positive integer, we will add 37 (since our other choice would be to add 40 and that would make the number bigger) and thus our number is (37)(38)(39) or in other words (37)(37 + 1)(37 + 2) and therefore this is the smallest positive number such that n(n+1)(n+2) is divisible by 247.
Step-by-step explanation:
Hey where you went give me your mail id
Answer:
The number 1 it's factor's are 1 and 0
The number 3 it's factor's are 0, 1, 3
The number 5 it's factor's are 0,1,5
Step-by-step explanation:
