MBA Alumni | MBA Students | MBA Aspirants | MBA Forums
--- MBA Home ---

CoolAvenues.com

offers
Advertising
Services

on the web  
 

Home     |    MBA Jobs      |     Knowledge Zone      |     Seminars      |     Placement Report      |     Admission Alert       |     café     |     Search

Article | "Overcoming Barriers in Logical Reasoning"

MBA Aspirants Zone

 Home

 MBA Aspirants' Home

 CAT 2009

 MBA Insider

 CAT Forum
 B-Schools' Profiles
 B-School FAQs

 Admission Alert

 CAT Preparation Group

 B-School News

 B-School Diary

 Career Resource Center

 MBA Forums

 Search
 Join e-Communities
 Mentor Program
 Be a CoolAssociate
 Give Suggestions

 Company Search
 
 

Subscribe:
Admission Alert
  Fed up keeping a track of admission details in News papers!
CoolAvenues brings you AdmissionAlert! A unique news letter which will keep you updated with admission notification of MBA institutes.
So subscribe and focus on your CAT preparation rather than collecting newspaper cuttings!


Latest Discussion on CoolAvenues Forums



Overcoming Barriers in Logical Reasoning

- TestFunda.com *

Previous

Page - 3

Suppose a mathematician X has co-authored papers with several other mathematicians. From among them, mathematician Y has the smallest Erdös number. Let the Erdös number of Y be y. Then X has an Erdös number of y+1. Hence, any mathematician with no co-authorship chain
connected to Erdös has an Erdös number of infinity.

In a seven day long mini-conference organized in memory of Paul Erdös, a close group of eight mathematicians, call them A, B, C, D, E, F, G and H, discussed some research problems. At the beginning of the conference, A was the only participant who had an infinite Erdös number. Nobody had an Erdös number less than that of F.

  • On the third day of the conference, F co-authored a paper jointly with A and C. This reduced the average Erdös number of the group of eight mathematicians to 3. The Erdös numbers of B, D, E, G and H remained unchanged with the writing of this paper. Further, no other co-authorship among any three members would have reduced the average Erdös number of the group of eight to as low as 3.

  • At the end of the third day, five members of this group had identical Erdös numbers while the other three had Erdös numbers distinct from each other.

  • On the fifth day, E co-authored a paper with F which reduced the group's average Erdös number by 0.5. The Erdös numbers of the remaining six were unchanged with the writing of this paper.

  • No other paper was written during the conference.

Q 1. The person having the largest Erdös number at the end of the conference must have had Erdös number (at that time): -
(1) 5
(2) 7
(3) 9
(4) 14
(5) 15

Q 2. How many participants in the conference did not change their Erdös number during the conference?
(1) 2
(2) 3
(3) 4
(4) 5
(5) Cannot be determined

Q 3. The Erdös number of C at the end of the conference was: -
(1) 1
(2) 2
(3) 3
(4) 4
(5) 5

Next


* Powered by TestFunda.com
Easy, effective & personalized, TestFunda.com is a store-house of information on everything to do with CAT. Right from personalized reports with FREE iCATS, Challenger iCATs, last 3 years solved CAT papers, to CAT Question of the Day, Daily CAT Word List, logical puzzles and Interactive Learning Games, TestFunda.com is a must visit for every serious CAT aspirant.


Post Your Comments       |       E-mail to Friend       |       Want to Contribute

Send this E-mail this Article
 







MBA Jobs
MBA Preparation
B-Schools
MBA Forums
About CoolAvenues
Senior Mgmt Jobs CAT / MAT/ CET Dean talk CAT Preparation Post a Job
Finance Jobs Admission Alert B-School Profile Executive MBA Advertise with Us
Marketing Jobs MBA Insider B-School Diary Career Help Contact us
HR MBA Jobs MBA Admission Process Summer GMAT Privacy
Operations MBA Jobs English Preparation MBA News Companies Copyrights
IT MBA Jobs MBA Abroad MBA Events B-Schools About CoolAenues
Consulting MBA Jobs CAT / MAT / CET test papers MBA Placements Summer Guidance
Resume Design Tips MBA in India Summers Guide Classifieds

© All Copyrights exclusive with Zebra Networks
Part or full of the contents can not be published, copied or reproduced
in any form without the prior written exclusive permission of Zebra Networks. Pls refer to CoolAvenues Copyright section.