• Aucun résultat trouvé

2009-themeJ_3.pdf

N/A
N/A
Protected

Academic year: 2021

Partager "2009-themeJ_3.pdf"

Copied!
4
0
0

Texte intégral

(1)

Baccalauréat 2009 - Académie de Lille

Epreuve de Discipline Non Linguistique

Mathématiques/Anglais

Thème J : démarche d'investigation

Sujet 3

L'usage de la calculatrice est autorisé. Temps de préparation: 20 minutes.

Cette planche sera à rendre à l'examinateur, veillez à ne rien écrire dessus.

Squares can be drawn on squared dotty paper.

Each square must be drawn at 45° as shown in the diagram. Each corner of a square must be on one of the dots.

There are 13 dots inside this square.

1°) Investigate the number of dots inside squares of different sizes. 2°) Investigate further.

(2)
(3)
(4)

Références

Documents relatifs

In comparing the columns of the table, it must be remembered that each time function values are required by the least squares method, or by Davidon's method, all the first

Figure 1 represents the Young diagram of the partition λ = (5, 3, 3, 2) of size 13; the number inside each cell represents its hook length.. Let s be a

On each part of the figure, the output y im (k) is drawn in dash-line in order to be compared with its estimates based on each model. Therefore the admissible output domains are

However, in Section 7, when decomposing a non-binary con- straint into binary ones, the variables inside the non-binary constraint must be reordered the same way for each

Figure 5.53 shows a diagram of the snake and each servo located in each body section, along with the corre- sponding connector on the controller board. When

In order to maintain the direction convention of upward arcs in this Hasse diagram, each new concept must be assigned to a layer which is separated from the infimum [supremum] by

The algorithm must be able to provide information about the location of the robot separately for each test image (e.g. when only some of the images from the test

A precise and openly available specification of the format of each media type MUST exist for all types registered in the standards tree and MUST at a minimum be referenced by,