Problem 42411. Divisible by 9

• Created by goc3
• Appears in 2 groups

×

By solving this problem, you will make progress in the following group(s)

Linear Algebra

• 15 Problems
• 54 Finishers

Some simple basic problems

• 10 Problems
• 87 Finishers

Like (2)

Difficulty:

(133)

Rate

• Solve Later   
• Add To GroupÂ

Pursuant to the first problem in this series, this one involves checking for divisibility by 9.

Write a function to determine if a number is divisible by 9. This can be done by the following method:

1. Sum the digits of the number. As with methods for other numbers, this summing step can be applied recursively until a single-digit number results. If the resulting number is divisible by nine, then so is the original number.

Previous problem: divisible by 8. Next problem: divisible by 10.

Solve

Solution Stats

61.86% Correct | 38.14% Incorrect

• 472 Solutions
• 264 Solvers

Last Solution submitted on Apr 06, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers264

Suggested Problems

• Return the largest number that is adjacent to a zero

  5427 Solvers

• Summing digits

  7756 Solvers

• Max index of 3D array

  383 Solvers

• Find the next prime number

  701 Solvers

• Return fibonacci sequence do not use loop and condition

  697 Solvers

More from this Author139

• Combined Ages 3 - Non-symmetric, n ≥ 3

  90 Solvers

• Scrabble Scores - 9

  25 Solvers

• Scrabble Scores - 7

  26 Solvers

• Scrabble Scores - 11

  21 Solvers

• Lights Out 10 - 5x5, with wrapping, 6 moves

  12 Solvers