Number Theory Number Theory Math Forum

 November 24th, 2010, 05:19 AM #1 Senior Member   Joined: Nov 2010 Posts: 288 Thanks: 1 computation problem suppose we have k diffirent odd numbers how many diffirent even numbers can we make out of them November 24th, 2010, 05:51 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: computation problem What does 'make' mean in this context? Multiplication? Addition? Decimal concatenation? November 24th, 2010, 06:06 AM #3 Senior Member   Joined: Nov 2010 Posts: 288 Thanks: 1 Re: computation problem IT MAENS BY ADDITION SORRY FOR VAGUENESS November 24th, 2010, 06:08 AM #4 Senior Member   Joined: Nov 2010 Posts: 288 Thanks: 1 Re: computation problem another important thing just adding two numbers not more here is ademonstration suppose we have 3 5 7 9 the even numbers by adding two r : 3+5=8 3+7=10 3+9=12 5+7=12 5+9=14 9+7=16 now 12 has been repeated so the number of diffirent even numbers is 5 November 24th, 2010, 06:40 AM #5 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: computation problem How many numbers can we add? Two? Unlimited? How many times can we use each number? Once? Unlimited? Given {1}, can we make 1 + 1 = 2? November 24th, 2010, 07:14 AM   #6
Senior Member

Joined: Nov 2010

Posts: 288
Thanks: 1

Re: computation problem

Quote:
 Originally Posted by CRGreathouse How many numbers can we add? Two? Unlimited? How many times can we use each number? Once? Unlimited? Given {1}, can we make 1 + 1 = 2?
u can add only two numbers and u can use the number as much as u can so yes u can write 1+1=2
thanks for concern buddy November 24th, 2010, 08:37 AM #7 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: computation problem Well there are k(k+1)/2 sums so we can't make more than that many even numbers. You can surely make at least 2k-1 even numbers. Both of these bounds are achievable. November 24th, 2010, 09:52 AM #8 Senior Member   Joined: Nov 2010 Posts: 288 Thanks: 1 Re: computation problem thanx man however i would have requested the exact number not abound November 24th, 2010, 10:22 AM   #9
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: computation problem

Quote:
 Originally Posted by islam thanx man however i would have requested the exact number not abound
In that case I'll need the numbers. November 24th, 2010, 10:26 AM #10 Senior Member   Joined: Nov 2010 Posts: 288 Thanks: 1 Re: computation problem i would request ageneral formula for any k u see with such formula (assuming that goldbachs conjecture is true) we will get avery good approximation for the distribution of prime numbers Tags computation, problem Thread Tools Show Printable Version Email this Page Display Modes Linear Mode Switch to Hybrid Mode Switch to Threaded Mode Similar Threads Thread Thread Starter Forum Replies Last Post ZardoZ Complex Analysis 0 May 4th, 2013 02:12 PM unm Number Theory 1 November 17th, 2012 10:58 AM mathbalarka Calculus 9 August 31st, 2012 06:40 AM ZardoZ Real Analysis 3 September 8th, 2011 05:49 AM juliette salexa Math Software 0 December 22nd, 2009 11:39 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top      