Four variations of the Koch curve are presented. In each case, the similarity dimension, area bounded by the fractal and its initiator, and volume of revolution about the initiator are calculated. A range of classroom exercises are proved to allow students to investigate the fractals further.

We propose an algorithm that allows calculating the remainder and the quotient of division between polynomials over commutative coefficient rings, without polynomial long division. We use the previous results to determine the quadratic factors of polynomials over commutative coefficient rings and, in particular, to completely factorize in Z[x] any…

A growing emphasis on computational thinking worldwide necessitates student proficiency in creating algorithms. Focusing on the use of counterexamples for developing student-invented algorithms, I reanalyze two pieces of data from previously published research, pertaining to two different cases of students' algorithmatizing activity. In both…

We propose some generalizations of the classical Division Algorithm for polynomials over coefficient rings (possibly non-commutative). These results provide a generalization of the Remainder Theorem that allows calculating the remainder without using the long division method, even if the divisor has degree greater than one. As a consequence we…

A method based on oblique projection is presented for construction of sundials. The derived formulas are classical, but usage of vectors and projections renders a coherent presentation rather than a number of special cases. The presented work is aimed to be useful for those taking a beginning module on vector algebra.

We propose a divisibility criterion for elements of a generic Unique Factorization Domain. As a consequence, we obtain a general divisibility criterion for polynomials over Unique Factorization Domains. The arguments can be used in basic algebra courses and are suitable for building classroom/homework activities for college and high school…

The rules of indices, e.g. a[superscript n] b[superscript n] = (ab)[superscript n], are a particularly important part of elementary algebra. This paper reports results from a textbook analysis which examined how the shift from integer to rational exponents in the rules of indices is discussed in school textbooks. The analysis also considered…

In this paper, we reconstruct matrices from their minors, and give explicit formulas for the reconstruction of matrices of orders 2 × 3, 2 × 4, 2 × n, 3 × 6 and m × n. We also formulate the Plücker relations, which are the conditions of the existence of a matrix related to its given minors.

We propose a generalization of the classical Remainder Theorem for polynomials over commutative coefficient rings that allows calculating the remainder without using the long division method. As a consequence we obtain an extension of the classical Factor Theorem that provides a general divisibility criterion for polynomials. The arguments can be…

The notation for vector analysis has a contentious nineteenth century history, with many different notations describing the same or similar concepts competing for use. While the twentieth century has seen a great deal of unification in vector analysis notation, variation still remains. In this paper, the two primary notations used for expressing…

Computer technologies and especially computer algebra systems (CAS) allow students to overcome some of the difficulties they encounter in the study of real numbers. The teaching of calculus can be considerably more effective with the use of CAS provided the didactics of the discipline makes it possible to reveal the full computational potential of…

While a significant amount of research has been devoted to exploring why university students struggle applying logic, limited work can be found on how students actually make sense of the notational and structural components used in association with logic. We adapt the theoretical framework of unitizing and reification, which have been effectively…

We present a sequence of improper integrals, for which a closed formula can be computed using Wallis formula and a non-straightforward recurrence formula. This yields a new integral presentation for Catalan numbers.

In computing real-valued functions, it is ordinarily assumed that the input to the function is known, and it is the output that we need to approximate. In this work, we take the opposite approach: we show how to compute the values of some transcendental functions by approximating the input to these functions, and obtaining exact answers for their…

This article investigates the numbers [image omitted], originally studied by Catalan. We re-confirm that they are indeed integers. Using the close relationship between them and the Catalan numbers C[subscript n], we develop some divisibility properties for C[subscript n]. In particular, we establish that [image omitted], where f[subscript k]…