Probability, Mathematics

Assignment Help:

The probability that a leap year will have 53 sunday is ? and how please explain it ?

(a)1/7    (b) 2/7    (c) 5/7    (d)6/7

Sol)
A leap year has 366 days, therefore 52 weeks i.e. 52 Sunday and 2 days. The remaining 2 days may be any of the following : (i) Sunday and Monday (ii) Monday and Tuesday (iii) Tuesday and Wednesday (iv) Wednesday and Thursday (v) Thursday and Friday (vi) Friday and Saturday (vii) Saturday and Sunday For having 53 Sundays in a year, one of the remaining 2 days must be a Sunday. n(S) = 7 n(E) = 2 P(E) = n(E) / n(S) = 2 / 7


Related Discussions:- Probability

How many people said that red was their favorite color, In a recent survey ...

In a recent survey of 700 people, 15% said that red was their favorite color. How many people said that red was their favorite color? Find out 15% of 700 through multiplying 70

Determine the size of belt, On a piece of machinery, the centers of two pul...

On a piece of machinery, the centers of two pulleys are 3 feet apart, and the radius of each pulley is 6 inches. Determine the size of belt (in feet) is required to wrap around bot

LPP, howto know whether a region is bounded or not

howto know whether a region is bounded or not

Calculus, Given f (x) =10x^3 - x^5 , find all intervals(in Interval Notatio...

Given f (x) =10x^3 - x^5 , find all intervals(in Interval Notation) of Concavity and the x-values of all Inflection Points.

Exact differential equations, The subsequent type of first order differenti...

The subsequent type of first order differential equations which we'll be searching is correct differential equations. Before we find in the full details behind solving precise diff

The hundredths digit is 4 and the tenths digit is twice, Which number below...

Which number below is described by the following statements? The hundredths digit is 4 and the tenths digit is twice the thousandths digit. a. 0.643 b. 0.0844 c. 0.446 d. 0.0142

Prove that prims algorithm produces a minimum spanning tree, Prove that Pri...

Prove that Prim's algorithm produces a minimum spanning tree of a connected weighted graph. Ans: Suppose G be a connected, weighted graph. At each iteration of Prim's algorithm

3/8/2013 5:50:18 AM

A non - leap year contains 365 days 52 weeks and 1 day more.
i) We get 53 Sundays when the remaining day is Sunday.
Number of days in week = 7
∴ n(S) = 7
Number of ways getting 53 Sundays.
n(E) = 1
n E 1
n S 7
=
∴ Probability of getting 53 Sundays =1/7

3/8/2013 5:50:56 AM

A leap year consits  of 366 days in those 364 days are completely 52 weeks so it contains 52 sundays remaining 2 days there are 2/7 probabilities are there.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd