Problem 2463. Sum of Dividend Digits

Created by Omer

Solve Later

Find the smallest number that consist of only number 1's (e.g. 11111111111) which satisfy a given divisor and remainder. Then return the sum of its digits.

Example:

 remainder = 7
 divisor = 12

then dividend = 1111 and the resulting sum is 4.

Solve

Solution Stats

53 Solutions
23 Solvers

Last Solution submitted on Jul 19, 2025

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Asif Newaz on 13 Mar 2020

is there any particular mathematical theory regarding this?..i cant find my way for large numbers.

Asif Newaz on 3 Jun 2025

Hint: For very large numbers made of many 1's, constructing the full number (like '1111111111...') and converting it using str2double will fail.

Instead, use modular arithmetic directly.

Solution Comments

Show comments

Problem Recent Solvers23

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 2463. Sum of Dividend Digits

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers23

Suggested Problems

More from this Author6

Problem Tags

Community Treasure Hunt

Problem 2463. Sum of Dividend Digits

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers23

Suggested Problems

More from this Author6

Problem Tags

Community Treasure Hunt

Players