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

Tied rankings, Tied Rankings A slight adjustment to the formula is mad...

Tied Rankings A slight adjustment to the formula is made if several students tie and have the similar ranking the adjustment is: (t 3 - t)/12 Whereas t = number of tied

Facts regarding linear equations, To solve out linear equations we will mak...

To solve out linear equations we will make heavy use of the following facts. 1. If a = b then a + c = b + c for any c.  All it is saying that we can add number, c, to both sides

Linear Systems, Find the solution to the following system of equations usin...

Find the solution to the following system of equations using substitution:

Trignometry, how can i easily solve the trignometry question?

how can i easily solve the trignometry question?

World Problems on simultaneous equations, A particular algebra text has a t...

A particular algebra text has a total of 1382 pages which is broken up into two parts. the second part of book has 64 more pages than first part. How many pages are in each part of

Prove that xa+ar=xb+br of circle, In figure, XP and XQ are tangents from X ...

In figure, XP and XQ are tangents from X to the circle with centre O. R is a point on the circle. Prove that XA+AR=XB+BR Ans:    Since the length of tangents from externa

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

The hurwiz method, The Hurwiz method Hurwiz method was the concept of c...

The Hurwiz method Hurwiz method was the concept of coefficient of optimism or pessimism introduced by L. Hurwicz. The decision maker takes into account both the minimum and max

Calculate the average, During 2008 the average number of beds required per ...

During 2008 the average number of beds required per day at St Hallam's hospital was 1800.  During the first 50 days of 2008 the average daily requirement for beds was 1830, with a

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