# Weights

Imagine you have a set of 'weights' like the ones below, with two of each different weight.
You might like to think of the negative 'weights' as helium balloons...

Different combinations of the weights available allow you to make different totals.
Here are some examples:

$B + C = 6$
$B + 2C = 15$
$A + 2B + C = 4$
$2A + B + 2C + D = -10$

The largest total you can make is $20$. Check that you agree.
The smallest total you can make is $-60$. Again, check that you agree.

Is it possible to make all the numbers in between?

Is there a unique way of producing each total, or can you produce the same total in more than one way?

Now imagine choosing your own set of four weights (two positive and two negative), and you can have up to three of each weight

Which set of four weights allows you to make the largest range of totals with no gaps in between?

What if you can have up to four of each weight? Or five?... Or just two?

What if all the weights were positive?

With thanks to Don Steward, whose ideas formed the basis of this problem.

We'd love you to share how you've tried this and what you've discovered. You can add a comment below, or you can email us - your work may be featured in the showcase.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://wild.maths.org/weights", "fetch_time": 1493046667000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2017-17/segments/1492917119637.34/warc/CC-MAIN-20170423031159-00440-ip-10-145-167-34.ec2.internal.warc.gz", "warc_record_offset": 420513480, "warc_record_length": 8039, "token_count": 306, "char_count": 1225, "score": 3.765625, "int_score": 4, "crawl": "CC-MAIN-2017-17", "snapshot_type": "longest", "language": "en", "language_score": 0.9527860879898071, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00047-of-00064.parquet"}