Search

Search Results

• Ein ungewöhnlicher Weg zu Jakob Steiners Umellipse eines Dreiecks und zur Steiner–Hypozykloide

  49-65

  Oswald Giering

  Views:

  21

  In real projective geometry of triangles two problems of collinear points are discussed. The problems differ only from the running through the vertices of a given triangle ABC. Resolving the problems we find two cubic curves kS and kT . Affine specialization leads to the circumscribed Steiner ellipse about the triangle ABC and shows us this ellipse in more general surroundings. Euclidean specialization leads to Steiners three-cusped hypocycloid.

• A geometric application to the third-order recurrence relations for sequences

  287-302

  Calin M. Agut

  Ioana E. Agut

  Views:

  31

  Using a third-order linear homogeneous recurrence relation with constant coefficients, it is found a limit-point of a sequence of affixes in plane. Starting from a classic geometric problem, an application is so created and few more nice properties are found and described.

• Programming Theorems and Their Applications

  213-241

  István Fekete

  Tibor Gregorics

  Kinga Kovácsné Pusztai

  Anna Veszprémi

  Views:

  117

  One of the effective methodological approaches in programming that supports the design and development of reliable software is analogy-based programming. Within this framework, the method of problem reduction plays a key role. Reducing a given problem to another one whose solving algorithm is already known can be made more efficient by the application of programming theorems. These represent proven, abstract solutions – in a general form – to some of the most common problems in programming. In this article, we present six fundamental programming theorems as well as pose five sample problems. In solving these problems, all six programming theorems will be applied. In the process of reduction, we will employ a concise specification language. Programming theorems and solutions to the problems will be given using the structogram form. However, we will use pseudocodes as descriptions of algorithms resembling their actual implementation in Python. A functional style solution to one of the problems will also be presented, which is to illustrate that for the implementation in Python, it is sufficient to give the specification of the problem for the design of the solution. The content of the article essentially corresponds to that of the introductory lectures of a course we offered to students enrolled in the Applied Mathematics specialization.

  Subject Classification: D40