2n-1 problem

The 2n-1 problem says that if there are n elements then the minimal number of elements in a set which guarantees that there will be exactly n elements divisible by n is 2n-1

About Sumant Sumant

I love Math and I am always looking forward to collaborate with fellow learners. If you need help learning math then please do contact me.
This entry was posted in Famous Problem, Number Theory and tagged . Bookmark the permalink.

Leave a comment