Nines: Trivia Question?

classic Classic list List threaded Threaded
11 messages Options
Reply | Threaded
Open this post in threaded view
|

Nines: Trivia Question?

Robert J. Cordingley
I probably should know this...

So when you rearrange the digits of a number (>9) and take the
difference, it is divisible by nine.  A result that sometimes points to
accounting errors.  If the numbers are not base 10 the result is
divisible by (base-1).

What is the associated theorem for this?

Thanks
Robert



============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org
Reply | Threaded
Open this post in threaded view
|

Re: Nines: Trivia Question?

Tom Carter
Robert -

  There's a reasonably good discussion of this here:

     http://mathforum.org/library/drmath/view/58518.html

  Thanks . . .

tom

On Oct 8, 2012, at 9:20 AM, Robert J. Cordingley <[hidden email]> wrote:

> I probably should know this...
>
> So when you rearrange the digits of a number (>9) and take the difference, it is divisible by nine.  A result that sometimes points to accounting errors.  If the numbers are not base 10 the result is divisible by (base-1).
>
> What is the associated theorem for this?
>
> Thanks
> Robert
>
>
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9a-11:30 at cafe at St. John's College
> lectures, archives, unsubscribe, maps at http://www.friam.org
>


============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org
Reply | Threaded
Open this post in threaded view
|

Re: Nines: Trivia Question?

Dean Gerber
In reply to this post by Robert J. Cordingley
You have the theorem.

Guide to the proof. For a four digit number abcd the value in positional notation is a1000 + b100 + c10 + d.   If  a'b'c'd' is the rearranged number, the value is a'1000 + b'100 + c'10 + d', and the difference is

(a-a')1000 + (b-b')100 + (c-c')10 + (d-d') =

(a-a')(999 +1) + (b - b')(99 +1) + (c-c')(9+1) + (d-d') = 

