FUND MAT SCI+ENG ACCESS+EPUB
FUND MAT SCI+ENG ACCESS+EPUB
5th Edition
ISBN: 9781119662815
Author: Callister
Publisher: WILEY
Question
Book Icon
Chapter 9.19, Problem 1QP
To determine

The magnitude of the maximum stress at the tip of an internal crack (σm) .

Expert Solution & Answer
Check Mark

Answer to Problem 1QP

The magnitude of the maximum stress at the tip of an internal crack is 3959.79MPa_ .

Explanation of Solution

Given:

The radius of curvature of the crack tip, pt=1.9×104mm

The crack length, a=3.8×102mm

The tensile stress, σ0=140MPa

Explanation:

Determine the maximum stress that occurs at the crack tip.

σm=2σ0(apt)1/2 (I)

Conclusion:

Substitute 3.8×102mm for a, 140 MPa for σ0 , and 1.9×104mm for pt in Equation (I).

σm=2(140MPa)(3.8×102mm1.9×104mm)1/2=2(140)(14.142)=3959.79MPa

Thus, the magnitude of the maximum stress at the tip of an internal crack is 3959.79MPa_ .

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
Problem 1- find the root locus of the following transfer functions by Matlab Hint copy the root locus figures you find in Matlab and paste all four on a word document, create a PdF from the Word file and upload on canvas): 5 1. H(s) = 2s+1 2. H(s): = 2 100 s²+10s+100 1000 3. H(s) = (s+5)(s²+68+25) 10000 4. H(s) = (s²+48+16) (s²+68+25)
(Dynamic Programming.) Recall the problem presented in Assign- ment 3 where given a list L of n ordered integers you're tasked with removing m of them such that the distance between the closest two remaining integers is maxi- mized. See Assignment 1 for further clarification and examples. As it turns out there is no (known) greedy algorithm to solve this problem. However, there is a dynamic programming solution. Devise a dynamic programming solution which determines the maximum distance between the closest two points after removing m numbers. Note, it doesn't need to return the resulting list itself. Hint 1: Your sub-problems should be of the form S(i, j), where S(i, j) returns the maximum distance of the closest two numbers when only considering removing j of the first i numbers in L. As an example if L [3, 4, 6, 8, 9, 12, 13, 15], then S(4, 1) = 2, since the closest two values of L' = [3,4,6,8] are 6 and 8 after removing 4 (note, 8-6 = = 2). = Hint 2: For the sub-problem S(i, j),…
(Dynamic Programming.) A group of friends is visiting a number of attractions located along a highway, starting at kilometre 0, placed at distances ɑ1 < A2 < ···
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
MATLAB: An Introduction with Applications
Engineering
ISBN:9781119256830
Author:Amos Gilat
Publisher:John Wiley & Sons Inc
Text book image
Essentials Of Materials Science And Engineering
Engineering
ISBN:9781337385497
Author:WRIGHT, Wendelin J.
Publisher:Cengage,
Text book image
Industrial Motor Control
Engineering
ISBN:9781133691808
Author:Stephen Herman
Publisher:Cengage Learning
Text book image
Basics Of Engineering Economy
Engineering
ISBN:9780073376356
Author:Leland Blank, Anthony Tarquin
Publisher:MCGRAW-HILL HIGHER EDUCATION
Text book image
Structural Steel Design (6th Edition)
Engineering
ISBN:9780134589657
Author:Jack C. McCormac, Stephen F. Csernak
Publisher:PEARSON
Text book image
Fundamentals of Materials Science and Engineering...
Engineering
ISBN:9781119175483
Author:William D. Callister Jr., David G. Rethwisch
Publisher:WILEY