The study focuses on the identification of relationships and/or rules between computational thinking (CT) concepts among the undergraduate students of Applied Informatics due to their attitudes towards mathematics. We analyze three CT concepts -- decomposition, pattern recognition, and algorithmic thinking. We assume that students who have a…

The mathematics associated with division is discussed, working from a theorem for the real division algorithm. Real-world, geometric, and algebraic approaches are discussed, as are related topics. (MNS)

The article identifies five incorrect beliefs about mathematics often held by students who have difficulty with mathematics. They include: the relative size of numbers is more important than the relationships between quantities; computation problems must be solved by using a step-by-step algorithm; mathematics problems have only one correct…

The calculator is used to solve certain formidable equations, which arise naturally and which may be difficult or impossible to solve by standard methods, by a method of successive approximations. (MP)

The Euclidean algorithm for finding the greatest common divisor is presented. (MNS)

Shortcuts to use when performing operations with the calculator are given. Algorithms discussed include reciprocals, powers, parentheses, infinite series, and synthetic division. (MP)

Suggests and illustrates ways in which systematic consideration of selected unary operations can be facilitated by using electronic calculators. Emphasis is placed upon unary operations suitable for exploration and investigation at the pre-algebra level, using calculation algorithms as a basis for generating examples and non-examples to develop…

Possible ways of mechanization for counting using a binary system are discussed. Shows a binary representation of the numbers and geometric models having eight triples of lamps. Provides three problem sets. (YP)

Stochastic approximation algorithms for least square error approximation to density and distribution functions are considered. The main results are necessary and sufficient parameter conditions for the convergence of the approximation processes and a generalization to some time-dependent density and distribution functions. (Author)

The concept of prime factorization is discussed and two rules are developed: one for finding the number of divisors of a number and the other for finding the sum of the divisors. (MP)

Chio's method of evaluating determinants by successive reduction of size is explained. (MN)

A method is presented for determining cube roots on a calculator with square root facility that has a rapid rate of convergence. (MP)

Investigating properties and characteristics of unary operations is shown to be facilitated by using calculators. Several avenues for instructional exploration are suggested and examples given. These include questions relating to relations, inverses, commutativity, distributivity, and iterations. A discussion of the calculator algorithm for…