(a-a')(999) + (b-b')(99) + (c-c')(9) + (d-d') +  (a-a') + (b- b') + (c-c')

Clearly the last 4 terms sum to zero, because the primed numbers are just a rearrangement on the unprimed ones, and the first three terms are divisible by 9

Dean Gerber


From: Robert J. Cordingley <[hidden email]>
To: The Friday Morning Applied Complexity Coffee Group <[hidden email]>
Sent: Monday, October 8, 2012 10:20 AM
Subject: [FRIAM] Nines: Trivia Question?

I probably should know this...

So when you rearrange the digits of a number (>9) and take the difference, it is divisible by nine.  A result that sometimes points to accounting errors.  If the numbers are not base 10 the result is divisible by (base-1).

What is the associated theorem for this?

Thanks
Robert



============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org



============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org
Reply | Threaded
Open this post in threaded view
|

Re: Nines: Trivia Question?

Frank Wimberly
In reply to this post by Robert J. Cordingley
Number = a*10 + b
Rearranged = b*10 + a

Difference = (b - a)*10 + (a - b) = 9*(b - a)



Frank C. Wimberly
140 Calle Ojo Feliz
Santa Fe, NM 87505

[hidden email]     [hidden email]
Phone:  (505) 995-8715      Cell:  (505) 670-9918


-----Original Message-----
From: [hidden email] [mailto:[hidden email]] On Behalf
Of Robert J. Cordingley
Sent: Monday, October 08, 2012 10:21 AM
To: The Friday Morning Applied Complexity Coffee Group
Subject: [FRIAM] Nines: Trivia Question?

I probably should know this...

So when you rearrange the digits of a number (>9) and take the difference,
it is divisible by nine.  A result that sometimes points to accounting
errors.  If the numbers are not base 10 the result is divisible by (base-1).

What is the associated theorem for this?

Thanks
Robert



============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College lectures, archives,
unsubscribe, maps at http://www.friam.org



============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org
Reply | Threaded
Open this post in threaded view
|

Re: Nines: Trivia Question?

Russ Abbott
Dean, I like your proof illustration.  Wonderful.
 
-- Russ Abbott
_____________________________________________
  Professor, Computer Science
  California State University, Los Angeles

  My paper on how the Fed can fix the economy: ssrn.com/abstract=1977688
  Google voice: 747-999-5105
  CS Wiki and the courses I teach
_____________________________________________ 




On Mon, Oct 8, 2012 at 10:13 AM, Frank Wimberly <[hidden email]> wrote:
Number = a*10 + b
Rearranged = b*10 + a

Difference = (b - a)*10 + (a - b) = 9*(b - a)



Frank C. Wimberly
140 Calle Ojo Feliz
Santa Fe, NM 87505

[hidden email]     [hidden email]
Phone:  <a href="tel:%28505%29%20995-8715" value="+15059958715">(505) 995-8715      Cell:  <a href="tel:%28505%29%20670-9918" value="+15056709918">(505) 670-9918


-----Original Message-----
From: [hidden email] [mailto:[hidden email]] On Behalf
Of Robert J. Cordingley
Sent: Monday, October 08, 2012 10:21 AM
To: The Friday Morning Applied Complexity Coffee Group
Subject: [FRIAM] Nines: Trivia Question?

I probably should know this...

So when you rearrange the digits of a number (>9) and take the difference,
it is divisible by nine.  A result that sometimes points to accounting
errors.  If the numbers are not base 10 the result is divisible by (base-1).

What is the associated theorem for this?

Thanks
Robert



============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College lectures, archives,
unsubscribe, maps at http://www.friam.org



============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org


============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org
Reply | Threaded
Open this post in threaded view
|

Re: Nines: Trivia Question?

Robert J. Cordingley
In reply to this post by Tom Carter
May be I should reframe the question.

How do you prove there isn't a system of numbers to base N where it
doesn't work?

Thanks,
Robert

On 10/8/12 11:00 AM, Tom Carter wrote:

> Robert -
>
>    There's a reasonably good discussion of this here:
>
>       http://mathforum.org/library/drmath/view/58518.html
>
>    Thanks . . .
>
> tom
>
> On Oct 8, 2012, at 9:20 AM, Robert J. Cordingley <[hidden email]> wrote:
>
>> I probably should know this...
>>
>> So when you rearrange the digits of a number (>9) and take the difference, it is divisible by nine.  A result that sometimes points to accounting errors.  If the numbers are not base 10 the result is divisible by (base-1).
>>
>> What is the associated theorem for this?
>>
>> Thanks
>> Robert
>>
>>
>>
>> ============================================================
>> FRIAM Applied Complexity Group listserv
>> Meets Fridays 9a-11:30 at cafe at St. John's College
>> lectures, archives, unsubscribe, maps at http://www.friam.org
>>
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9a-11:30 at cafe at St. John's College
> lectures, archives, unsubscribe, maps at http://www.friam.org
>
>


============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org
Reply | Threaded
Open this post in threaded view
|

Re: Nines: Trivia Question?

Joshua Thorp
I think you just replace '9' with 'n-1' in Dean or Frank's answer and you have a general proof, for n>=2.

I suppose you may need to convince yourself that a number like n^k - 1 == (n-1)*n^(k-1) + (n-1)*n^(k-2) + … + (n-1)*(k-k).  

--joshua

On Oct 8, 2012, at 11:37 AM, Robert J. Cordingley wrote:

> May be I should reframe the question.
>
> How do you prove there isn't a system of numbers to base N where it doesn't work?
>
> Thanks,
> Robert
>
> On 10/8/12 11:00 AM, Tom Carter wrote:
>> Robert -
>>
>>   There's a reasonably good discussion of this here:
>>
>>      http://mathforum.org/library/drmath/view/58518.html
>>
>>   Thanks . . .
>>
>> tom
>>
>> On Oct 8, 2012, at 9:20 AM, Robert J. Cordingley <[hidden email]> wrote:
>>
>>> I probably should know this...
>>>
>>> So when you rearrange the digits of a number (>9) and take the difference, it is divisible by nine.  A result that sometimes points to accounting errors.  If the numbers are not base 10 the result is divisible by (base-1).
>>>
>>> What is the associated theorem for this?
>>>
>>> Thanks
>>> Robert
>>>
>>>
>>>
>>> ============================================================
>>> FRIAM Applied Complexity Group listserv
>>> Meets Fridays 9a-11:30 at cafe at St. John's College
>>> lectures, archives, unsubscribe, maps at http://www.friam.org
>> ============================================================
>> FRIAM Applied Complexity Group listserv
>> Meets Fridays 9a-11:30 at cafe at St. John's College
>> lectures, archives, unsubscribe, maps at http://www.friam.org
>>
>>
>
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9a-11:30 at cafe at St. John's College
> lectures, archives, unsubscribe, maps at http://www.friam.org


============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org
Reply | Threaded
Open this post in threaded view
|

Re: Nines: Trivia Question?

Robert J. Cordingley
...and I guess (base) n can be rational, irrational or even imaginary.
Thanks
Robert

On 10/8/12 12:02 PM, Joshua Thorp wrote:

> I think you just replace '9' with 'n-1' in Dean or Frank's answer and you have a general proof, for n>=2.
>
> I suppose you may need to convince yourself that a number like n^k - 1 == (n-1)*n^(k-1) + (n-1)*n^(k-2) + … + (n-1)*(k-k).
>
> --joshua
>
> On Oct 8, 2012, at 11:37 AM, Robert J. Cordingley wrote:
>
>> May be I should reframe the question.
>>
>> How do you prove there isn't a system of numbers to base N where it doesn't work?
>>
>> Thanks,
>> Robert
>>
>> On 10/8/12 11:00 AM, Tom Carter wrote:
>>> Robert -
>>>
>>>    There's a reasonably good discussion of this here:
>>>
>>>       http://mathforum.org/library/drmath/view/58518.html
>>>
>>>    Thanks . . .
>>>
>>> tom
>>>
>>> On Oct 8, 2012, at 9:20 AM, Robert J. Cordingley <[hidden email]> wrote:
>>>
>>>> I probably should know this...
>>>>
>>>> So when you rearrange the digits of a number (>9) and take the difference, it is divisible by nine.  A result that sometimes points to accounting errors.  If the numbers are not base 10 the result is divisible by (base-1).
>>>>
>>>> What is the associated theorem for this?
>>>>
>>>> Thanks
>>>> Robert
>>>>
>>>>
>>>>
>>>> ============================================================
>>>> FRIAM Applied Complexity Group listserv
>>>> Meets Fridays 9a-11:30 at cafe at St. John's College
>>>> lectures, archives, unsubscribe, maps at http://www.friam.org
>>> ============================================================
>>> FRIAM Applied Complexity Group listserv
>>> Meets Fridays 9a-11:30 at cafe at St. John's College
>>> lectures, archives, unsubscribe, maps at http://www.friam.org
>>>
>>>
>>
>> ============================================================
>> FRIAM Applied Complexity Group listserv
>> Meets Fridays 9a-11:30 at cafe at St. John's College
>> lectures, archives, unsubscribe, maps at http://www.friam.org
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9a-11:30 at cafe at St. John's College
> lectures, archives, unsubscribe, maps at http://www.friam.org
>
>


============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org
Reply | Threaded
Open this post in threaded view
|

Re: Nines: Trivia Question?

Joshua Thorp
Not sure about that.  This whole thing (at least to begin with) has to do with writing numbers in the place notation. Not sure what this would mean in rational, irrational or imaginary base system. I think integers were implied in this. ;)

