(*)' Fn = ox. In [1], Cohn solved (*) for c = 1, 2. In [9], we found all solutions of O ) such that <? is prime and either o = 3 (mod 4) or c < 10,000. Harborth & Kemnitz [4] have asked for solutions of (&) for composite values of o. Clearly, it suffices to consider only squarefree values of c. If c < 1000, then c has at most three distinct odd prime factors. Therefore c = kp where p is prime a...

One of the main advantages of delivering web-based educational materials is that the same content is delivered to a number of students and can be accessed with no restrictions of time and place. However, there is a wide belief that using the web as only a new kind of delivery medium for educational materials does not add significant value to the teaching and learning process. It is postulated t...

Relations are derived for expectations of functions of generalized order statistics within a class of distributions including a variety of identities for single and product moments of ordinary order statistics and record values as particular cases. Since several models of ordered random variables are contained in the concept of generalized order statistics and since there are no restrictions im...