My Math Forum  

Go Back   My Math Forum > College Math Forum > Applied Math

Applied Math Applied Math Forum


Thanks Tree1Thanks
  • 1 Post By Maschke
Reply
 
LinkBack Thread Tools Display Modes
March 17th, 2017, 03:17 PM   #1
Newbie
 
Joined: Mar 2017
From: UK

Posts: 1
Thanks: 0

Sets and number theory

Given integer n and S(=set of integers), does there exist S' ⊆ S such that the sum of S' is equal to n?

What is the main algorithm behind this problem? How do you go about solving this?
randomquestion is offline  
 
March 17th, 2017, 04:39 PM   #2
Senior Member
 
Joined: Aug 2012

Posts: 1,376
Thanks: 327

Quote:
Originally Posted by randomquestion View Post
Given integer n and S(=set of integers), does there exist S' ⊆ S such that the sum of S' is equal to n?

What is the main algorithm behind this problem? How do you go about solving this?
This is the famous subset-sum problem. It seems to be all the rage these days. I keep seeing it on Reddit. The Wiki link will get you started.
Thanks from randomquestion
Maschke is offline  
Reply

  My Math Forum > College Math Forum > Applied Math

Tags
number, sets, theory



Thread Tools
Display Modes


Similar Threads
Thread Thread Starter Forum Replies Last Post
Sets theory, need to proof. Pranas Applied Math 3 March 4th, 2014 02:16 PM
Problem on sets theory pierrevanstulov1 Applied Math 1 February 19th, 2013 10:18 AM
Graph theory and number theory proglote Number Theory 3 October 30th, 2011 04:20 PM
number and sets hoyy1kolko Algebra 4 March 15th, 2011 06:44 AM
Number and sets hoyy1kolko Algebra 4 March 13th, 2011 12:00 AM





Copyright © 2017 My Math Forum. All rights reserved.