CUNY Math Challenge Blog

Solutions, Resources, Further Information & Discussion

Round 3: Problem 2

leave a comment »

A set of distinct positive integers is called “sweet” if it has the property that, for every 3 distinct elements—a,b and c—of the set, a+b+c is always prime. What is the largest size a “sweet” set can have?

Submissions for round 3 are due by Sunday, April 12 at 11:59 p.m. Solution will be posted (if we solve it) immediately after submissions are over.

Written by Administrator

March 30, 2009 at 00:51

Posted in Round 3

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 )

Connecting to %s

%d bloggers like this: