Concept explainers
This casting in Figure 5-4 shows seven tapped holes, A-G. The number of threads is determined by dividing the depth of the thread by the thread pitch. Find the number of threads in each of the tapped holes. All dimensions are in inches.

(a)
Evaluate the number of threads for hole A.
Answer to Problem 13A
The number of threads for hole A is
Explanation of Solution
Given:
All the dimensions are shown below:
Concept used:
Divide the depth by pitch of threads.
Calculation:
Divide the depth
Thus, the number of threads for hole A is
Conclusion:
The number of threads for hole A is

(b)
Evaluate the number of threads for hole B.
Answer to Problem 13A
The number of threads for hole B is
Explanation of Solution
Given:
All the dimensions are shown below:
Concept used:
Divide the depth by pitch of threads.
Calculation:
Divide the depth
Thus, the number of threads for hole B is
Conclusion:
The number of threads for hole B is

(c)
Evaluate the number of threads for hole C.
Answer to Problem 13A
The number of threads for hole C is
Explanation of Solution
Given:
All the dimensions are shown below:
Concept used:
Divide the depth by pitch of threads.
Calculation:
Divide the depth
Thus, the number of threads for hole C is
Conclusion:
The number of threads for hole C is

(d)
Evaluate the number of threads for hole D.
Answer to Problem 13A
The number of threads for hole D is
Explanation of Solution
Given:
All the dimensions are shown below:
Concept used:
Divide the depth by pitch of threads.
Calculation:
Divide the depth
Thus, the number of threads for hole D is
Conclusion:
The number of threads for hole D is

(e)
Evaluate the number of threads for hole E.
Answer to Problem 13A
The number of threads for hole E is
Explanation of Solution
Given:
All the dimensions are shown below:
Concept used:
Divide the depth by pitch of threads.
Calculation:
Divide the depth
Thus, the number of threads for hole E is
Conclusion:
The number of threads for hole E is

(f)
Evaluate the number of threads for hole F.
Answer to Problem 13A
The number of threads for hole F is
Explanation of Solution
Given:
All the dimensions are shown below:
Concept used:
Divide the depth by pitch of threads.
Calculation:
Divide the depth
Thus, the number of threads for hole F is
Conclusion:
The number of threads for hole F is

(g)
Evaluate the number of threads for hole G.
Answer to Problem 13A
The number of threads for hole G is
Explanation of Solution
Given:
All the dimensions are shown below:
Concept used:
Divide the depth by pitch of threads.
Calculation:
Divide the depth
Thus, the number of threads for hole G is
Conclusion:
The number of threads for hole G is
Want to see more full solutions like this?
Chapter 5 Solutions
EBK MATHEMATICS FOR MACHINE TECHNOLOGY
- 2 Q/Given H (x,y) = x² + y² - y² Find the Hamiltonian System and prove it is first integral-arrow_forwardQ2) A: Find the region where ODEs has no limit cycle: x = y + x³ y=x+y+y³ 6arrow_forwardQ3)A: Given H(x,y)=x2-x+ y²as a first integral of an ODEs, find this ODES corresponding to H(x,y) and show the phase portrait by using Hartman theorem and by drawing graph of H(x,y)-e. Discuss the stability of critical points of the corresponding ODEs.arrow_forward
- Using Karnaugh maps and Gray coding, reduce the following circuit represented as a table and write the final circuit in simplest form (first in terms of number of gates then in terms of fan-in of those gates). HINT: Pay closeattention to both the 1’s and the 0’s of the function.arrow_forwardRecall the RSA encryption/decryption system. The following questions are based on RSA. Suppose n (=15) is the product of the two prime numbers 3 and 5.1. Find an encryption key e for for the pair (e, n)2. Find a decryption key d for for the pair (d, n)3. Given the plaintext message x = 3, find the ciphertext y = x^(e) (where x^e is the message x encoded with encryption key e)4. Given the ciphertext message y (which you found in previous part), Show that the original message x = 3 can be recovered using (d, n)arrow_forwardTheorem 1: A number n ∈ N is divisible by 3 if and only if when n is writtenin base 10 the sum of its digits is divisible by 3. As an example, 132 is divisible by 3 and 1 + 3 + 2 is divisible by 3.1. Prove Theorem 1 2. Using Theorem 1 construct an NFA over the alphabet Σ = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}which recognizes the language {w ∈ Σ^(∗)| w = 3k, k ∈ N}.arrow_forward
- Recall the RSA encryption/decryption system. The following questions are based on RSA. Suppose n (=15) is the product of the two prime numbers 3 and 5.1. Find an encryption key e for for the pair (e, n)2. Find a decryption key d for for the pair (d, n)3. Given the plaintext message x = 3, find the ciphertext y = x^(e) (where x^e is the message x encoded with encryption key e)4. Given the ciphertext message y (which you found in previous part), Show that the original message x = 3 can be recovered using (d, n)arrow_forwardFind the sum of products expansion of the function F(x, y, z) = ¯x · y + x · z in two ways: (i) using a table; and (ii) using Boolean identities.arrow_forwardGive both a machine-level description (i.e., step-by-step description in words) and a state-diagram for a Turing machine that accepts all words over the alphabet {a, b} where the number of a’s is greater than or equal to the number of b’s.arrow_forward
- Mathematics For Machine TechnologyAdvanced MathISBN:9781337798310Author:Peterson, John.Publisher:Cengage Learning,Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw HillAlgebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
- Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALCollege Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage LearningTrigonometry (MindTap Course List)TrigonometryISBN:9781337278461Author:Ron LarsonPublisher:Cengage Learning





