Republic of Mathematics blog

What math teachers should know about memory, 2: working memory

Posted by: Gary Ernest Davis on: April 21, 2011

Mathematics teachers commonly complain that their students do not memorize facts, definitions  and formulas.

In a previous post I described Hermann Ebbinghaus’s experiments on rote memorization, and his finding that memorization of nonsense syllables decays exponentially.

What we teachers of mathematics want is for students to recall, at least for the very next class, what came just before.

Ideally, education should set up long term – very long term – memories so that an educated person can recall basic facts and procedures many, many years after learning them.

A critical aspect of memory formation is focus of attention, and this is an important issue I will return to later.

Here I want to focus on an aspect of memory that we use as we carry out various tasks: working memory.

Memory research boomed in the late 1900’s, so much so that in 2000 a monumental handbook of memory research was published by Oxford University Press.

One of the best, most readable, introductions to the field of memory research, by two of the main contributors, is “Memory. From Mind to Molecules.” by Larry Squire & Eric Kandel.

Working memory

Using Wikipedia’s open source book creator I have pulled together a collection of Wikipedia articles related to this post: Working_Memory_WikiBook

Alan Baddeley & Graham Hitch

 

Dissatisfied with inconsistent theories of short-term memory, Allen Baddeley & Graham Hitch introduced in 1974 a multi-component theory of working memory.

Roughly speaking, we can think of working memory as that aspect of memory we bring to bear on holding relevant information in the forefront of our minds as carry out more or less complex tasks.

Baddeley and Hitch proposed that working memory consists in broad outline of a central executive that coordinates information, and two “slave” systems, the phonological loop that stores and updates information about sounds, and a visuo-spatial sketch pad that stores and updates visual information.

Neurological studies have confirmed the Baddeley-Hitch model in broad outline (Oxford Handbook of Memory, pp. 77-92)

Cognitive load: why mathematics teachers need to know about working memory

John Sweller

The need for teachers of mathematics to know something about the functioning of working memory is clear: students must use working memory in order to solve mathematical problems.

The need for mathematics teachers to know details about working memory would be less were it not for the empirical fact that working memory is very limited in its capacity, and training in the use of working memory is generally not effective in increasing its capacity.

What this means in practice is that mathematics teachers need to be very aware of the cognitive load of a mathematical  problem – the stress the problem is likely to place on individual student’s working memory.

The explicit concept of cognitive load originated with George Miller and was widely elucidated in problem solving by John Sweller.

In an earlier post I wrote about reducing cognitive load in algebra, and how John Sweller’s ideas, which I misunderstood for a long time, are very helpful in reducing cognitive load in mathematical problem solving.

Inappropriate language can stress working memory

I also wrote in an earlier post how the wording of a problem can significantly increase the cognitive load for a student.

The example used there was the following:

Sandy’s family does its laundry at a coin-operated laundromat. It costs $1.25 per load to use the washing machines and 25¢ per load to use the dryers for 10 minutes. Sandy’s family has 5 loads of laundry to do and each load will need to be in a dryer for 30 minutes. Which expression will give Sandy’s family the total cost of doing these loads of laundry?

A. ($1.25 + $0.25) × 3 × 5

B. [$1.25 + (3 × $0.25)] × 5

C. [(3 × $1.25) + $0.25] × 5

D. 3 × ($1.25 + $0.25) × 5

From the 2002 Washington Assessment of Student Learning (WASL) for Mathematics.

About half (49.9%) of more than 70,000 students who took the test were unable to manage the cognitive demands of this problem to select the correct answer. (Choice B)

About one-third (33.9%) of the students linked the information within the second sentence (Choices A and D) instead of linking information from the second sentence with information from the third sentence.

Students’ lack of prior experience with laundromats could be expected to impact their success rate.

What is really being tested by this problem?

Use of the pronoun it in the sentence, “It costs $1.25 per load to use the washing machines and 25¢ per load to use the dryers for 10 min,”

Compounding & cognitive demands; “and 25¢ per load,” links the “25¢ per load” with the washing machine load until the end of the sentence -prior experience with laundromats signals the reader to interpret the sentence differently.

Spanish speakers, for example, may interpret the words to do as make.

Knowledge assumptions: a student may be familiar with wash clothes in English but not with the word laundry, and students whose families do laundry at home may not understand the word laundromat.

Load is usually first learned as a verb and when second-language learners read the word expression, they may, for example, think about what someone’s face looks like.

For many ESL students, English first names are not easily recognized; “What is a Sandy?”

Intrinsically cognitively challenging problems

Empirically, some problems seem to increase cognitive load for many students, irrespective of how they are worded. The problem at the very beginning of this post is such an example.

Why this should be so is not at all clear.

 

 

 

 

 

 

 

 

 

 

 

The curious case of the number 3435

Posted by: Gary Ernest Davis on: April 17, 2011

The (base 10) number 3435 has the curious property that 3^3+4^4+3^3+5^5 =3435

