What fraction of the larger parts are longer

Assignment Help Basic Statistics

Reference no: EM131167225

A company assembles a large part by joining two smaller parts together. Assume that the smaller parts are normally distributed with a mean length of 1 inch and a standard deviation of 0.01 inch.

a. What fraction of the larger parts are longer than 2.05 inches?

b. What fraction of the larger parts are between 1.96 inches and 2.02 inches long?

Reference no: EM131167225

Questions Cloud

How to find a path with the least number of edges : Explain how to find a path with the least number of edges between two vertices in an undirected graph by considering it as a shortest path problem in a weighted graph.

Various data structures in course : We have studied various data structures in this course. How do you know "When to use what?" Discussion of efficiencies should include "Big O" notation, such as O(1), O(log N), O(N), O(N^2), answer must be at least 10 sentences in length.

What is meant by a feedback loop in a complex : What is meant by a 'feedback loop' in a complex, interconnected system? Give examples of negative and positive feedback loops? Explain what is meant by synergetic interaction in a complex system and its importance?

What is a minimum spanning tree : What is a minimum spanning tree? How do we create one? What is the shortest path problem? How do we determine the shortest path? Discussion of efficiencies should include "Big O" notation

What fraction of the larger parts are longer : What fraction of the larger parts are longer than 2.05 inches? - What fraction of the larger parts are between 1.96 inches and 2.02 inches long?

Analyze the major barriers for entry and exit : Analyze the major barriers for entry and exit into the airline industry. Explain how each barrier can foster either monopoly or oligopoly

What is a directed graph : What is a Directed Graph? How does it differ from a normal graph? What is a Weighted Graph? How does it differ from a normal graph or a Directed Graph?

Find the length of a shortest path between all pairs : Floyd's algorithm, displayed as Algorithm 2, can be used to find the length of a shortest path between all pairs of vertices in a weighted connected simple graph. However, this algorithm cannot be used to construct shortest paths. (We assign an in..

Design a decision support system : The owner of a hardware store wants to design a decision support system to predict how many and which type of nails she should sell and what information she needs to do so. The scenario is described below:

User Account

All Pages