--joshua

On Oct 8, 2012, at 3:15 PM, Robert J. Cordingley wrote:

> ...and I guess (base) n can be rational, irrational or even imaginary.
> Thanks
> Robert
>
> On 10/8/12 12:02 PM, Joshua Thorp wrote:
>> I think you just replace '9' with 'n-1' in Dean or Frank's answer and you have a general proof, for n>=2.
>>
>> I suppose you may need to convince yourself that a number like n^k - 1 == (n-1)*n^(k-1) + (n-1)*n^(k-2) + … + (n-1)*(k-k).
>>
>> --joshua
>>
>> On Oct 8, 2012, at 11:37 AM, Robert J. Cordingley wrote:
>>
>>> May be I should reframe the question.
>>>
>>> How do you prove there isn't a system of numbers to base N where it doesn't work?
>>>
>>> Thanks,
>>> Robert
>>>
>>> On 10/8/12 11:00 AM, Tom Carter wrote:
>>>> Robert -
>>>>
>>>>   There's a reasonably good discussion of this here:
>>>>
>>>>      http://mathforum.org/library/drmath/view/58518.html
>>>>
>>>>   Thanks . . .
>>>>
>>>> tom
>>>>
>>>> On Oct 8, 2012, at 9:20 AM, Robert J. Cordingley <[hidden email]> wrote:
>>>>
>>>>> I probably should know this...
>>>>>
>>>>> So when you rearrange the digits of a number (>9) and take the difference, it is divisible by nine.  A result that sometimes points to accounting errors.  If the numbers are not base 10 the result is divisible by (base-1).
>>>>>
>>>>> What is the associated theorem for this?
>>>>>
>>>>> Thanks
>>>>> Robert
>>>>>
>>>>>
>>>>>
>>>>> ============================================================
>>>>> FRIAM Applied Complexity Group listserv
>>>>> Meets Fridays 9a-11:30 at cafe at St. John's College
>>>>> lectures, archives, unsubscribe, maps at http://www.friam.org
>>>> ============================================================
>>>> FRIAM Applied Complexity Group listserv
>>>> Meets Fridays 9a-11:30 at cafe at St. John's College
>>>> lectures, archives, unsubscribe, maps at http://www.friam.org
>>>>
>>>>
>>>
>>> ============================================================
>>> FRIAM Applied Complexity Group listserv
>>> Meets Fridays 9a-11:30 at cafe at St. John's College
>>> lectures, archives, unsubscribe, maps at http://www.friam.org
>>
>> ============================================================
>> FRIAM Applied Complexity Group listserv
>> Meets Fridays 9a-11:30 at cafe at St. John's College
>> lectures, archives, unsubscribe, maps at http://www.friam.org
>>
>>
>
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9a-11:30 at cafe at St. John's College
> lectures, archives, unsubscribe, maps at http://www.friam.org


