Added new feature Schur_Number #14493
Conversation
| for j in subset: | ||
| if i + j in subset: | ||
| raise AssertionError("This subset is not sum free") | ||
| return "Everything is correct" |
| """ | ||
| Checks if the occurance of all numbers is exactly one | ||
| """ | ||
| t = 0 |
There was a problem hiding this comment.
Tests should go inside of a test function. See how the other test files in SymPy are organized.
|
Would it also be useful for this function to work symbolically? |
Abdullahjavednesar
added
the
PR: author's turn
|
I have changed the files now and I added the symbolic representation of the inequality. I think that the result of the function cannot be represented symbolically because there is no formula derived except from the last subset which has numbers of the form 3*n + 1 |
Abdullahjavednesar
added
PR: sympy's turn
and removed
PR: author's turn
|
Symbolically means the function would be a Function subclass which remains unevaluated on symbolic inputs. |
Abdullahjavednesar
added
PR: author's turn
|
It looks like a nice feature. @slacker404 Would you like to continue your work on this? |
czgdp1807
added
Please take over
and removed
PR: author's turn
|
I would like to work on this. Please guide as to what is remaining to be implemented. I will come up with a PR soon |
|
I would like to revive this PR, and I am planning to do it today. @sachin-4099 We can work on this together if its ok with you, it is fine by me. |
It is fine by me.. |
|
Closing in favour of #18667 |
The Schur number S(k) is the largest integer n for which the interval [1,n] can be partitioned into k sum-free sets. http://mathworld.wolfram.com/SchurNumber.html
I have also made the partition which can be proven by induction and I have added test cases