TP : Divisibilité et nombres premiers 1 Récupération du matériel

Caml
premier-squelette.ml
premier-squelette.ml
premier0.ml
premier0.ml
est_divisible_par
premier0.ml premier1.ml
(*est_divisible_par : int *int -> bool *)
(*est_divisible_par(n,p) = VRAI si p divise n *)
(*FAUX sinon *)
(*CU : p6= 0 *)
let est_divisible_par(n,p) = ((*a completer *))
estDivisiblePar
premier1.ml est_divisible_par
##use "premier1.ml" ;;
val est_divisible_par : int *int -> bool = <fun>
val est_premier : ’a -> unit = <fun>
- : unit = ()
http://www.gnuplot.info/

#est_divisible_par (5,2) ;;
#est_divisible_par (6,2) ;;
#est_divisible_par (7*123,123) ;;
#est_divisible_par (7*123 + 1,123) ;;
premier1.ml
let _ =
((*a completer *))
int n p
etudier_divisibilite
#etudier_divisibilite (5,2) ;;
5 n’est pas divisible par 2
- : unit = ()
#etudier_divisibilite (6,2) ;;
6 est divisible par 2
- : unit = ()
premier1.ml
est_premier
premier1.ml premier2.ml
n
n
n n
n
n
√n
√n n
premier2.ml
(*est_premier: int -> bool *)
(*est_premier(n) = VRAI si n est premier *)
(*FAUX sinon *)
(*CU : n≥0*)

n≥2
n
k:= 2
k≤n k n
k:= k+ 1
(k=n)
let est_premier(n) = ((*a completer *))
n√n
k≤√n k2≤n
premier2.ml
est_premier
premier2.ml etudier_divisibilite
etudier_primalite
#etudier_primalite (5) ;;
- : bool = true
#etudier_primalite (6) ;;
- : bool = false
premier2.ml premier3.ml

premier3.ml premier4.ml
0 0
1 0
2 1
3 2
4 2
5 3
...
100 25
premier4.1000
redirection.cmi redirection.cmo
ocaml redirection.cmo
> ocaml redirection.cmo
open Redirection
let _ =
canal := open_out("premier4.1000")
let _ =
close_out(!canal) ;
canal:=stdout
premier4.1000

> gnuplot
gnuplot>
gnuplot> plot "premier4.1000" with lines
premier4.1000
gnuplot> quit