============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org
Reply | Threaded
Open this post in threaded view
|

Re: Nines: Trivia Question?

Dean Gerber
In reply to this post by Robert J. Cordingley
I don't think so.  The original point (2500 years ago ?) was and still is to have a compact notation for the natural numbers that avoids the problem of naming all or at a least large number of them individually. In English we name the first few numbers individually: zero, one, two, three ... ten, eleven, twelve, at which point we begin to notice that this is becoming cumbersome. We wobble on to the equivalent , three-teen, four-teen, five-teen, ... nine-teen, and then get more and more rational and closer and closer to a positional system as the numbers get ever larger.  We can at least always figure the value of our names once we have mastered the art of combining a small number of basic words:

one two three ...nineteen

twenty thirty .. .ninety (we are getting there: twenty = two-tens, thirty = three-tens, etc)

hundred, thousand, million, billion, trillion, quadrillion ...

Quick now: express 75853729915229585876325067 in "words"

The point of positional notation is to use a very small set of atomic symbols, the "numerals",  say N of them, which form an ordered sequence that "names" the first N-1 natural numbers 0, 1, 2,  ... , N-1 (N some definite natural number, "two", "ten", sixteen", "sixty" etc., the "base"). The natural numbers are then symbolized by strings of these numerals.  The value assigned to any particular numeral in a particular position within a string is that numeral times the base raised to the power of that numeral's position in the string (positions in the string are indexed right to left by the natural numbers starting at 0 at the rightmost position).  The value of the string as whole is the sum of the all values assigned to each particular numeral at its particular position.

1. The simplest notation: binary - base 2, numerals {0,1}.
2.  Common early computer world: octal - base 8, numerals {0 ... 7}.
3.  Most common modern: decimal - base 10, numerals {0 ... 9}
4.  Modern computer world:  hexadecimal (senidenary) - base 16, numerals {0 ... 9 a b c d e f}
5.  Most incredible:  sexagesimal  (Babylonian): - base 60, numerals { ingenious! value of each numeral can be derived from its symbol}

All Babylonian children had to memorize the multiplication and addition tables or Be Left Behind ;) winking

Much follows from this incredible idea.  We can create rational and even real numbers out of the notation by adding to our set of numerals the point symbol ( usually ".") and assigning negative powers of the base to the positions right of the point.  All of our algorithms for adding, subtracting, multiplying and dividing numbers are consequences of the positional notation.

Joshua Thorp is exactly correct.  The formula he presents is the very elementary formula for the sum of a finite geometric series.

Dean Gerber



From: Robert J. Cordingley <[hidden email]>
To: The Friday Morning Applied Complexity Coffee Group <[hidden email]>
Sent: Monday, October 8, 2012 3:15 PM
Subject: Re: [FRIAM] Nines: Trivia Question?

...and I guess (base) n can be rational, irrational or even imaginary.
Thanks
Robert

On 10/8/12 12:02 PM, Joshua Thorp wrote:

