Graphic representation of concepts using Euler circles. Logical problems and Euler circles. Compatible and incompatible concepts
Leonhard Euler - greatest of mathematicians wrote more than 850 scientific papers.In one of them these circles appeared.
The scientist wrote that“they are very suitable for facilitating our reflections.”
Euler circles is a geometric diagram that helps to find and/or make logical connections between phenomena and concepts more clear. It also helps to depict the relationship between a set and its part.
Problem 1Of the 90 tourists going on a trip, 30 people speak German, 28 people speak English, 42 people speak French.8 people speak English and German at the same time, 10 people speak English and French, 5 people speak German and French, 3 people speak all three languages. How many tourists don’t speak any language?
Solution:
Let's show the condition of the problem graphically - using three circles
Answer: 10 people.
Problem 2
Many children in our class love football, basketball and volleyball. And some even have two or three of these sports. It is known that 6 people from the class play only volleyball, 2 - only football, 5 - only basketball. Only 3 people can play volleyball and football, 4 can play football and basketball, 2 can play volleyball and basketball. One person from the class can play all the games, 7 can’t play any game. Need to find:
How many people are in the class?
How many people can play football?
How many people can play volleyball?
Problem 3
There were 70 children at the children's camp. Of these, 20 are involved in the drama club, 32 sing in the choir, 22 are fond of sports. There are 10 choir kids in the drama club, 6 athletes in the choir, 8 athletes in the drama club, and 3 athletes attend both the drama club and the choir. How many kids don’t sing in the choir, aren’t interested in sports, and aren’t involved in the drama club? How many guys are only involved in sports?
Problem 4
Of the company’s employees, 16 visited France, 10 – Italy, 6 – England. In England and Italy - five, in England and France - 6, in all three countries - 5 employees. How many people have visited both Italy and France, if the company employs 19 people in total, and each of them has visited at least one of these countries?
Problem 5
Sixth graders filled out a questionnaire asking about their favorite cartoons. It turned out that most of them liked “Snow White and the Seven Dwarfs,” “SpongeBob SquarePants,” and “The Wolf and the Calf.” There are 38 students in the class. 21 students like Snow White and the Seven Dwarfs. Moreover, three of them also like “The Wolf and the Calf,” six like “SpongeBob SquarePants,” and one child equally likes all three cartoons. “The Wolf and the Calf” has 13 fans, five of whom named two cartoons in the questionnaire. We need to determine how many sixth graders like SpongeBob SquarePants.
Problems for students to solve
1. There are 35 students in the class. All of them are readers of school and district libraries. Of these, 25 borrow books from the school library, 20 from the district library. How many of them:
a) are not readers of the school library;
b) are not readers of the district library;
c) are readers only of the school library;
d) are readers only of the district library;
e) are readers of both libraries?
2.Each student in the class studies English or German, or both. English is studied by 25 people, German by 27 people, and both by 18 people. How many students are there in the class?
3. On a sheet of paper, draw a circle with an area of 78 cm2 and a square with an area of 55 cm2. The area of intersection of a circle and a square is 30 cm2. The part of the sheet not occupied by the circle and square has an area of 150 cm2. Find the area of the sheet.
4. There are 25 people in the group of tourists. Among them, 20 people are under 30 years old and 15 people are over 20 years old. Could this be true? If so, in what case?
5. There are 52 children in the kindergarten. Each of them loves cake or ice cream, or both. Half of the children like cake, and 20 people like cake and ice cream. How many children love ice cream?
6. There are 36 people in the class. Pupils of this class attend mathematical, physical and chemical clubs, with 18 people attending the mathematical club, 14 - physical, 10 - chemical. In addition, it is known that 2 people attend all three clubs, 8 people attend both mathematical and physical, 5 - both mathematical and chemical, 3 - both physical and chemical circles. How many students in the class do not attend any clubs?
7. After the holidays, the class teacher asked which of the children went to the theater, cinema or circus. It turned out that out of 36 students, two had never been to the cinema, theater, or circus. 25 people attended the cinema; in the theater - 11; in the circus - 17; both in cinema and theater - 6; both in the cinema and in the circus - 10; both in the theater and in the circus - 4. How many people visited the theater, cinema and circus at the same time?
Solving Unified State Exam problems using Euler circles
Problem 1
In the search engine query language, the symbol "|" is used to denote the logical "OR" operation, and the symbol "&" is used for the logical "AND" operation.
Cruiser & Battleship? It is assumed that all questions are executed almost simultaneously, so that the set of pages containing all the searched words does not change during the execution of queries.
Request | Pages found (in thousands) |
Cruiser | Battleship | 7000 |
Cruiser | 4800 |
Battleship | 4500 |
Solution:
Using Euler circles we depict the conditions of the problem. In this case, we use the numbers 1, 2 and 3 to designate the resulting areas.
Based on the conditions of the problem, we create the equations:
- Cruiser | Battleship: 1 + 2 + 3 = 7000
- Cruiser: 1 + 2 = 4800
- Battleship: 2 + 3 = 4500
To find Cruiser & Battleship(indicated in the drawing as area 2), substitute equation (2) into equation (1) and find out that:
4800 + 3 = 7000, from which we get 3 = 2200.
Now we can substitute this result into equation (3) and find out that:
2 + 2200 = 4500, from which 2 = 2300.
Answer: 2300 - number of pages found by requestCruiser & Battleship.
Problem 2In search engine query language to denote
Request | Pages found (in thousands) |
Cakes | Pies | 12000 |
Cakes & Pies | 6500 |
Pies | 7700 |
How many pages (in thousands) will be found for the query? Cakes?
Solution
To solve the problem, let's display the sets of Cakes and Pies in the form of Euler circles.
A B C ).
From the problem statement it follows:
Cakes │Pies = A + B + C = 12000
Cakes & Pies = B = 6500
Pies = B + C = 7700
To find the number of Cakes (Cakes = A + B ), we need to find the sector A Cakes│Pies ) subtract the set of Pies.
Cakes│Pies – Pies = A + B + C -(B + C) = A = 1200 – 7700 = 4300
Sector A equals 4300, therefore
Cakes = A + B = 4300+6500 = 10800
Problem 3
|", and for the logical operation "AND" - the symbol "&".
Request | Pages found (in thousands) |
Cakes & Baking | 5100 |
Cake | 9700 |
Cake | Bakery | 14200 |
How many pages (in thousands) will be found for the query? Bakery?
It is believed that all queries were executed almost simultaneously, so that the set of pages containing all the searched words did not change during the execution of the queries.
Solution
To solve the problem, we display the sets Cakes and Baking in the form of Euler circles.
Let us denote each sector with a separate letter ( A B C ).
From the problem statement it follows:
Cakes & Pastries = B = 5100
Cake = A + B = 9700
Cake │ Pastries = A + B + C = 14200
To find the quantity of Baking (Baking = B + C ), we need to find the sector IN , for this from the general set ( Cake │ Baking) subtract the set Cake.
Cake │ Baking – Cake = A + B + C -(A + B) = C = 14200–9700 = 4500Sector B is equal to 4500, therefore Baking = B + C = 4500+5100 = 9600
Problem 4descending
To indicateThe logical operation "OR" uses the symbol "|", and for the logical operation "AND" - the symbol "&".
Solution
Let's imagine sets of shepherd dogs, terriers and spaniels in the form of Euler circles, denoting the sectors with letters (
A B C D ).With paniels │(terriers & shepherds) = G + B
With paniel│shepherd dogs= G + B + C
spaniels│terriers│shepherds= A + B + C + D
terriers & shepherds = B
Let's arrange the request numbers in descending order of the number of pages:3 2 1 4
Problem 5The table shows queries to the search server. Place the request numbers in order increasing the number of pages that the search engine will find for each request.
To indicateThe logical operation "OR" uses the symbol "|", and for the logical operation "AND" - the symbol "&".
1 | baroque | classicism | empire style |
2 | baroque | (classicism & empire style) |
3 | classicism & empire style |
4 | baroque | classicism |
Solution
Let us imagine the sets classicism, empire style and classicism in the form of Euler circles, denoting the sectors with letters ( A B C D ).
Let us transform the problem condition in the form of a sum of sectors:
baroque│ classicism│empire = A + B + C + DBaroque │(classicism & empire) = G + B
classicism & empire style = B
baroque│classicism = G + B + A
From the sector sums we see which request produced more pages.
Let's arrange the request numbers in ascending order of the number of pages:3 2 4 1
Problem 6
The table shows queries to the search server. Place the request numbers in order increasing the number of pages that the search engine will find for each request.
To indicateThe logical operation "OR" uses the symbol "|", and for the logical operation "AND" - the symbol "&".
1 | canaries | goldfinches | content
|
2 | canaries & content |
3 | canaries & goldfinches & contents |
4 | breeding & keeping & canaries & goldfinches |
Solution
To solve the problem, let's imagine queries in the form of Euler circles.
K - canaries,
Ш – goldfinches,
R – breeding.
canaries | terriers | content | canaries & content | canaries & goldfinches & contents | breeding & keeping & canaries & goldfinches |
The first request has the largest area of shaded sectors, then the second, then the third, and the fourth request has the smallest.
In ascending order by number of pages, requests will be presented in the following order: 4 3 2 1
Please note that in the first request, the filled sectors of the Euler circles contain the filled sectors of the second request, and the filled sectors of the second request contain the filled sectors of the third request, and the filled sectors of the third request contain the filled sector of the fourth request.
Only under such conditions can we be sure that we have solved the problem correctly.
Problem 7 (Unified State Exam 2013)
In the search engine query language, the symbol "|" is used to denote the logical "OR" operation, and the symbol "&" is used for the logical "AND" operation.
The table shows the queries and the number of pages found for a certain segment of the Internet.
Request | Pages found (in thousands) |
---|---|
Frigate | Destroyer | 3400 |
Frigate & Destroyer | 900 |
Frigate | 2100 |
How many pages (in thousands) will be found for the query? Destroyer?
It is believed that all queries were executed almost simultaneously, so that the set of pages containing all the searched words did not change during the execution of the queries.
Euler circles- one of the simplest themes that you need for admission to the 5th grade of physics and mathematics lyceums. In fact, Euler circles is nothing more than a graphical representation of sets. Objects with a certain property are located inside Euler-Venn circle those who do not possess are outside. Of course, usually the diagram contains not one circle, but several, each of which combines objects with some kind of property. Any task from this block boils down to the fact that it is necessary to count the number of elements in any area. Let's look at examples of what needs to be done:
Tasks for many people
There are students in the class. study English, German and French. People don't know any language. It is also known that of all the children, only one boy studies languages: English and French. How many people study a language?
To solve the problem, let's denote the number of required students as (those who study the language). The number of students studying a different number of languages can be expressed through and the conditions in the problem. Euler-Venn diagram in this case it will look like this: For example, guys who know only English are indicated in red and their number.
Note that we have not used the total number of students in any way - this condition will generate the very equation with which the problem will be solved:
It turns out that all languages are studied by humans (Now, knowing , you can independently reconstruct how many students were in the class and check the answer)
Divisibility problems (complex divisibility)
These are tasks of increased complexity. We recommend that you study the topic first. A must-read only for those who are planning to win prizes.
For how many numbers between and is the following statement true: the number is divisible by or not divisible by?
Such a terrible and incomprehensible condition becomes simple if you use Euler circles. It is clear that in this problem we consider numbers that - we are interested in those inside the corresponding circle. There are also numbers that vdots 12 - we are interested in the numbers that are outside. But what about the numbers that belong to both sets? Firstly, what common property do they have, and secondly, are they of interest to us?
Let's answer the first question first. It turns out that if a number is simultaneously divisible by two other numbers, then it is divisible by Least Common Multiple these two numbers, that is, by the minimum number that is divisible without a remainder by both of them. For numbers and LCM there is nothing more than the number , since and , and there is no smaller number with such properties. In total, at the intersection of our sets there are numbers that .
Next, it should be noted that the word is used in the condition "OR". This means that for the required numbers, AT LEAST ONE of the proposed statements must be true (possibly both). That is, we are suitable for numbers that are inside the circle of numbers, which are, as well as all the numbers that are outside the circle.
So, Euler-Venn diagram looks like this: The shading indicates the numbers that need to be found. Now, I hope, it is obvious that we need to find how many numbers there are in the problem under consideration, from this quantity subtract the number of numbers that and add the number of numbers that .
So let's get started:
It turns out that the required numbers
So, let's summarize. If you are going enter the 5th grade of the physics and mathematics lyceum, then general knowledge of Euler-Venn circles You need it. The main area of application is problems where there are sets of objects that have certain properties, and it is necessary to find the number of objects that have (or do not have) a set of specified properties.
Sections: Computer science
1. Introduction
In the course of Computer Science and ICT of the basic and senior school, such important topics as “Fundamentals of Logic” and “Searching for Information on the Internet” are discussed. When solving a certain type of problem, it is convenient to use Euler circles (Euler-Venn diagrams).
Mathematical reference. Euler-Venn diagrams are used primarily in set theory as a schematic representation of all possible intersections of several sets. In general, they represent all 2 n combinations of n properties. For example, with n=3, the Euler-Venn diagram is usually depicted as three circles with centers at the vertices of an equilateral triangle and the same radius, approximately equal to the length of the side of the triangle.
2. Representation of logical connectives in search queries
When studying the topic “Searching for information on the Internet”, examples of search queries using logical connectives, similar in meaning to the conjunctions “and”, “or” of the Russian language, are considered. The meaning of logical connectives becomes clearer if you illustrate them using a graphical diagram - Euler circles (Euler-Venn diagrams).
Logical connective | Example request | Explanation | Euler circles |
& - "AND" | Paris & university | All pages that mention both words: Paris and university will be selected | Fig.1 |
| - "OR" | Paris | university | All pages where the words Paris and/or university are mentioned will be selected | Fig.2 |
3. Connection of logical operations with set theory
Euler-Venn diagrams can be used to visualize the connection between logical operations and set theory. For demonstration, you can use the slides in Annex 1.
Logical operations are specified by their truth tables. IN Appendix 2 Graphic illustrations of logical operations along with their truth tables are discussed in detail. Let us explain the principle of constructing a diagram in the general case. In the diagram, the area of the circle with the name A displays the truth of statement A (in set theory, circle A is the designation of all elements included in a given set). Accordingly, the area outside the circle displays the “false” value of the corresponding statement. To understand which area of the diagram will display a logical operation, you need to shade only those areas in which the values of the logical operation on sets A and B are equal to “true”.
For example, the implication value is true in three cases (00, 01, and 11). Let's shade sequentially: 1) the area outside the two intersecting circles, which corresponds to the values A=0, B=0; 2) an area related only to circle B (crescent), which corresponds to the values A=0, B=1; 3) the area related to both circle A and circle B (intersection) - corresponds to the values A=1, B=1. The combination of these three areas will be a graphical representation of the logical operation of implication.
4. Use of Euler circles in proving logical equalities (laws)
In order to prove logical equalities, you can use the Euler-Venn diagram method. Let us prove the following equality ¬(АvВ) = ¬А&¬В (de Morgan's law).
To visually represent the left side of the equality, let’s do it sequentially: shade both circles (apply disjunction) with gray color, then to display the inversion, shade the area outside the circles with black color:
Fig.3 Fig.4
To visually represent the right side of the equality, let’s do it sequentially: shade the area for displaying the inversion (¬A) in gray and, similarly, the area ¬B also in gray; then to display the conjunction you need to take the intersection of these gray areas (the result of the overlay is represented in black):
Fig.5 Fig.6 Fig.7
We see that the areas for displaying the left and right parts are equal. Q.E.D.
5. Problems in the State Examination and Unified State Exam format on the topic: “Searching for information on the Internet”
Problem No. 18 from the demo version of GIA 2013.
The table shows queries to the search server. For each request, its code is indicated - the corresponding letter from A to G. Arrange the request codes from left to right in order descending the number of pages that the search engine will find for each request.
Code | Request |
A | (Fly & Money) | Samovar |
B | Fly & Money & Bazaar & Samovar |
IN | Fly | Money | Samovar |
G | Fly & Money & Samovar |
For each query, we will build an Euler-Venn diagram:
Request A | Request B | Request B | Request G |
Answer: VAGB.
Problem B12 from the demo version of the Unified State Exam 2013.
The table shows the queries and the number of pages found for a certain segment of the Internet.
Request | Pages found (in thousands) |
Frigate | Destroyer | 3400 |
Frigate & Destroyer | 900 |
Frigate | 2100 |
How many pages (in thousands) will be found for the query? Destroyer?
It is believed that all queries were executed almost simultaneously, so that the set of pages containing all the searched words did not change during the execution of the queries.
Ф – number of pages (in thousands) on request Frigate;
E – number of pages (in thousands) on request Destroyer;
X – number of pages (in thousands) for a query that mentions Frigate And Not mentioned Destroyer;
Y – number of pages (in thousands) for a query that mentions Destroyer And Not mentioned Frigate.
Let's build Euler-Venn diagrams for each query:
Request | Euler-Venn diagram | Number of pages |
Frigate | Destroyer | Fig.12 | 3400 |
Frigate & Destroyer | Fig.13 | 900 |
Frigate | Fig.14 | 2100 |
Destroyer | Fig.15 | ? |
According to the diagrams we have:
- X + 900 + Y = F + Y = 2100 + Y = 3400. From here we find Y = 3400-2100 = 1300.
- E = 900+U = 900+1300= 2200.
Answer: 2200.
6. Solving logical meaningful problems using the Euler-Venn diagram method
There are 36 people in the class. Pupils of this class attend mathematical, physics and chemical circles, with 18 people attending the mathematical circle, 14 people attending the physical circle, 10 people attending the chemical circle. In addition, it is known that 2 people attend all three circles, 8 people attend both mathematical and physical, 5 and mathematical and chemical, 3 - both physical and chemical.
How many students in the class do not attend any clubs?
To solve this problem, it is very convenient and intuitive to use Euler circles.
The largest circle is the set of all students in the class. Inside the circle there are three intersecting sets: members of the mathematical ( M), physical ( F), chemical ( X) circles.
Let MFC- a lot of guys, each of whom attends all three clubs. MF¬X- a lot of kids, each of whom attends math and physics clubs and Not visits chemical. ¬M¬FH- a lot of guys, each of whom attends the chemistry club and does not attend the physics and mathematics clubs.
Similarly, we introduce sets: ¬МФХ, М¬ФХ, М¬Ф¬Х, ¬МФ¬Х, ¬М¬Ф¬Х.
It is known that all three circles are attended by 2 people, therefore, in the region MFC Let's enter the number 2. Because 8 people attend both mathematical and physical circles, and among them there are already 2 people attending all three circles, then in the region MF¬X let's enter 6 people (8-2). Let us similarly determine the number of students in the remaining sets:
Let's sum up the number of people in all regions: 7+6+3+2+4+1+5=28. Consequently, 28 people from the class attend clubs.
This means 36-28 = 8 students do not attend clubs.
After the winter holidays, the class teacher asked which of the children went to the theater, cinema or circus. It turned out that out of 36 students in the class, two had never been to the cinema. neither in the theater nor in the circus. 25 people went to the cinema, 11 to the theater, 17 to the circus; both in cinema and theater - 6; both in the cinema and in the circus - 10; and in the theater and circus - 4.
How many people have been to the cinema, the theater, and the circus?
Let x be the number of children who have been to the cinema, the theater, and the circus.
Then you can build the following diagram and count the number of guys in each area:
6 people visited the cinema and theater, which means only 6 people went to the cinema and theater. Similarly, only in cinema and circus (10th) people. Only in theater and circus (4) people. 25 people went to the cinema, which means that 25 of them only went to the cinema - (10's) - (6's) - x = (9+x). Similarly, only in the theater there were (1+x) people. Only there were (3+x) people in the circus. Haven’t been to the theatre, cinema or circus – 2 people. This means 36-2=34 people. attended events. On the other hand, we can sum up the number of people who were in the theater, cinema and circus: (9+x)+(1+x)+(3+x)+(10's)+(6's)+(4's)+x = 34 It follows that only one person attended all three events. |
Thus, Euler circles (Euler-Venn diagrams) find practical application in solving problems in the Unified State Examination and State Examination format and in solving meaningful logical problems.
Literature
- V.Yu. Lyskova, E.A. Rakitina. Logic in computer science. M.: Informatics and Education, 2006. 155 p.
- L.L. Bosova. Arithmetic and logical foundations of computers. M.: Informatics and Education, 2000. 207 p.
- L.L. Bosova, A.Yu. Bosova. Textbook. Computer science and ICT for grade 8: BINOM. Knowledge Laboratory, 2012. 220 p.
- L.L. Bosova, A.Yu. Bosova. Textbook. Computer science and ICT for grade 9: BINOM. Knowledge Laboratory, 2012. 244 p.
- FIPI website: http://www.fipi.ru/
Each object or phenomenon has certain properties (signs).
It turns out that forming a concept about an object means, first of all, the ability to distinguish it from other objects similar to it.
We can say that a concept is the mental content of a word.
Concept - it is a form of thought that displays objects in their most general and essential characteristics.
A concept is a form of thought, and not a form of a word, since a word is only a label with which we mark this or that thought.
Words can be different, but still mean the same concept. In Russian - “pencil”, in English - “pencil”, in German - bleistift. The same thought has different verbal expressions in different languages.
RELATIONS BETWEEN CONCEPTS. EULER CIRCLES.
Concepts that have common features in their content are called COMPARABLE(“lawyer” and “deputy”; “student” and “athlete”).
Otherwise, the concepts are considered INCOMPARABLE(“crocodile” and “notebook”; “man” and “steamboat”).
If, in addition to common features, concepts also have common elements of volume, then they are called COMPATIBLE.
There are six types of relationships between comparable concepts. It is convenient to denote relationships between the scopes of concepts using Euler circles (circular diagrams where each circle denotes the scope of a concept).
KIND OF RELATIONSHIP BETWEEN CONCEPTS | IMAGE USING EULER CIRCLES |
EQUIVALITY (IDENTITY) The scopes of the concepts completely coincide. Those. These are concepts that differ in content, but the same elements of volume are thought of in them. | 1) A - Aristotle B - founder of logic 2) A - square B - equilateral rectangle |
SUBORDINATION (SUBORDINATION) The scope of one concept is completely included in the scope of another, but does not exhaust it. | 1) A - person B - student 2) A - animal B - elephant |
INTERSECTION (CROSSING) The volumes of two concepts partially coincide. That is, concepts contain common elements, but also include elements that belong to only one of them. | 1) A - lawyer B - deputy 2) A - student B - athlete |
COORDINATION (COORDINATION) Concepts that do not have common elements are completely included in the scope of the third, broader concept. | 1) A - animal B - cat; C - dog; D - mouse 2) A - precious metal B - gold; C - silver; D - platinum |
OPPOSITE (CONTRAPARITY) Concepts A and B are not simply included in the scope of the third concept, but seem to be at its opposite poles. That is, concept A has in its content such a feature, which in concept B is replaced by the opposite one. | 1) A - white cat; B - red cat (cats are both black and gray) 2) A - hot tea; iced tea (tea can also be warm) I.e. concepts A and B do not exhaust the entire scope of the concept they are included in. |
CONTRADITION (CONTRADITIONALITY) The relationship between concepts, one of which expresses the presence of some characteristics, and the other - their absence, that is, it simply denies these characteristics, without replacing them with any others. | 1) A - tall house B - low house 2) A - winning ticket B - non-winning ticket I.e. the concepts A and not-A exhaust the entire scope of the concept into which they are included, since no additional concept can be placed between them. |
Exercise : Determine the type of relationship based on the scope of the concepts below. Draw them using Euler circles.
1) A - hot tea; B - iced tea; C - tea with lemon
Hot tea (B) and iced tea (C) are in an opposite relationship.
Tea with lemon (C) can be either hot,
so cold, but it can also be, for example, warm.
2)A- wood; IN- stone; WITH- structure; D- house.
Is every building (C) a house (D)? - No.
Is every house (D) a building (C)? - Yes.
Something wooden (A) is it necessarily a house (D) or a building (C) - No.
But you can find a wooden structure (for example, a booth),
You can also find a wooden house.
Something made of stone (B) is not necessarily a house (D) or building (C).
But there may be a stone building or a stone house.
3)A- Russian city; IN- capital of Russia;
WITH- Moscow; D- city on the Volga; E- Uglich.
The capital of Russia (B) and Moscow (C) are the same city.
Uglich (E) is a city on the Volga (D).
At the same time, Moscow, Uglich, like any city on the Volga,
are Russian cities (A)