BI TP C T

1.

c t tp hp X gm cc s t nhin l trong khong t 100 n 1000.

Khng tng minh

So_tu_nhien_le (X: N-set) S: N-set

Pre

X = (100; 1000)

Post (r S) (r X) (1 = r mod 2)
X = {x: N| (x>100) (x<1000) (x mod 2 = 1)}
Tng minh
So_tu_nhien_le: N N
So_tu_nhien_le (r) = (r X) if (r mod 2 = 1) then r else false
2.

c t tp hp X gm cc s t nhin chn trong khong t 100 n 1000

(khng xt 100 v 1000)

(tng t cu 1)
3.

c t tp hp P cc s nguyn t ln hn 100 v nh hn 65537.

Khng tng minh

Is_prime (P: N-set) r: B

Pre

P = (100; 65537)

Post (r X)

(d > 2 d <

) (d divides r)

Tng minh
Is_prime: N B
Is_prime (r) = (r > 100 r < 65537)

X = {r:N | (r > 100 r < 65537)

(d >= 2 d*d <= r ) (d divides r)} ( hoi

lai thay)

(d > 2 d <

) (d divides r)

4.

c t pht biu: Vi bt k s t nhin x, lun tm c s nguyn l y

khng vt qu x.
x:N y: Z (y< x) La_so_nguyen_le (y)
La_so_nguyen_le (x : N) r : B
Pre
true
Post r = (x mod 2 = 1)
Khng tng minh

So_nguyen_le_nho_hon (x: N-set) y: Z

Pre
Post (

y < x) (r Z) (y mod 2 = 1)

Tng minh
So_nguyen_le_nho_hon: N Z
So_nguyen_le_nho_hon (x) = (y < x) (y mod 2 = 1)
5.

c t pht biu: Vi bt k s t nhin x, lun tm c s t nhin l y

khng vt qu x.

(tng t cu 4)
6.

c t pht biu: Vi bt k s t nhin x, lun tm c s nguyn y nh

hn x.

(tng t cu 4)
7.

c t pht biu: Tn ti s t nhin x sao cho x > 1000.

(tng t cu 4)
8.

c t pht biu: Tn ti s t nhin x sao cho x l s chn v x l s

nguyn t.
x : N (x mod 2 = 0) La_so_nguyen_to (x)
La_so_nguyen_to (x: N) r: B
Pre
true
Post
Khng tng minh

So_nguyen_to_chan (x: N-set) r: B

Pre

Post r = (is_prime (x)) (so_tu_nhien_chan (x))

Is_prime (x: N) r: B (cu 3)
So_tu_nhien_chan (x: N) r: B (cu 2)
Tng minh
So_nguyen_to_chan: N N
So_nguyen_to_chan (x) = (is_prime (x)) (so_tu_nhien_chan (x))
9.

c t pht biu: Vi bt k s t nhin x v y, tm c s t nhin z sao

cho x + y < z. (tim dc )
Khng tng minh

So_lon_hon_tong (x: N-set, y: N-set) z: N

Pre
Post (z

N) (x + y < z)

Tng minh
So_lon_hon_tong: N

NN

So_lon_hon_tong (x, y) = (x + y < z)

10.

c t pht biu: Vi bt k s t nhin x v y, lun tm c s t nhin z

< x + y.

(tng t cu 9)
11.

c t hm kim tra s thc a ln hn hay bng s thc b hay khng.

Khng tng minh

Is_greater_than (a: R, b: R) r: B
Pre

TRUE

Post (r =TRUE) VA (a
Tng minh

b)HOAC R = FALSE VA A < B

Is_greater_than: R

RB

Is_greater_than (a, b) (a b)
12. c t hm tr v gi tr ln nht trong 3 s thc a, b, c.
Khng tng minh
Max_number (a: R, b: R, c: R) r: R
Pre
Post (r=a r=b r=c) (r a) (r b) ( r c)
Tng minh
Max_number: R

RR

Max_number (a, b, c) = if ((b > a) ( b> c)) then r = b

Else
If (c > a) then r = c else r = a
13.

c t hm tr v s nguyn t ln nht khng vt qu s t nhin n cho

trc hoc tr v -1 nu khng tm c gi tr cn thit.

Khng tng minh
Is_prime_max (n: N) r: Z
Pre
Post ( (r
((r

n) (is_prime (r) (

is_prime(i) (i

Z) (r = -1) (is_prime(i) (i

n) (i > r)))

n)))

Tng minh
Is_prime_max: N Z
Is_prime_max (n) = if ((is_prime(i) (i
Else r (r
(i > r)

n))) then -1

n) (is_prime (r) (

is_prime(i) (i

n)

14. c t hm kim tra nm n > 0 c phi l nm nhun hay khng.

Khng tng minh
Nam_nhuan (n: N) r: B
Pre
Post r = (((n mod =0) (n mod 100 = 0)) (n mod 400 = 0))
Tng minh
Nam_nhuan: N B
Nam_nhuan (n) = if (((n mod =0) (n mod 100 = 0)) (n mod 400 = 0))
then true
else false
15. c t hm tr v s ngy ti a ca mt thng trong 1 nm nhun.
Khng tng minh
Ngay_cua_thang_trong_nam_nhuan (t: N) sn: N
Pre

t = {1;.;12}

Post (((t = 2) (sn = 29)) ((t = 4) (t = 6) (t = 9) (t = 11) (sn = 30)) ((t =

1) (t = 3) (t = 5) (t = 7) (t = 8) (t = 10) (t = 12) (sn = 31)))
Tng minh
Ngay_cua_thang_trong_nam_nhuan: N N
Ngay_cua_thang_trong_nam_nhuan (t) =
Cases index:
(

1, 3, 5, 7, 8, 10, 12 31,
4, 6, 9, 11 30,
2 29