Subversion Repositories wimsdev

Factorisation, congruences et nombres premiers

??,2013
2
U3
mathematics, algebra
levelU3, factorization, arithmetic,modular_arithmetic
Bernadette, Perrin-Riou
bernadette.perrin-riou@math.u-psud.fr

:U1/arithmetic/modarith.en
exo=linearmod&qnum=1&qcmlevel=3&scoredelay=&confparm1=1&intro_qcmpresent=4&intro_presentsol=1&intro_check=1&intro_check=2&intro_check=3&intro_check=4&intro_expert=yes
30
1
Equation linéaire modulaire

:H6/arithmetic/OEFarinbpTS.fr
exo=divprem2&qnum=1&qcmlevel=3&scoredelay=&intro_qcmpresent=4&intro_presentsol=1&intro_check=1&intro_check=2&intro_check=3&intro_check=4&intro_expert=yes
20
1
Diviseurs premiers 2

:U1/arithmetic/oeffactor.fr
exo=diviseur&qnum=1&qcmlevel=3&scoredelay=
10
1
Nombre de diviseurs
...
:U1/arithmetic/oeffactor.fr
exo=nodiv2&qnum=1&qcmlevel=3&scoredelay=&intro_qcmpresent=4&intro_presentsol=1&intro_check=1&intro_check=2&intro_check=3&intro_check=4&intro_expert=yes
10
1
Nombre de diviseurs II
...
:U1/arithmetic/oeffactor.fr
exo=nodiv3&qnum=1&qcmlevel=3&scoredelay=&intro_qcmpresent=4&intro_presentsol=1&intro_check=1&intro_check=2&intro_check=3&intro_check=4&intro_expert=yes
10
1
Nombre de diviseurs III
...
:U1/arithmetic/oeffactor.fr
exo=tridiv&qnum=1&qcmlevel=3&scoredelay=&intro_qcmpresent=4&intro_presentsol=1&intro_check=1&intro_check=2&intro_check=3&intro_check=4&intro_expert=yes
10
1
Divisions d'essai
...
:U1/arithmetic/oeffactor.fr
exo=maxfact&qnum=1&qcmlevel=3&scoredelay=&intro_qcmpresent=4&intro_presentsol=1&intro_check=1&intro_check=2&intro_check=3&intro_check=4&intro_expert=yes
10
1
Maximum de facteurs
...
:U1/arithmetic/oeffactor.fr
exo=diviseur2&qnum=1&qcmlevel=3&scoredelay=&intro_qcmpresent=4&intro_presentsol=1&intro_check=1&intro_check=2&intro_check=3&intro_check=4&intro_expert=yes
30
1
Diviseurs d'un entier
...

:U1/arithmetic/modarith.en
exo=square&qnum=1&qcmlevel=3&scoredelay=&confparm1=1&confparm2=2&intro_qcmpresent=4&intro_presentsol=1&intro_check=1&intro_check=2&intro_check=3&intro_check=4&intro_expert=yes
30
1
Carrés modulo n

:U1/arithmetic/modarith.en
exo=divzero&qnum=1&qcmlevel=3&scoredelay=&confparm1=1&confparm2=2
10
1
Diviseurs de zéro modulo n

:U1/arithmetic/modarith.en
exo=divzero2&qnum=1&qcmlevel=3&scoredelay=&confparm1=1&confparm2=2&intro_qcmpresent=4&intro_presentsol=1&intro_check=1&intro_check=2&intro_check=3&intro_check=4&intro_expert=yes
10
1
Diviseurs de zéro II

:U1/arithmetic/modarith.en
exo=divzero3&qnum=1&qcmlevel=3&scoredelay=&confparm1=1&confparm2=2&intro_qcmpresent=4&intro_presentsol=1&intro_check=1&intro_check=2&intro_check=3&intro_check=4&intro_expert=yes
30
1
Diviseurs de zéro III

:U1/arithmetic/modarith.en
exo=inverse&qnum=1&qcmlevel=3&scoredelay=&confparm1=1&confparm2=2
30
1
Inverse I

:U1/arithmetic/modarith.en
exo=inverse2&qnum=1&qcmlevel=3&scoredelay=&confparm1=1&confparm2=2&intro_qcmpresent=4&intro_presentsol=1&intro_check=1&intro_check=2&intro_check=3&intro_check=4&intro_expert=yes
20
1
Inverse II

:U1/arithmetic/modarith.en
exo=multspec&qnum=1&qcmlevel=3&scoredelay=&confparm1=1&confparm2=2&intro_qcmpresent=4&intro_presentsol=1&intro_check=1&intro_check=2&intro_check=3&intro_check=4&intro_expert=yes
10
1
Multiples spéciaux

:U1/arithmetic/modarith.en
exo=multspec2&qnum=1&qcmlevel=3&scoredelay=&confparm1=1&confparm2=2&intro_qcmpresent=4&intro_presentsol=1&intro_check=1&intro_check=2&intro_check=3&intro_check=4&intro_expert=yes
10
1
Multiples spéciaux II