fib1::Int->Int
fib1 0 = 1
fib1 1 = 1
fib1 n = fib1(n-1) + fib1(n-2)

fib2::Int->Int
fib2 n
	| n == 0 = 1
	| n == 1 = 1
	| otherwise = fib2(n-1) + fib2(n-2)

fib3::Int->Int
fib3 n=
	case n of
		0 -> 1
		1 -> 1
		_ -> fib3(n-1) + fib3(n-2)

fib4::Int->Int
fib4 n = if n==0 then 1
	else if n==1 then 1
	else fib4(n-1) + fib4(n-2)


-- suma ciągu
suma 1 = 1
suma n = 1/n + suma (n-1)

--pierwiastki
pierw::Int->Int->Float
pierw n m
	|	m == 0 = 1
	|	m == 1 = n
	|	otherwise = m * pierw(n)