by Travis
Last Updated July 18, 2019 00:20 AM

How can I mathematically identify whether or not a number is divisible with no remainder using any combination of a given set of numbers?

Example:

Set of Numbers: 500, 250, 125, 75

Dividend: 650

I know that I can divide 650 by 500 which results in a remainder of 150 which is then divisible by 75 with no remainder, but how can I accomplish that mathematically without walking through the numbers programmatically?

I want to be able to identify that 650 meets that criteria, and that 651 does not.

- ServerfaultXchanger
- SuperuserXchanger
- UbuntuXchanger
- WebappsXchanger
- WebmastersXchanger
- ProgrammersXchanger
- DbaXchanger
- DrupalXchanger
- WordpressXchanger
- MagentoXchanger
- JoomlaXchanger
- AndroidXchanger
- AppleXchanger
- GameXchanger
- GamingXchanger
- BlenderXchanger
- UxXchanger
- CookingXchanger
- PhotoXchanger
- StatsXchanger
- MathXchanger
- DiyXchanger
- GisXchanger
- TexXchanger
- MetaXchanger
- ElectronicsXchanger
- StackoverflowXchanger
- BitcoinXchanger
- EthereumXcanger