
Exercises and problems in Informatics September 2003 
I. 55. An integer n>1 is said to be highly composite, if the number of its divisors is greater than those of any positive integers smaller than n.
Write your program (i55.pas, ...) that displays all highly composite numbers up to a given positive integer N (1\(\displaystyle \le\)N \(\displaystyle \le\)1 000 000). (10 points)
I. 56. Write a program (i56.pas, ...) which draws a given phase of the Moon. Full Moon is represented as a filled circle, while New Moon should be displayed as an empty circle centered at the middle of the screen and with radius of 100 pixels. The parameter of your program should be the diameter of the crescent defined according to the Figures. (10 points)
I. 57. A polynomial P(x) of degree n is given by its coefficients P(x)=a_{0}+a_{1} x+a_{2} x^{2}+...+a_{n} x^{n}. The derivative of P(x) is the following polynomial of degree n1
P'(x)=a_{1}+2a_{2} x+3a_{3} x^{2}+...+n a_{n} x^{n1}.
Further derivatives of this polynomial can be computed until all of its coefficients become zero.
Prepare your sheet (i57.xls) that produces the derivatives of a polynomial of degree at most 10 as shown in the Figure. (10 points)
P(x)=  1  +  1  x^{1}+  1  x^{2}+  1  x^{3}+  1  x^{4}+  1  x^{5}+  1  x^{6}+  1  x^{7}+  1  x^{8}  1  1  +  2  x^{1}+  3  x^{2}+  4  x^{3}+  5  x^{4}+  6  x^{5}+  7  x^{6}+  8  x^{7}+  0  x^{8}  2  2  +  6  x^{1}+  12  x^{2}+  20  x^{3}+  30  x^{4}+  42  x^{5}+  56  x^{6}+  0  x^{7}+  0  x^{8}  3  6  +  24  x^{1}+  60  x^{2}+  120  x^{3}+  210  x^{4}+  336  x^{5}+  0  x^{6}+  0  x^{7}+  0  x^{8}  4  24  +  120  x^{1}+  360  x^{2}+  840  x^{3}+  1680  x^{4}+  0  x^{5}+  0  x^{6}+  0  x^{7}+  0  x^{8}  5  120  +  720  x^{1}+  2520  x^{2}+  6720  x^{3}+  0  x^{4}+  0  x^{5}+  0  x^{6}+  0  x^{7}+  0  x^{8}  6  720  +  5040  x^{1}+  20160  x^{2}+  0  x^{3}+  0  x^{4}+  0  x^{5}+  0  x^{6}+  0  x^{7}+  0  x^{8}  7  5040  +  40320  x^{1}+  0  x^{2}+  0  x^{3}+  0  x^{4}+  0  x^{5}+  0  x^{6}+  0  x^{7}+  0  x^{8}  8  40320  +  0  x^{1}+  0  x^{2}+  0  x^{3}+  0  x^{4}+  0  x^{5}+  0  x^{6}+  0  x^{7}+  0  x^{8} 

Send your solutions to the following email address:
Deadline: 13 October 2003
