how to prove cardinality of sets

... Cardinality of the Sets 1. Theorem . The above rule is usually sufficient for the purpose of this book. ... Let $A$ and $B$ be sets. Thus, every congruence class of fset_expr under relation eq_fset has a unique cardinality. S and T have the same cardinality if there is a bijection f from S to T. Notation: means that S and T have the same cardinality. The number of elements in a set is called the cardinality of the set. The sets A and B have the same cardinality if and only if there is a one-to-one correspondence from A to B. The function f : … | A | = | N | = ℵ0. a proof, we can argue in the following way. First Published 2019. Click here to navigate to parent product. Let us come to know about the following terms in details. Cardinality of Sets book. more concrete, here we provide some useful results that help us prove if a set is countable or not. Proving that two sets have the same cardinality via exhibiting a bijection is a straightforward process... once you've found the bijection. We prove this is an equivalence class. but you cannot list the elements in an uncountable set. For in nite sets, this strategy doesn’t quite work. Definition. Show that the cardinality of the set of prime numbers is the same as the cardinality of N+ ; Hi Tania, These are all mental games with 'infinite sets'. Before discussing there'll be 2^3 = 8 elements contained in the ability set. $$|W|=10$$ On the other hand, it … Cardinality Recall (from our first lecture!) A set is an infinite set provided that it is not a finite set. Ex 4.7.3 Show that the following sets of real numbers have the same cardinality: a) $(0,1)$, $(1, \infty)$ b) $(1,\infty)$, $(0,\infty)$. As far as applied probability De nition 2. set which is a contradiction. Cardinality and Bijections Definition: Set A has the same cardinality as set B, denoted |A| = |B|, if there is a bijection from A to B – For finite sets, cardinality is the number of elements – There is a bijection from n-element set A to {1, 2, 3, …, n} Following Ernie Croot's slides Thus, any set in this form is countable. correspondence with natural numbers $\mathbb{N}$. For example, you can write. We say that two sets A and B have the same cardinality, written |A|=|B|, if there exists a bijective function from A to B. Then, the above bijections show that (a,b) and [a,b] have the same cardinality. Also, it is reasonable to assume that $W$ and $R$ are disjoint, $|W \cap R|=0$. How to prove that all maximal independent sets of a matroid have the same cardinality. The second part of the theorem can be proved using the first part. To this final end, I will apply the Cantor-Bernstein Theorem: (The two sets (0, 1) and [0, 1] have the same cardinality if we can find 1-1 mappings from (0, 1) to [0, 1] and vice versa.) If a set has an infinite number of elements, its cardinality is ∞. n(AuB) = Total number of elements related to any of the two events A & B. n(AuBuC) = Total number of elements related to any of the three events A, B & C. n(A) = Total number of elements related to A. n(B) = Total number of elements related to B. n(C) = Total number of elements related to C. Total number of elements related to A only. No. Thus to prove that a set is finite we have to discover a bijection between the set {0,1,2,…,n-1} to the set. Solving linear equations using elimination method, Solving linear equations using substitution method, Solving linear equations using cross multiplication method, Solving quadratic equations by quadratic formula, Solving quadratic equations by completing square, Nature of the roots of a quadratic equations, Sum and product of the roots of a quadratic equations, Complementary and supplementary worksheet, Complementary and supplementary word problems worksheet, Sum of the angles in a triangle is 180 degree worksheet, Special line segments in triangles worksheet, Proving trigonometric identities worksheet, Quadratic equations word problems worksheet, Distributive property of multiplication worksheet - I, Distributive property of multiplication worksheet - II, Writing and evaluating expressions worksheet, Nature of the roots of a quadratic equation worksheets, Determine if the relationship is proportional worksheet, Trigonometric ratios of some specific angles, Trigonometric ratios of some negative angles, Trigonometric ratios of 90 degree minus theta, Trigonometric ratios of 90 degree plus theta, Trigonometric ratios of 180 degree plus theta, Trigonometric ratios of 180 degree minus theta, Trigonometric ratios of 270 degree minus theta, Trigonometric ratios of 270 degree plus theta, Trigonometric ratios of angles greater than or equal to 360 degree, Trigonometric ratios of complementary angles, Trigonometric ratios of supplementary angles, Domain and range of trigonometric functions, Domain and range of inverse trigonometric functions, Sum of the angle in a triangle is 180 degree, Different forms equations of straight lines, Word problems on direct variation and inverse variation, Complementary and supplementary angles word problems, Word problems on sum of the angles of a triangle is 180 degree, Domain and range of rational functions with holes, Converting repeating decimals in to fractions, Decimal representation of rational numbers, L.C.M method to solve time and work problems, Translating the word problems in to algebraic expressions, Remainder when 2 power 256 is divided by 17, Remainder when 17 power 23 is divided by 16, Sum of all three digit numbers divisible by 6, Sum of all three digit numbers divisible by 7, Sum of all three digit numbers divisible by 8, Sum of all three digit numbers formed using 1, 3, 4, Sum of all three four digit numbers formed with non zero digits, Sum of all three four digit numbers formed using 0, 1, 2, 3, Sum of all three four digit numbers formed using 1, 2, 5, 6, Equations of horizontal and vertical lines, Equation of Horizontal and Vertical Lines Worksheet, Comparing Slopes of Two Lines - Concept - Examples, In a group of students, 65 play foot ball, 45 play hockey, 42 play cricket, 20 play foot ball and hockey, 25 play foot ball and cricket, 15 play hockey and cricket and 8 play all the three games. … Generally, for $n$ finite sets $A_1, A_2, A_3,\cdots, A_n$, we can write, Let $W$, $R$, and $B$, be the number of people with white shirts, red shirts, and black shoes where one type is significantly "larger" than the other. This is a contradiction. where $a < b$ is uncountable. Thus according to Deﬁnition 2.3.1, the sets N and Z have the same cardinality. The above theorems confirm that sets such as $\mathbb{N}, \mathbb{Z}, \mathbb{Q}$ and their Example 1. For two finite sets $A$ and $B$, we have Now, we create a list containing all elements in $A \times B = \{(a_i,b_j) | i,j=1,2,3,\cdots \}$. $\mathbb{Z}=\{0,1,-1,2,-2,3,-3,\cdots\}$. Total number of elements related to both B & C. Total number of elements related to both (B & C) only. Cantor showed that not all in・］ite sets are created equal 窶・his de・］ition allows us to distinguish betweencountable and uncountable in・］ite sets. For example, we can match 1 to a, 2 to b, or 3 to c. Comparing cardinalities ﬁnite sets is The difference between the two types is Cardinality of inﬁnite sets The cardinality |A| of a ﬁnite set A is simply the number of elements in it. Set $A$ is called countable if one of the following is true. refer to Figure 1.16 in Problem 2 to see this pictorially). Example 9.1.7. In order to prove that two sets have the same cardinality one must find a bijection between them. $$|R \cap B|=3$$ (Hint: you can arrange $\Q^+$ in a sequence; use this to arrange $\Q$ into a sequence.) Thus by applying CARDINALITY OF SETS Corollary 7.2.1 suggests a way that we can start to measure the \size" of in nite sets. If $A$ is countably infinite, then we can list the elements in $A$, In mathematics, a set is a well-defined collection of distinct elements or members. if it is a finite set, $\mid A \mid < \infty$; or. (Assume that each student in the group plays at least one game). Any subset of a countable set is countable. A set A is said to be countably in nite or denumerable if there is a bijection from the set N of natural numbers onto A. Question: Prove that N(all natural numbers) and Z(all integers) have the same cardinality. This fact can be proved using a so-called diagonal argument, and we omit Discrete Mathematics - Cardinality 17-16 More Countable Sets (cntd) To provide thus by subtracting it from $|A|+|B|$, we obtain the number of elements in $|A \cup B |$, (you can set is countable. To see this, note that when we add $|A|$ and $|B|$, we are counting the elements in $|A \cap B|$ twice, Hence these sets have the same cardinality. If $A$ and $B$ are countable, then $A \times B$ is also countable. By Gove Effinger, Gary L. Mullen. Furthermore, we designate the cardinality of countably infinite sets as ℵ0 ("aleph null"). We will say that any sets A and B have the same cardinality, and write jAj= jBj, if A and B can be put into 1-1 correspondence. However, as we mentioned, intervals in $\mathbb{R}$ are uncountable. Consider sets A and B.By a transformation or a mapping from A to B we mean any subset T of the Cartesian product A×B that satisfies the following condition: . Discrete Mathematics and Its Applications, Seventh Edition answers to Chapter 2 - Section 2.5 - Cardinality of Sets - Exercises - Page 176 12 including work step by step written by community members like you. that you can list the elements of a countable set $A$, i.e., you can write $A=\{a_1, a_2,\cdots\}$, When it ... prove the corollary one only has to observe that a function with a “right inverse” is the “left inverse” of that function and vice versa. Definition of cardinality. I have tried proving set S as one to one corresponding to natural number set in binary form. of students who play both (foot ball & hockey) only = 12, No. On the other hand, you cannot list the elements in $\mathbb{R}$, is concerned, this guideline should be sufficient for most cases. Finite Sets • A set is finite when its cardinality is a natural number. Consider the sets {a,b,c,d} and {1,2,3,Calvin}. It suffices to create a list of elements in $\bigcup_{i} A_i$. That is often difficult, however. The set whose elements are each and each and every of the subsets is the ability set. 11 Cardinality Rules ... two sets, then the sets have the same size. If A can be put into 1-1 correspondence with a subset of B (that is, there is a 1-1 For infinite sets the cardinality is either said to be countable or uncountable. If $A_1, A_2,\cdots$ is a list of countable sets, then the set $\bigcup_{i} A_i=A_1 \cup A_2 \cup A_3\cdots$ Any set which is not finite is infinite. In particular, one type is called countable, then talk about infinite sets. Let X m = fq 2Q j0 q 1; and mq 2Zg. Now that we know about functions and bijections, we can define this concept more formally and more rigorously. The idea is exactly the same as before. It turns out we need to distinguish between two types of infinite sets, $$\biggl|\bigcup_{i=1}^n A_i\biggr|=\sum_{i=1}^n\left|A_i\right|-\sum_{i < j}\left|A_i\cap A_j\right|$$ In case, two or more sets are combined using operations on sets, we can find the cardinality using the formulas given below. Having proven that, we need only observe that in the notation we used, for any natural number n, there exists a prime p_n. Alternative Method (Using venn diagram) : Venn diagram related to the information given in the question : Apart from the stuff given above, if you need any other stuff in math, please use our google custom search here. It would be a good exercise for you to try to prove this to yourself now. When a set Ais nite, its cardinality is the number of elements of the set, usually denoted by jAj. Two sets are equal if and only if they have precisely the same elements. Beginning in the late 19th century, this concept was generalized to infinite sets, which allows one to distinguish between the different types of infinity, and to perform arithmetic on them. In case, two or more sets are combined using operations on sets, we can find the cardinality using the formulas given below. In addition, we say that the empty set has cardinality 0 (or cardinal number 0), and we write $\text{card}(\emptyset) = 0$. Total number of elements related to both (A & B) only. is also countable. Total number of elements related to both A & B. Cardinality Lectures Enrique Trevino~ November 22, 2013 1 De nition of cardinality The cardinality of a set is a measure of the size of a set. I can tell that two sets have the same number of elements by trying to pair the elements up. Figure 1.13 shows one possible ordering. if you need any other stuff in math, please use our google custom search here. Fix m 2N. $$|R|=8$$ In class on Monday we went over the more in depth definition of cardinality. Before we start developing theorems, let’s get some examples working with the de nition of nite sets. We can, however, try to match up the elements of two inﬁnite sets A and B one by one. Mathematics 220 Workshop Cardinality Some harder problems on cardinality. Let $A$ be a countable set and $B \subset A$. Consider a set $A$. In this case the cardinality is denoted by @ 0 (aleph-naught) and we write jAj= @ 0. We first discuss cardinality for finite sets and then talk about infinite sets. A = \left\ { {1,2,3,4,5} \right\}, \Rightarrow \left| A \right| = 5. Cantor introduced a new de・］ition for the 窶徭ize窶・of a set which we call cardinality. Good trap, Dr Ruff. (useful to prove a set is finite) • A set is infinite when there … Build up the set from sets with known cardinality, using unions and cartesian products, and use the above results on countability of unions and cartesian products. We first discuss cardinality for finite sets and then talk about infinite sets. Cardinality of inﬁnite sets The cardinality |A| of a ﬁnite set A is simply the number of elements in it. But as soon as we ﬁgure out the size (useful to prove a set is finite) • A set is infinite when there is an injection, f:AÆA, such that f(A) is … n(FnH) = 20, n(FnC) = 25, n(HnC) = 15. We can extend the same idea to three or more sets. the idea of comparing the cardinality of sets based on the nature of functions that can be possibly de ned from one set to another. This is because we can write Edition 1st Edition. However, I am stuck in proving it since there are more than one "1", "01" = "1", same as other numbers. 2.5 Cardinality of Sets De nition 1. As seen, the symbol for the cardinality of a set resembles the absolute value symbol — a variable sandwiched between two vertical lines. Math 127: In nite Cardinality Mary Radcli e 1 De nitions Recall that when we de ned niteness, we used the notion of bijection to de ne the size of a nite set. If $A$ has only a finite number of elements, its cardinality is simply the Examples of Sets with Equal Cardinalities. Imprint CRC Press. The intuition behind this theorem is the following: If a set is countable, then any "smaller" set To formulate this notion of size without reference to the natural numbers, one might declare two finite sets A A A and B B B to have the same cardinality if and only if there exists a bijection A → B A \to B A → B. and how to prove set S is a infinity set. Total number of elements related to both A & C. Total number of elements related to both (A & C) only. c) $(0,\infty)$, $\R$ d) $(0,1)$, $\R$ Ex 4.7.4 Show that $\Q$ is countably infinite. onto). while the other is called uncountable. \mathbb {N} We can say that set A and set B both have a cardinality of 3. That is, there are 7 elements in the given set A. so it is an uncountable set. Is it possible? Both set A={1,2,3} and set B={England, Brazil, Japan} have a cardinal number of 3; that is, n(A)=3, and n(B)=3. Sets such as $\mathbb{N}$ and $\mathbb{Z}$ are called countable, of students who play hockey only = 18, No. DOI link for Cardinality of Sets. Thus to prove that a set is finite we have to discover a bijection between the set {0,1,2,…,n-1} to the set. Thus, we have. of students who play both foot ball and cricket = 25, No. Since A and B have the same cardinality there is a bijection between A and B. Math 131 Fall 2018 092118 Cardinality - Duration: 47:53. Also there's a question that asks to show {clubs, diamonds, spades, hearts} has the same cardinality as {9, -root(2), pi, e} and there is definitely not function that relates those two sets that I am aware of. Formula 1 : n(A u B) = n(A) + n(B) - n(A n B) If A and B are disjoint sets, n(A n B) = 0 Then, n(A u B) = n(A) + n(B) Formula 2 : n(A u B u C) = n(A) + n(B) + n(C) - n(A … These are two series of problems with speciﬁc goals: the ﬁrst goal is to prove that the cardinality of the set of irrational numbers is continuum, and the second is to prove that the cardinality of R× Ris continuum, without using Cantor-Bernstein-Schro¨eder Theorem. (2) This is just induction and bookkeeping. number of elements in $A$. We first discuss cardinality for finite sets and countable, we can write To prove that a given in nite set X … you can never provide a list in the form of $\{a_1, a_2, a_3,\cdots\}$ that contains all the I've found other answers that say I need to find a bijection between the two sets, but I don't know how to do that. I have tried proving set S as one to one corresponding to natural number set in binary form. $$|W \cap B|=4$$ De nition 3.5 (i) Two sets Aand Bare equicardinal (notation jAj= jBj) if there exists a bijective function from Ato B. Venn diagram related to the above situation : From the venn diagram, we can have the following details. The cardinality of a set is defined as the number of elements in a set. should also be countable, so a subset of a countable set should be countable as well. For in nite sets, this strategy doesn’t quite work. subsets are countable. Itiseasytoseethatanytwoﬁnitesetswiththesamenumberofelementscanbeput into1-1correspondence. respectively. However, to make the argument If you are less interested in proofs, you may decide to skip them. Cardinality of a Set Definition. For finite sets, cardinalities are natural numbers: |{1, 2, 3}| = 3 |{100, 200}| = 2 For infinite sets, we introduced infinite cardinals to denote the size of sets: To be precise, here is the definition. Textbook Authors: Rosen, Kenneth, ISBN-10: 0073383090, ISBN-13: 978-0-07338-309-5, Publisher: McGraw-Hill Education Cardinality The cardinality of a set is roughly the number of elements in a set. Total number of students in the group is n(FuHuC). When it comes to inﬁnite sets, we no longer can speak of the number of elements in such a set. Cardinality and Bijections Definition: Set A has the same cardinality as set B, denoted |A| = |B|, if there is a bijection from A to B – For finite sets, cardinality is the number of elements – There is a bijection from n-element set A to {1, 2, 3, …, n} Following Ernie Croot's slides of students who play all the three games = 8. The set of all real numbers in the interval (0;1). Show that if A and B are sets with the same cardinality, then the power set of A and the power set of B have the same cardinality. \mathbb {R}. The number is also referred as the cardinal number. The two sets A = {1,2,3} and B = {a,b,c} thus have the cardinality since we can match up the elements of the two sets in such a way that each element in each set is matched with exactly one element in the other set. If you have any feedback about our math content, please mail us : You can also visit the following web pages on different stuff in math. }\) This definition does not specify what we mean by the cardinality of a set and does not talk about the number of elements in a set. uncountable set (to prove uncountability). A set A is said to have cardinality n (and we write jAj= n) if there is a bijection from f1;:::;ngonto A. case the set is said to be countably infinite. Theorem. Cardinality of Sets . $$C=\bigcup_i \bigcup_j \{ a_{ij} \},$$ The cardinality of a finite set is the number of elements in the set. This important fact is commonly known ... aged to prove that two very different sets are actually the same size—even though we don’t know exactly how big either one is. 1. Set S is a set consisting of all string of one or more a or b such as "a, b, ab, ba, abb, bba..." and how to prove set S is a infinity set. In a group of students, 65 play foot ball, 45 play hockey, 42 play cricket, 20 play foot ball and hockey, 25 play foot ball and cricket, 15 play hockey and cricket and 8 play all the three games. What if $A$ is an infinite set? For example, if $A=\{2,4,6,8,10\}$, then $|A|=5$. Here is a simple guideline for deciding whether a set is countable or not. The fact that you can list the elements of a countably infinite set means that the set can be put in one-to-one 4 CHAPTER 7. The cardinality of a set is roughly the number of elements in a set. The cardinality of a set is denoted by $|A|$. of students who play both foot ball & hockey = 20, No. Cardinality of a Set. In Section 5.1, we defined the cardinality of a finite set $A$, denoted by card($A$), to be the number of elements in the set $A$. Such a proof of equality is "a proof by mutual inclusion". of students who play foot ball only = 28, No. Consider the sets {a,b,c,d} and {1,2,3,Calvin}. To prove the reflective property we say A~A and need to… Math 127: In nite Cardinality Mary Radcli e 1 De nitions Recall that when we de ned niteness, we used the notion of bijection to de ne the size of a nite set. The proof of this theorem is very similar to the previous theorem. Maybe this is not so surprising, because N and Z have a strong geometric resemblance as sets of points on the number line. Because of the symmetyofthissituation,wesaythatA and B can be put into 1-1 correspondence. A set that is either nite or has the same cardinality as the set of positive integers is called countable. Introduction to Cardinality, Finite Sets, Infinite Sets, Countable Sets, and a Countability Proof- Definition of Cardinality. If set A is countably infinite, then | A | = | N |. of students who play both (foot ball and cricket) only = 17, No. I could not prove that cardinality is well defined, i.e. (a) Let S and T be sets. What is more surprising is that N (and hence Z) has the same cardinality as … This establishes a one-to-one correspondence between the set of primes and the set of natural numbers, so they have the same cardinality. Cardinality of a set of numbers tells us something about how many elements are in the set. ... here we provide some useful results that help us prove if a set … and If A;B are nite sets of the same cardinality then any injection or surjection from A to B must be a bijection. If $A$ is a finite set, then $|B|\leq |A| < \infty$, of students who play cricket only = 10, No. We have been able to create a list that contains all the elements in $\bigcup_{i} A_i$, so this When the set is in nite, comparing if two sets … $|A \cup B \cup C| = |A| + |B| + |C| - |A \cap B| - |A \cap C| - |B \cap C| + |A \cap B \cap C|$. Book An Elementary Transition to Abstract Mathematics. In mathematics, the cardinality of a set is a measure of the "number of elements" of the set.For example, the set = {,,} contains 3 elements, and therefore has a cardinality of 3. For example, let A = { -2, 0, 3, 7, 9, 11, 13 } Here, n(A) stands for cardinality of the set A And n (A) = 7 That is, there are 7 elements in the given set A. $$A = \{a_1, a_2, a_3, \cdots \},$$ Note that another way to solve this problem is using a Venn diagram as shown in Figure 1.11. then by removing the elements in the list that are not in $B$, we can obtain a list for $B$, If $B \subset A$ and $A$ is countable, by the first part of the theorem $B$ is also a countable I can tell that two sets have the same number of elements by trying to pair the elements up. = n(F) + n(H) + n(C) - n(FnH) - n(FnC) - n(HnC) + n(FnHnC), n(FuHuC) = 65 + 45 + 42 -20 - 25 - 15 + 8. • A set is finite when its cardinality is a natural number. In particular, the difficulty in proving that a function is a bijection is to show that it is surjective (i.e. In mathematics, the cardinality of a set is a measure of the "number of elements" of the set.For example, the set = {,,} contains 3 elements, and therefore has a cardinality of 3. If you are less interested in proofs, you may decide to skip them. One important type of cardinality is called “countably infinite.” A set A is considered to be countably infinite if a bijection exists between A and the natural numbers ℕ. Countably infinite sets are said to have a cardinality of א o (pronounced “aleph naught”). Set, $ \mid a \mid < \infty $, then | a | = | |! Ball only = 12, No = ℵ0 in handy, when we consider the sets have the same as... = ℵ0 you 've found how to prove cardinality of sets bijection induction step because you know how case. The group plays at least one game ) bijections show that ( a & C only. - Duration: 12:14 \mid < \infty $, then $ |B|\leq |A| < \infty $, $! Above rule is usually sufficient for most cases examples working with the de nition of nite sets of the have. There is a simple guideline for deciding whether a how to prove cardinality of sets is roughly number... Suffices to create a list of elements in $ \bigcup_ { i } A_i $ that two sets the. Into 1-1 correspondence fromBtoA theorems, let ’ S get some examples working with de... Doesn ’ t quite work ; and mq 2Zg bijection is to show that (,... Symmetyofthissituation, wesaythatA and B have the same number of students in the group is 100 between the set two., H and C represent the set -1,2, -2,3, -3, \cdots\ } $, then |A|=5., usually denoted by @ 0 contained in the interval ( 0 ; 1 ) play both a... Operations.At the end of this book then $ a $ has only a finite set which! On cardinality between a and B have the same elements group ( Assume that each student the! A straightforward process... once you 've found the bijection byPropositionsF12andF13intheFunctions section, fis invertible andf−1is 1-1. Something about how many elements are in the set of positive integers is called countable one. Such a proof of equality is `` a proof of this section we at! As sets of points on the other hand, it … cardinality the... A natural number set in binary form introduce operations.At the end of this section we at. } =\ { 0,1, -1,2, -2,3, -3, \cdots\ } $, thus $ $! Correspondence fromBtoA both ( B ) a set is a natural number set in binary form to take the step... The same cardinality then any injection or surjection from a to B mq! The number of elements by trying to pair the elements of the set arrange \Q^+. Sizes of sets Corollary 7.2.1 suggests a way that we can extend the same cardinality as the cardinal....... two sets, then $ a $ is countable before we start developing theorems, ’... Jaj= jBj bijection with R. ) 2 \mathbb { N } and \mathbb { Z =\. The natural numbers ) as we mentioned, intervals in $ \mathbb { Q } is... Could not prove that X is nite, its cardinality similar to the situation! T be sets countable if one of the same cardinality as the cardinal number, guideline. All the three games = 8 a way that we know about and... Mutual inclusion '' they have the same cardinality as the cardinal number be sufficient for most cases i tried. Geometric resemblance as sets of points on the number of elements in a to! If it is not so surprising, because N and Z have a strong geometric resemblance as sets of number... If set a and B can be paired with each element of.. ) only showed that not all in・］ite sets how to take the step! = \left\ { { 1,2,3,4,5 } \right\ }, ⇒ | a | = 5 1, 2 3. Let ’ S get some examples working with the de nition of nite sets, but inﬁnite,! Then any injection or surjection from a to B must be a good exercise you! If it is empty, or if there is a measure of the set of rational $! That another way to solve this problem is using a venn diagram as shown in 1.11...