A circular saw blade (E = 200 GPa, v = 0,3) can be considered as a...

A circular saw blade (E = 200 GPa, v = 0,3) can be considered as a 2 mm thick disc with an outer diameter of 600 mm and central hole of 100 mm diameter bolted to a rigid inner rotating disc. Determine the maximum rotational speed if initial yielding of the disc occurs for a Tresca yield stress of 200 MPa.

Solutions

Expert Solution

Without any information of the time required, I don't know how am I supposed to find the rotational speed.

Well I have calculated the maximum angle of rotation in radians.

Ally Wells answered 1 year ago

Next > < Previous

Related Solutions

What A laminated steel (E = 200 GPa and ? = 0.3) cylinder consists of a...

What A laminated steel (E = 200 GPa and ? = 0.3) cylinder consists of a jacket with an inside diameter of 200 mm and an outside diameter of 300 mm shrunk onto a tube with an inside diameter of 100 mm. The initial shrinkage pressure is 25 MPa. Determine: a. The maximum tensile stress in the cylinder after it is fabricated subject to an internal pressure of 200 MPa. b. What and where is the maximum shear stress?

(Circular Permutations) In how many ways can 7 people { A, B, C, D, E, F,...

(Circular Permutations) In how many ways can 7 people { A, B, C, D, E, F, G } be seated at a round table if (a) A and B must not sit next to each other; (b) C, D, and E must sit together (i.e., no other person can sit between any of these three)? (c) A and B must sit together, but neither can be seated next to C or D. Consider each of these separately. Hint: Conceptually, think...

Problem for submission: For which positive integers k can a simple graph G = (V, E)...

Problem for submission: For which positive integers k can a simple graph G = (V, E) be constructed such that: G has k vertexes, that is, |V | = k, G is bipartite, and its complement G is bipartite? Prove your answer is correct Please show and explain your full proof.

Problem 8. A bipartite graph G = (V,E) is a graph whose vertices can be partitioned...

Problem 8. A bipartite graph G = (V,E) is a graph whose vertices can be partitioned into two (disjoint) sets V1 and V2, such that every edge joins a vertex in V1 with a vertex in V2. This means no edges are within V1 or V2 (or symbolically: ∀u, v ∈ V1, {u,v} ∉ E and ∀u,v ∈ V2, {u,v} ∉ E). 8(a) Show that the complete graph K2 is a bipartite graph. 8(b) Prove that no complete graph Kn,...

Subjects