CUNY Math Challenge Blog

Solutions, Resources, Further Information & Discussion

Round 4: Problem 1

with 2 comments

Alice’s brother Bob won a math contest in 2007 by writing 2007 as a sum of positive integers that together used each of the digits 0, 1, 2,…, 9 exactly once. Bob’s sum was 2007 = 1907 + 84 + 2 + 3 + 5 + 6. Alice wants to prepare for the final round of the 2009 CUNY Math Challenge by writing 2009 as a sum of positive integers that together use each of the digits 0, 1, 2,…, 9 exactly once. Either give a sum of numbers that Alice could use, or prove that there is no such sum. (Of course, no positive integer can begin with the digit 0.)

Advertisements

Written by Administrator

April 13, 2009 at 02:59

Posted in Round 4

2 Responses

Subscribe to comments with RSS.

  1. =_= How come all questions of this round are prove problem???

    Utin p

    April 22, 2009 at 17:53

  2. Since the sum of the digits 2+0+0+9 differs mod 3 from the sum of the digits 0 through 9, there is no solution.

    jim

    April 27, 2009 at 07:49


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

w

Connecting to %s

%d bloggers like this: