Back in May, I wrote about pattern and sequence puzzles, and didn’t have the space to cover all that I would have liked. It’s time to revisit the topic, looking at a couple different types of sequences, and then the “input/output” or “function” puzzles that add an extra twist to the idea.
(A new question of the week) It can be an interesting challenge to be presented with a formula and asked how it was derived. This becomes a bigger challenge when the formula is only approximate, so we have to figure out how to arrive at this particular approximation. But it is impressive when several different …
Distances to an Arc: Exact and Approximate Formulas Read More »
Having just written about issues of wording with regard to percentages, we should look at another wording issue that touches on percentages and several other matters of wording. What does “three times larger” mean? How about “300% more”? We’ll focus on one discussion that involved several of us, and referred back to other answers we’ve …
A recent discussion with a student I was tutoring face to face, about an ambiguously worded problem, led me to gather a few answers we’ve given related to the words we use associated with percentages.
Having just talked about definition issues in geometry, I thought a recent, short question related to a definition would be of interest. We know what the Greatest Common Divisor (GCD, also called the Greatest Common Factor, GCF, or the Highest Common Factor, HCF) of two numbers is; or do we?
(An archive question of the week) Having looked at the matter of faces, edges, and vertices from several different perspectives, I want to look at one more question and answer, to tie it all together.
Having discussed how to count faces, edges, and vertices of polyhedra, and then looked at Euler’s formula that relates them (not only in polyhedra but in graphs on planes and other surfaces), we need to consider a question we have received at least 100 times: Are these terms even defined (or defined correctly) for cylinders, …
Do Curved Surfaces Have Faces, Edges, and Vertices? Read More »
(A new problem of the week) Having discussed counting earlier this week, let’s take a look at a different kind of counting. The subject of combinatorics (the study of counting) arises in many guises: probability, sets, geometry. Here, we look at a relatively basic type of problem that involves the same sort of organized thinking …
Last time we looked at how to count the parts of a polyhedron, and a mention was made of Euler’s Formula (also called the Descartes-Euler Polyhedral Formula), which says that for any polyhedron, with V vertices, E edges, and F faces, V – E + F = 2. We should take a close look at that simple, yet amazing, …
More on Faces, Edges, and Vertices: The Euler Polyhedral Formula Read More »
Over the years, we have had many questions, often from young students, asking how to count the parts (faces, edges, vertices) of a polyhedron (cube, prism, pyramid, etc.). The task requires understanding of terms, visualization of three-dimensional objects, and organizing the parts for accurate counting — all important skills. How can we help with this?