given a vector of numbers, find the smallest number to be divisible by all of them with a remainder of 1. Note: input numbers will always be greater than 1
Solution Stats
Problem Recent Solvers25
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
3217 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
1103 Solvers
-
Create a square matrix of multiples
342 Solvers
-
Find the index of the largest value in any vector X=[4,3,4,5,9,12,0,4.....5]
255 Solvers
-
194 Solvers
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Problem Tags