Python

1) Assume there is a variable , h already associated with a positive integer value. Write the code necessary to count the number of perfect squares whose value is less than h , starting with 1 . (A perfect square is an integer like 9 , 16 , 25 , 36 that is equal to the square of another integer (in this case 3*3 , 4*4 , 5*5 , 6*6 respectively).) Assign the sum you compute to a variable  q For example, if h is 19 , you would assign 4 to q because there are perfect squares (starting with 1 ) that are less than h are: 1 , 4 , 9 , 16 .

_____________________________________________________________________________________

2) Assume there are two variables , k and m , each already associated with a positive integer value and further assume that k 's value is smaller than m's. Write the code necessary to compute the number of perfect squares between k and m . (A perfect square is an integer like 9 , 16 , 25 , 36 that is equal to the square of another integer (in this case 3*3 , 4*4 , 5*5 , 6*6 respectively).) Associate the number you compute with the variable  q . For example, if k and m had the values 10 and 40 respectively, you would assign 3 to q because between 10 and 40 there are these perfect squares: 16 , 25, and 36 ,.

____________________________________________________________________________

3) In the following sequence, each number (except the first two) is the sum of the previous two numbers: 0, 1, 1, 2, 3, 5, 8, 13, ... . This sequence is known as the Fibonacci sequence.

We speak of the i'th element of the sequence (starting at 0)-- thus the 0th element is 0, the 1st element is 1, the 2nd element is 1, the 3rd element is 2 and so on. Given the positive integer n , associate the nth value of the fibonacci sequence with the variable  result . For example, if n is associated with the value 8 then result would be associated with 21.