My Math Forum special unique sum

 Number Theory Number Theory Math Forum

 June 10th, 2012, 11:06 AM #1 Newbie   Joined: Jul 2010 Posts: 3 Thanks: 0 special unique sum Does there exist a group of n distinct integers such that the sum of them with each integer appearing only once is not equal to the sum of n of them with at least one of them appearing more than once? These numbers should be polynomial with respect to n.Thanks.
 June 11th, 2012, 05:47 AM #2 Global Moderator     Joined: Nov 2006 From: UTC -5 Posts: 16,046 Thanks: 938 Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms Re: special unique sum Clearly not for n = 0 or n = 1. For n = 2 you're looking for integers a < b such that a + b = 2a or a + b = 2b, impossible. For n = 3 you need a < b < c with a + b + c = 3b, the other cases being impossible. This is possible, just take x - y, x, x + y for any integer x and any nonzero integer y. The same technique works for any odd n > 2. A modification works for even n > 2: take x - ky, x - (k-1)y, ..., x - y, x + y, ..., x + (k-1)y, x + y and replace with k each of x - y and x + y.

 Tags special, sum, unique

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post shine123 Linear Algebra 4 September 28th, 2012 08:00 AM aaron-math Linear Algebra 1 September 30th, 2011 02:33 PM rickzeen Economics 1 January 20th, 2009 06:46 AM Ann Abstract Algebra 0 November 25th, 2006 05:41 PM rickzeen New Users 1 December 31st, 1969 04:00 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top