general
Maths Puzzle
The maximum number of points of intersections of 8 circles are:
A)16 B)24 C)28 D)56
Read Solution (Total 3)
-
- . If there are m number of circles , They intersect each other in
2*(mc2) ways = m (m-1)= 2p2 ways
s0 8*(8-1)=8*7=56
56 point of intersection - 11 years agoHelpfull: Yes(3) No(0)
- n*(n-1)= 8*7= 56 points of intersection
- 11 years agoHelpfull: Yes(2) No(1)
- if there are n circles ... then max no of points of intersection are n*(n-1).
memory is imp - 11 years agoHelpfull: Yes(0) No(0)
general Other Question
I want the answer in table format
Attendees Age Class Sponsor
Helen
Shirley
Rich
Frank
Herald
Problem goes here:
In conjunction with some of our chocolatiers, a chocolate company recently offered several 1 hour classes on various aspects of chocolate at an adult education center. Each class was sponsored by one of our chocolatiers who donated samples and a grand prize that went to a lucky attendee whose name was drawn from a hat.
From the following clues determine the names and ages of the winners, the class they attended and the chocolatier who sponsored that class.
• Rich is older than the student enrolled in the History of Chocolate class that was sponsored by The Best Chocolate in Town.
• Helen attended the class sponsored by Joseph Schmidt.
• Frank who is 25, did not enroll in the How Chocolate is Made class, and the word "chocolate" did not appear in the name of the sponsoring chocolatier of his class.
• The youngest winner took the Baking with Chocolate class.
• The 22 year old who was not Shirley attended the class sponsored by Richard Donnelly Fine Chocolates.
• The winner of DeBrand's grand prize was younger than the winner in the Cooking with Chocolate class.
Here are the things you need to match.
Attendees: Helen,
Shirley,
Rich,
Frank,
Herald
Age: 21, 22, 25, 27, 28
Class: History of Chocolate,
How Chocolate is Made,
Cooking with Chocolate,
Baking with Chocolate,
Truffles 101
Sponsor: The Best Chocolate in Town,
Fudge Fatale,
Richard Donnelly Fine Chocolates,
DeBrand,
Joseph Schmidt
In mathematics country 1,2,3,4....,8,9 are nine cities. Cities which form a no. that is divisible by 3 are connected by air planes. (e.g. cities 1 & 2 form no. 12 which divisible by 3 then 1 is connected to city 2). Find the total no. of ways you can go to 8 if you are allowed to break the journeys.