> I think you just replace '9' with 'n-1' in Dean or Frank's answer and you have a general proof, for n>=2.
>
> I suppose you may need to convince yourself that a number like n^k - 1 == (n-1)*n^(k-1) + (n-1)*n^(k-2) + … + (n-1)*(k-k).
>
> --joshua
>
> On Oct 8, 2012, at 11:37 AM, Robert J. Cordingley wrote:
>
>> May be I should reframe the question.
>>
>> How do you prove there isn't a system of numbers to base N where it doesn't work?
>>
>> Thanks,
>> Robert
>>
>> On 10/8/12 11:00 AM, Tom Carter wrote:
>>> Robert -
>>>
>>>    There's a reasonably good discussion of this here:
>>>
>>>      http://mathforum.org/library/drmath/view/58518.html
>>>
>>>    Thanks . . .
>>>
>>> tom
>>>
>>> On Oct 8, 2012, at 9:20 AM, Robert J. Cordingley <[hidden email]> wrote:
>>>
>>>> I probably should know this...
>>>>
>>>> So when you rearrange the digits of a number (>9) and take the difference, it is divisible by nine.  A result that sometimes points to accounting errors.  If the numbers are not base 10 the result is divisible by (base-1).
>>>>
>>>> What is the associated theorem for this?
>>>>
>>>> Thanks
>>>> Robert
>>>>
>>>>
>>>>
>>>> ============================================================
>>>> FRIAM Applied Complexity Group listserv
>>>> Meets Fridays 9a-11:30 at cafe at St. John's College
>>>> lectures, archives, unsubscribe, maps at http://www.friam.org
>>> ============================================================
>>> FRIAM Applied Complexity Group listserv
>>> Meets Fridays 9a-11:30 at cafe at St. John's College
>>> lectures, archives, unsubscribe, maps at http://www.friam.org
>>>
>>>
>>
>> ============================================================
>> FRIAM Applied Complexity Group listserv
>> Meets Fridays 9a-11:30 at cafe at St. John's College
>> lectures, archives, unsubscribe, maps at http://www.friam.org
>
> ============================================================
> FRIAM Applied Complexity Group listserv
> Meets Fridays 9a-11:30 at cafe at St. John's College
> lectures, archives, unsubscribe, maps at http://www.friam.org
>
>


============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org



============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org
Reply | Threaded
Open this post in threaded view
|

Re: Nines: Trivia Question?

Bruce Sherwood
I speak Esperanto, in which the number system goes like this:

0-9: nulo, unu, du, tri, kvar, kvin, ses, sep, ok, nau, dek
10-19: dek-unu, dek-du, dek-tri, dek-kvar, dek-kvin, dek-ses, dek-sep, dek-ok, dek-nau
20-29: dudek-unu, dudek-du, dudek-tri, etc.
....
100-109: cent, cent-unu, cent-du, cent-tri, etc.
...
1000-1009: mil, mil-unu, mil-du, mil-tri, etc.

2012 = du mil dek du

I'm told that Japanese has a similar simple way of naming the integers.

Bruce

On Mon, Oct 8, 2012 at 5:28 PM, Dean Gerber <[hidden email]> wrote:
I don't think so.  The original point (2500 years ago ?) was and still is to have a compact notation for the natural numbers that avoids the problem of naming all or at a least large number of them individually. In English we name the first few numbers individually: zero, one, two, three ... ten, eleven, twelve, at which point we begin to notice that this is becoming cumbersome. We wobble on to the equivalent , three-teen, four-teen, five-teen, ... nine-teen, and then get more and more rational and closer and closer to a positional system as the numbers get ever larger.  We can at least always figure the value of our names once we have mastered the art of combining a small number of basic words:

one two three ...nineteen

twenty thirty .. .ninety (we are getting there: twenty = two-tens, thirty = three-tens, etc)

hundred, thousand, million, billion, trillion, quadrillion ...

Quick now: express 75853729915229585876325067 in "words"

The point of positional notation is to use a very small set of atomic symbols, the "numerals",  say N of them, which form an ordered sequence that "names" the first N-1 natural numbers 0, 1, 2,  ... , N-1 (N some definite natural number, "two", "ten", sixteen", "sixty" etc., the "base"). The natural numbers are then symbolized by strings of these numerals.  The value assigned to any particular numeral in a particular position within a string is that numeral times the base raised to the power of that numeral's position in the string (positions in the string are indexed right to left by the natural numbers starting at 0 at the rightmost position).  The value of the string as whole is the sum of the all values assigned to each particular numeral at its particular position.

1. The simplest notation: binary - base 2, numerals {0,1}.
2.  Common early computer world: octal - base 8, numerals {0 ... 7}.
3.  Most common modern: decimal - base 10, numerals {0 ... 9}
4.  Modern computer world:  hexadecimal (senidenary) - base 16, numerals {0 ... 9 a b c d e f}
5.  Most incredible:  sexagesimal  (Babylonian): - base 60, numerals { ingenious! value of each numeral can be derived from its symbol}

All Babylonian children had to memorize the multiplication and addition tables or Be Left Behind ;) winking

Much follows from this incredible idea.  We can create rational and even real numbers out of the notation by adding to our set of numerals the point symbol ( usually ".") and assigning negative powers of the base to the positions right of the point.  All of our algorithms for adding, subtracting, multiplying and dividing numbers are consequences of the positional notation.

Joshua Thorp is exactly correct.  The formula he presents is the very elementary formula for the sum of a finite geometric series.

Dean Gerber



============================================================
FRIAM Applied Complexity Group listserv
Meets Fridays 9a-11:30 at cafe at St. John's College
lectures, archives, unsubscribe, maps at http://www.friam.org