Problem 42413. Divisible by 11
Pursuant to the first problem in this series, this one involves checking for divisibility by 11.
Write a function to determine if a number is divisible by 11. Like the number seven, this can be done by a variety of methods. Some are:
- Form the alternating sum of the digits (e.g., positive even digits and negative odd digits). Apply recursively until a two-digit number results. If that result is divisible by 11, then so is the original number.
- Add the digits of the number in blocks of two from right to left. Apply recursively, as needed, and check for divisibility as stated in the previous method.
- Subtract the last digit from the remaining number (e.g., 649: 64 - 9 = 55). Apply recursion, as needed.
- Add ten times the last digit to the remaining number. Apply recursion, as needed. For example: 737: 73 + 70 = 143: 14 + 30 = 44.
- Etc.
Previous problem: divisible by 10. Next problem: divisible by 12.
Solution Stats
Problem Comments
-
3 Comments
Grant, your divisible series should become a challenge by its own right.
Thanks for the vote. We'll see if the Cody team agrees. I just added a few more problems to the series today to round it out.
Nice problem - deceptively tricky.
Solution Comments
Show commentsProblem Recent Solvers165
Suggested Problems
-
2954 Solvers
-
1186 Solvers
-
Circular Primes (based on Project Euler, problem 35)
490 Solvers
-
Return fibonacci sequence do not use loop and condition
531 Solvers
-
210 Solvers
More from this Author139
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!