https://github.com/jakeburden/sum-of-multiples

Finds the sum of all multiples of numbers in an array below a maximum number.
https://github.com/jakeburden/sum-of-multiples

Last synced: 1 day ago
JSON representation

Finds the sum of all multiples of numbers in an array below a maximum number.

• Host: GitHub
• URL: https://github.com/jakeburden/sum-of-multiples
• Owner: jakeburden
• Created: 2016-01-15T04:00:12.000Z (almost 9 years ago)
• Default Branch: master
• Last Pushed: 2016-01-15T14:23:35.000Z (almost 9 years ago)
• Last Synced: 2024-12-09T01:40:02.621Z (about 1 month ago)
• Language: JavaScript
• Size: 2.93 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: readme.markdown

Awesome Lists containing this project

README

        
## sum-of-multiples

[![build status](http://img.shields.io/travis/jekrb/sum-of-multiples.svg?style=flat)](http://travis-ci.org/jekrb/sum-of-multiples)

[![js-standard-style](https://cdn.rawgit.com/feross/standard/master/badge.svg)](https://github.com/feross/standard)

Get the sum of multiples of each number in an array below a maximum number.

```

npm install sum-of-multiples -S

```

### Usage

``` js

/*

If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.

Find the sum of all the multiples of 3 or 5 below 1000.

*/

var sumOfMultiples = require('sum-of-multiples')

var example = sumOfMultiples([3, 5], 10)

console.log(example) // 23

var answer = sumOfMultiples([3, 5], 1000)

```

### API

#### sumOfMultiples([array of integers], maximum integer)

### License

MIT