It shares this property with 1 since 1^1=1.

What makes 3435 even more curious is that it is the only number other than 1 that has this property.

To prove this we need to talk a little more exactly about what is this property.

Baron von Münchhausen

The Münchausen property

Suppose n is a positive integer and $latex d_k, see ldots d_1, patient d_0$ are the base 10 digits of n.

This means – a fact every elementary teacher of mathematics tries to get across to students when teaching place value – that

n= d_k	imes 10^k+ldots d_1	imes 10+d_0

So given that n=d_kd_{k-1}ldots d_1d_0 (base 10) we form a new number:

n^*=d_k^{d_k}+d_{k-1}^{d_{k-1}}+ldots d_1^{d_1}+d_0^{d_0}

The property we are interested in – sometimes called the Münchausen property – is that n=n^*.

So we see that 1^*=1 	extrm{ and } 3435^*=3435.

We will now see that there is no other positive integer n for which n=n^*.

But first, store a little excursion into properties of the function x^x.

Some properties of x^x, x>0 and a convention for 0^0

We should have discussed what happens if a digit of the positive integer n is 0: because, then, we have to assign a value to 0^0.

There is no magic way to decide how to assign a value to 0^0 – we will use the continuity of the function F(x):=x^x for x>0:

Graph of F(x)=x^x for x>0

Because the limit of F(x)=x^x as x approaches 0 with x>0 is 1 we assign the value 1 	extrm{ to } 0^0.

There is nothing magic about this – it just turns out convenient for our purposes here to have 0^0=1.

We can see the F(x)=x^x initially decreases as x increases, reaches a minimum value, and then increases.

We can see this from the derivative frac{dx^x}{dx} of x^x, which we can calculate by first taking (natural) logarithms:

log(x^x)=xlog(x) so frac{frac{dx^x}{dx}}{x^x}=1+log(x) and therefore frac{dx^x}{dx}=x^x(1+log(x))

This is negative for 0<x<frac{1}{e} and positive for x>frac{1}{e}.

So, for non-negative integer values of x the function F is non-decreasing: in fact, apart from F(0)=F(1)=1, we have F(n+1)>F(n) for all positive integers ngeq 1.

The number of digits of a positive integer

For a positive integer n the number of (base 10) digits of n is the floor of log_{10}(n)+1, the largest integer less than, or equal to, log_{10}(n)+1.

This means that the number of digits of n is less than log_{10}(n)+1.

An inequality for n^*

If the base 10 digits of the positive integer n are d_k,ldots , d_1, d_0 then:

  1. 0leq d_i leq 9 for 0leq ileq k
  2. The number of digits of n is k+1 leq log_{10}(n)+1

So, n^*=d_k^{d_k}+ldots +d_1^{d_1}+d_0^{d_0} leq (k+1) 9^9 leq 9^9(log_{10}(n)+1)

This says that n^* cannot grow too big in terms of the number of digits of n.

An inequality for large n

We look at the behavior of the function G(x):=frac{x}{log_{10}(x)}:

Graph of x/log10(x) for x>1

The derivative of G(x) is frac{dG(x)}{dx}=log(10)frac{log(x)-1}{log^2(x)} and this is positive for x>e.

So, for n>2	imes 10^{10} =20000000000 >e we have:

frac{n}{log_{10}(n)+1}>frac{2	imes 10^{10}}{10log_{10}(10)+log_{10}(2)+1}

>frac{2	imes 10^{10}}{2	imes 10 log_{10}(10)}=10^9>9^9

x

In other words, for n> 2	imes 10^{10} = 20000000000 we have n> 9^9 (log_{10}(n)+1)

Positive integers n> 2	imes 10^{10}=20000000000  cannot be equal to n^*

x

If n is too big – for instance, n>2	imes 10^{10} = 20000000000 – then n cannot be equal to n^*.

The reason is that for n>2	imes 10^{10} we have n> 9^9(log_{10}(n)+1) while n^*leq 9^9(log_{10}(n)+1)

So we search through all positive integers up to 20000000000 and find no integers n with n=n^* other than n=1, n=3435.

Variation on this theme

Suppose instead of forming n^* as we did, we move the digits forward, with the first digit d_0 moving around to be last: in other words, we form a new number n^{**}:= d_k^{d_0}+d_{k-1}^{d_k}+ldots +d_1^{d_2}+d_0^{d_1}.

Do we ever have n=n^{**} ?

Well, yes: we do for n=1, 4155, 4355 because 4^5+1^4+5^1+5^5 = 4155 and 4^5+3^4+5^3+5^5=4355

Are there any others?

What if we move each digit forward two (with the first two cycling around to be be last and second last)?

References

van Berkel, D. (2009) On a curious property of 3435. Retrieved from arxiv.org: On_a_curious_property_of_3435 [This article provides the argument I have described in this post]

Perfect digit-to-digit invariant Wikipedia.org [In this reference another number is counted as a Munchausen number due to their using the convention 0^0=0]