After determining the nude numbers, or the numbers that openly display some of their divisors as their digits, one would think that the modest numbers were those not divisible by any of their digits. Instead a modest number x is one that can be divided into two parts a and b such that when x is divided by b, the remainder is a. For example, 411 is modest because it can be divided into 4 and 11, and dividing 411 by 11 leaves a remainder of 4.
Write a function to list the modest numbers up to n.
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers15
Suggested Problems
-
Extract leading non-zero digit
2251 Solvers
-
Remove the small words from a list of words.
1565 Solvers
-
Generate a random matrix A of (1,-1)
430 Solvers
-
Find two triangular numbers whose sum is input.
103 Solvers
-
Create block matrix of integers (j+k-1) - Part I
121 Solvers
More from this Author323
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
No one has asked whether a must be at the big end and b at the small end, or could they be swapped. The answer is clearly yes, a is at the big end. If you could swap them, every multiple of 10 would be a solution (among many others). The test cases show multiples of 10 are not solutions to the first few.