• Aucun résultat trouvé

2–Quizz 1–Groupwork Combinatorics

N/A
N/A
Protected

Academic year: 2022

Partager "2–Quizz 1–Groupwork Combinatorics"

Copied!
3
0
0

Texte intégral

(1)

Season 01Episode 12Combinatorics

0

Combinatorics

Season 01

Episode 12 Time frame 1 period

Prerequisites :

Eventsandprobabilities

Objectives :

Disover afew ombinatoris methods

Materials :

Exerise sheet for eahstudent.

Listof questions for the quizz.

1 – Group work 25 mins

Students work in groups of 4. They have to solve an exerise involving two standard

ombinatoris situationsand the fatorialnotation.

2 – Quizz 30 mins

Students arestillworking ingroups.They havetoanswertensimple ombinatorisques-

tions (3 minutes per question). At the end of the quizz, grouppapers are marked by the

(2)

Combinatorics

Season 01

Episode 12 Document Exercise

There are 26 letters in the latin alphabet we use, from a to z. A word is an ordered

sequene ofletters,withpossiblerepetitions.Intherstpart ofthis exerisewewillount

the number of possible words, without onsidering the fat that a word asa meaning or

not. For example, yyyyryyyr is a9-letters word, just like pentagone.

1

. Howmany possible 2-letterswords are there?

2

. Howmany possible 3-letterswords are there?

3

. Howmany possible 4-letterswords are there?

4

. Find ageneralformulafor the number ofpossible

n

-letters words, with

n

anatural number.

5

. The longest English word appearingin a ditionnary is

Pneumonoultramirosopisiliovolanooniosis

It'sadiseaseofthelungs,ausedbyinhalingmineralormetallidust,suhassilion

and quartzite.

Count the number of possiblewords with the same number of letters.

6

. The totalnumberofpossiblewords with46lettersof less isapproximatelyequalto

1.275872703 × 10 65

. Imagine that we want to reate a ditionnary listing all these possible words, and that we manageto put 500 words in eah page. Now, suppose

we use a paperwith a thikness of 0,01 millimeters(whih is very thin).

Compute the number of pages needed and total thikness of the ditionnary,using

the appropriate unit.

In the seond part, we will study a dierent problem : the number of anagrams for a

given word. An anagram is the result of rearranging the letters of a word or phrase to

produe anew word or phrase,using allthe original letters exatly one. An interesting

example isI'm adot in plae,ananagramof A deimalpoint; afamous one is I Am

Lord Voldemort, an anagram of Tom Marvolo Riddle. In the following questions, we

willonsider allanagrams,whether they mean somethingornot. Forexample,fntnuio

is ananagram offuntion.

1

. List allthe anagrams of the words no, yes and blue.

2

. Find outthe number ofanagrams ofany 2-lettersword, any 3-lettersword andany

4-letters word, ounting ineah ase the word itself.

3

. The notation

n!

denotes the produt of all integers from

1

to

n

. Use this notation to write the answers of the previous question.

4

. Prove that the number of anagrams of any 5-lettersword is

5!

.

5

. What is the numberof anagrams of any

n

-letters word.

(3)

Season 01Episode 12Combinatorics

2

Document 1

Quizz

1

. For every meal, a student has to hoose between 6 starters, two main ourses, two

sides, 5 heeses oryoghurt and 3 desserts. What isthe number of possible meals?

2

. A man wears only blak and white. Every morning he piks randomly one pair of

shoes (blak or white), one pair of trousers (blak or white), one shirt (blak or

white) and one overoat (blakor white).What isthe numberof possibleoutts?

3

. In horseraing terminology,atrifeta isa parimutuel betinwhihthe bettor must predit whih horses will nish rst, seond, and third in exat order. If there are

12 horsesin the rae, how many dierent hoies are there?

4

. Every morning, a man living in London piks randomly an umbrella before going

out inthe rain.He anhoose between threedierentones :one green,one redand

one blak. What is the numberof possible hoies for one week.

5

. MarioKart Wii is a famous rainggame developed by Nintendo.In this game,the

player must hoose between 4 modes, 24 Nintendo haraters, 8 vehiules for eah

harater, 8ups and 4 raes per up. What is the number of possible raes?

6

. A group of120 people have toelet a board madeof a Chairman,a vie-Chairman and a seretary. Howmany possible boards are there? Anyone an be eleted, but

a dierent person must be eletedfor eahpost.

7

. Everyweek,ateaherpiksrandomlyapupilinalassof36towipeawaytheboard

after eah lesson. What is the number of possible hoies for 5weeks?

8

. Ten peoplehavetobearrangeinalineandhanded outnumbers from1to10.What

is the number of possible arrangements?

9

. How many distint ar liene plates are there onsisting of seven haraters, the

rst two and lasttwo being letters and the middle ones digits?

10

. As I was goingto StIves

I met a man with seven wives

Eahwife had seven saks

Eahsak had seven ats

Eahat had seven kits

Kits, ats, saks, wives

Références

Documents relatifs

In [1], Ambroˇz, Frid, Mas´akov´ a and Pelantov´ a estimated the number of all words arising from three- interval exchange, which continues the same line since Sturmian words

The latter may have literal embodyments like the first type, but may also be abstract like “red” or “christianity.” For the first type we consider a family of computable

Conceptual scientific systems can be thought to form a next stage in the development of the higher mental functions; the meaning produced at each stage refers to some

To distinguish word- form-based and semantics-based accounts of priming we conducted an experiment in which temporal words (e.g., earlier, later) were preceded by

We define a partition of the set of integers k in the range [1, m−1] prime to m into two or three subsets, where one subset consists of those integers k which are < m/2,

Eight years after the war, Beloved appears outside Sethe’s house who then adopts her and starts to believe that the young woman is her dead daughter come back to life..

- Pierre Arnoux, Université de la Méditerranée, - Pierre Cartier, École Normale Supérieure de Paris, - Julien Cassaigne, Institut de Mathématiques de Luminy, - Sébastien

(a) Elle ex´ ecute la reqˆ ete et stocke le r´ esultat dans la variable curseur (b) Elle ferme le