Dear Colleague ,
I am interested in writing a simple program to solve following goal seeking function.
1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,2728,29,30. = SUM= 465
I want to get new SUM = 400 by modifying given set of numbers. I want to know all possible combinations that I can get sum 400. Are there any tools available for finding such generalize solution ?
1) You can replace any cell (element) by zero(0)
2) You can not change the value of cell other than 0
3) You cannot move the position of value.
Bharat
Prof. Breuer,
Many thanks for your kind suggestions. In my real problem I have sequence of 1,2,3...1000,000. I am interested to use a tool.
Sorry, I forgot to mention each subset should have 30 values. Some of them are zeros. Can you please share with me a toll you have used to calculate ?
Regards
Bharat
Prof. Breuer,
Thank you for your prompt response. I mean each subset should have exactly 30 elements . For above example I have length =30. However, I am interested trying for larger length. I am not familiar with Haskell language.
With kindest regards and Happy new year 2018.
Bharat
Prof. Breuer ,
Many many thanks for your detail explanation and kind help.
Bharat
You can solve it by using line equation (y=mx + b), though the numbers in the set are in ascending order.
Generalizing these type of data would be an interesting research paper.
Thanks for the question.
- Badges
- Science topic
- Similar topics
- Linguistics
- Composition Studies
- Writing