Answer this question. Part (1), (2) & (3).

C++ for Engineers and Scientists
4th Edition
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Bronson, Gary J.
Chapter5: Repetition Statements
Section: Chapter Questions
Problem 2PP: (Mechanics) The deflection at any point along the centerline of a cantilevered beam, such as the one...
icon
Related questions
Question

Answer this question. Part (1), (2) & (3).

Task 2
The cells of the battery are treated using a programmable lathe machine. The machine has 15
programs that are able to control its speed. Program 1 has 11 ( N( 1) = 11) different speeds that
can vary from 100 revolution per minute (rev/min) to 1100 (rev/min). Program 2 has 13 (N
(2) =13) speeds that can vary from 110 rev/min to 1430 rev/min (X1(1) = 100, X2(1)=110,
and so on). The number of speeds of the higher programs increases using geometric progression
and the speeds within the same program follow the same pattern of the common difference
achieved in program 1 and 2 and increase using arithmetic progression.
Determine the general formulas of the speeds of the programs and the number of
speeds of the programs.
Construct a sequence using the final speed of each program. Is there any relation
between these speeds?
Determine the number of speeds of program 10, and the value of speed number 7
within program 10.
Determine the total number of speeds that can be produced.
Determine the value of the maximum speed that can be produced by the lathe
machine.
If a speed of 3000 rev./min is required to handle a specific manufacturing task, which
(program/s) can be used to achieve it exactly. On the other hand, if the program
cannot achieve the speed of 3000 rev./min; recommend the speed that can be used
and the program that can provide the closest value of 3000 rev./min.
Repeat a-f if the number of speeds is increased arithmetically (N is now arithmetic)
and the speeds within each program is varied geometrically ( Xi, j=1: 15)using the
1.
2.
3.
4.
5.
6.
7.
same pattern.
Transcribed Image Text:Task 2 The cells of the battery are treated using a programmable lathe machine. The machine has 15 programs that are able to control its speed. Program 1 has 11 ( N( 1) = 11) different speeds that can vary from 100 revolution per minute (rev/min) to 1100 (rev/min). Program 2 has 13 (N (2) =13) speeds that can vary from 110 rev/min to 1430 rev/min (X1(1) = 100, X2(1)=110, and so on). The number of speeds of the higher programs increases using geometric progression and the speeds within the same program follow the same pattern of the common difference achieved in program 1 and 2 and increase using arithmetic progression. Determine the general formulas of the speeds of the programs and the number of speeds of the programs. Construct a sequence using the final speed of each program. Is there any relation between these speeds? Determine the number of speeds of program 10, and the value of speed number 7 within program 10. Determine the total number of speeds that can be produced. Determine the value of the maximum speed that can be produced by the lathe machine. If a speed of 3000 rev./min is required to handle a specific manufacturing task, which (program/s) can be used to achieve it exactly. On the other hand, if the program cannot achieve the speed of 3000 rev./min; recommend the speed that can be used and the program that can provide the closest value of 3000 rev./min. Repeat a-f if the number of speeds is increased arithmetically (N is now arithmetic) and the speeds within each program is varied geometrically ( Xi, j=1: 15)using the 1. 2. 3. 4. 5. 6. 7. same pattern.
Expert Solution
steps

Step by step

Solved in 2 steps with 4 images

Blurred answer
Knowledge Booster
Binary numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr