1 / 11

3.5 Paradox 1.Russell’s paradox A  A, A  A 。

3.5 Paradox 1.Russell’s paradox A  A, A  A 。 Russell’s paradox: Let S={A|A  A}. The question is, does S  S? i.e. S  S or S  S? If S  S, If S  S, The statements " S  S " and " S  S " cannot both be true, thus the contradiction. 2.Cantor’s paradox

tasya
Download Presentation

3.5 Paradox 1.Russell’s paradox A  A, A  A 。

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 3.5 Paradox • 1.Russell’s paradox • AA,AA。 • Russell’s paradox: Let S={A|AA}. The question is, does SS? • i.e. SS or SS? • If SS, • If SS, • The statements " SS " and " SS " cannot both be true, thus the contradiction.

  2. 2.Cantor’s paradox • 1899,Cantor's paradox, sometimes called the paradox of the greatest cardinal, expresses what its second name would imply--that there is no cardinal larger than every other cardinal. • Let S be the set of all sets. |S|?|P (S)| or |P (S)|?|(S)| • The Third Crisis in Mathematics

  3. II Introductory CombinatoricsChapter 4Introductory Combinatorics Counting

  4. Combinatorics, is an important part of discrete mathematics. • Techniques for counting are important in computer science, especially in the analysis of algorithm. • sorting,searching • combinatorial algorithms • Combinatorics

  5. existence • counting • construction • optimization • existence :Pigeonhole principle • Counting techniques for permutation and combinations,and Generating function, and Recurrence relations

  6. 4.1 Pigeonhole principle • Dirichlet,1805-1859 • shoebox principle

  7. 4.1.1 Pigeonhole principle :Simple Form • If n pigeons are assigned to m pigeonholes, and m<n, then at least one pigeonhole contains two or more pigeons. • Theorem 4.1: If n+1 objects are put into n boxes, then at least one box contain tow or more of the objects.

  8. Example 1: Among 13 people there are two who have their birthdays in the same month. • Example 2: Among 70 people there are six who have their birthdays in the same month. • Example 3:From the integers 1,2,…,2n, we choose n+1 intergers. Show that among the integers chosen there are two such that one of them is divisible by the other. • 2ka • 2ra and 2sa

  9. Example 4:Given n integers a1,a2,…,an, there exist integers k and l with 0k<ln such that ak+1+ak+2+…+al is divisible by n. • a1, a1+a2, a1+a2+a3,…,a1+a2+…+an. • Example 5:A chess master who has 11 weeks to prepare for a tournament decides to play at least one game every day but, in order not to tire himself, he decides not to play more than 12 games during any calendar week. Show that there exists a succession of (consecutive) days during which the chess master will have played exactly 21 games.

  10. Concerning Application 5, Show that there exists a succession of (consecutive) days during which the chess master will have played exactly 22 games. • (1)The chess master plays few than 12 games at least one week • (2)The chess master plays exactly 12 games each week

  11. Exercise P90 3,7, 8,9 • 1.From the integers 1,2,…,2n, we choose n+1 intergers. Show that among the integers chosen there are two which are relatively prime. • 2.A computer network consists of six computers. Each computer is directly connected to at least one of the other computers. Show that there are at least two computers in the network that are directly connected to the same number of other computers. • 3.Show that for any given n+2 integers there exist two of them whose sum, or else whose difference is divisible by 2n. • Next: • Permutations of sets P79-81, 3.1 • circular permutation • Combinations of sets,3.2 P83-84

More Related