Logical reasoning

1 . Calenders:
.Normal Year=52 weeks+1 odd day .Leap Year =52 weeks+2 odd days .Leap year=400k,4k .per 100 years =5 odd days .per 200 years =3 odd days .per 300 years=1 odd day .per 400 years =0 odd day .We take 31 Dec,01 BC -Sunday as Reference date. . Month Jan Feb March April May June July Augest Sep Oct Nov Dec 0 3 2 3 2 3 3 2

.Odd Days- 3 3 2 3

eg.Whats the day on 15 Augest,1947 ? 1 Ad-1600 Ad-0 odd days 1601-1900 Ad : 1odd day 1901-1947 : 35 N +11 35+22 =57 odd days =1 odd day till augest we have=3+3++2+3+2+3+15 odd days =31 odd days =3 odd days Total odd days:1+1+3 5 odd days (Friday) Note :Do not include the reference date

Do include the for which You are calculating day .eg :26 Jan Monday ,then 15 Aug = ? Jan July 5 3 15 No of odd days :5 odd days : (Saturday) Aug 0 3 2 3 2 Feb March April May June

Cubes
.Faces : 6 .Corner :8 .Edges :12 .If cuts are parallel then no of identical pieces generated are : (n+1) .To find maximum no. of identical pieces when cuts are given is : Case 1 :If its a multiple of 3 Max no of pieces are :(Total cuts/3+1)^3 Case 2.If its not a multiple of 3 divide by 3 quotient will be the minimum no. of cuts Add the reminder in any direction. Note : if there are n cuts in one direction,m cuts in another and p cuts in other then (m+1)(n+1)(p+1) is the max no. of pieces generated.

.To Find the minimum no of cuts required to produce n pieces is 3 {(n/3)-1)} .If its not a perfect square than divide it into multiples of three numbers with minimum difference between them.eg.x*y*z then no of pieces :x+y+z-3