PROLOG

===== MEDIA A 2 A NR =====
medie(A,A,M):-MIS (A1+A2)/2.
SAU
suma:-write('introduceti primul numar'),read(x),nl,write('introduceti al 2 lea numar'), read(y),write('media este'),R is (x+y)/2,write(R),nl.

===== MAXIMUL A 2 NUMERE =====
max(A,B,A):-A>B.
max(A,B,B):-B>A.
max(_,_,_).
maxim(A,B,C,A):-A>=B,A>=C.

===== CMMDC =====
cmmdc(A,0,A).
cmmdc(A,B,R):-Rest is A mod B, cmmdc(B,Rest,R).

===== MODULUL UNUI NUMAR =====
modul(A,B,A):-A<=B.
modul(A,B,Rez):- A>=B, R is A-B, modul(R,B,Rez).

===== SUMA PRIMELOR N NUMERE NENULE =====
suma(1,1).
suma(X,R):-x>1, A is x-1, suma(A,Y), R is y+x.

===== N FACTORIAL =====
fact(0,1).
fact(N,R):-N>0, A is N-1, fact(A,Y), R is  Y*N.

===== SIRUL LUI FIBONACI =====
fib(1,1).
fib(R,1).
fib(N,R):-N>2,A is N-1 , Bis N-2, fib(A,C),fib(B,D).

===== PREDICAT CARE SA CALCULEZE SUMA =====
suma(1,1).
suma(N,Rez):-N-1, C is N-1, suma (C,R), Rez is R+1/N.

===== SUMA DE PATRATE =====
putere(0,_,0).
putere(_,0,1)
putere(A,B,Rez):- A>0,B>0, C is B-1, putere (A,C,R), Rez is R*A.

===== ECUATIA DE GRAD 2 =====
caz(_,_,Delta):-Delta<0, write ('nu are solutii').
caz(A,B,Delta):-Delta=0, X is -B/2*A, write('Solutii egale x1 = x2 ').
caz(A,B,Delta):-Delta>0,x1 is (-B+sqrt(Delta)/2*A, x2 is (-B- sqrt+Delta)/2*A, write('x1=').
rezolava(A,B,C):-Delta is B*B-4*A*C; caz(A,B,Delta).


===== AFISARE LISTA ELEMENT CU ELEMETN ===== (RECURSIVITATE PE DUS)
afisare([]).
afisare([Prim_elem,Rest_lista]):-write(Prim_elem),afisare(Rest_lista).

===== VERIFICATI DACA UN ELEMENT APARTINE  LISTEI =====
mem(X,[X|_]):-write('am gasit').
mem(E,[_|Y]):-mem(E,Y).

===== CATE ELEMENTE ARE O LISTA =====
lungime([],0).
lungime([_|Y],L):-(Y,N), L is N+1.

===== AFISATI ULTIMUL ELEMENT =====
ul_el([X],X):- write(X).
ul_el([_|Y],L):-ul_el(Y,L).

===== VEZI DACA O LISTA ARE NR PAR DE ELEMENTE =====
par([_,_]):-write('lista este para').
par([_,_|Y]:-par(Y).