How many positive 3-digit numbers are divisible by 9 and end with the digit 3?

["How Many Positive 3-Digit Numbers Are Divisible by 9 and End in the Digit 3?", "When exploring the range of three-digit numbers with specific divisibility and ending properties, one intriguing question emerges: How many positive 3-digit numbers are divisible by 9 and end with the digit 3?", "Let’s break this down clearly and methodically.", "---", "### Understanding the Problem", "We are looking for 3-digit numbers (i.e., numbers from 100 to 999) that meet two conditions:", "1. The number is divisible by 9.\n2. The number ends in the digit 3.", "---", "### Step 1: Formulating the Number Structure", "Any 3-digit number ending in 3 can be expressed in the form:", "[\nN = 100a + 10b + 3\n]", "where:\n- ( a ) ranges from 1 to 9 (since the number must be at least 100),\n- ( b ) ranges from 0 to 9 (tens digit).", "Since the number must end in 3, the last digit is fixed.", "---", "### Step 2: Applying Divisibility by 9", "A number is divisible by 9 if the sum of its digits is divisible by 9.", "For ( N = 100a + 10b + 3 ), the digits are:\n- Hundreds digit: ( a )\n- Tens digit: ( b )\n- Units digit: ( 3 )", "So, the digit sum is:\n[\na + b + 3\n]", "We want:\n[\na + b + 3 \equiv 0 \pmod{9}\n]", "Or:\n[\na + b \equiv 6 \pmod{9}\n]", "---", "### Step 3: Find All Valid (a, b) Pairs with ( a \in [1,9], b \in [0,9] )", "We need all pairs ( (a, b) ) such that ( a + b = 6 ) or ( a + b = 15 ), because:", "- The smallest possible ( a + b ) is ( 1 + 0 = 1 )\n- The largest possible is ( 9 + 9 = 18 )", "But since ( a + b \equiv 6 \pmod{9} ), possible values are:\n- 6, 15\nBecause 6 and 15 are the only numbers between 1 and 18 satisfying ( x \equiv 6 \pmod{9} )", "Now, find all valid pairs:", "#### Case 1: ( a + b = 6 )", "( a ) ranges from 1 to 6 (since ( a \geq 1 )), and for each ( a ), ( b = 6 - a ), which is between 0 and 5.", "Valid pairs:\n- (1,5), (2,4), (3,3), (4,2), (5,1), (6,0)\nTotal: 6 pairs", "#### Case 2: ( a + b = 15 )", "( a ) ranges from 6 to 9 (since ( b = 15 - a \geq 0 ), so ( a \leq 15 ), but ( a \leq 9 ))", "- ( a = 6 \Rightarrow b = 9 )\n- ( a = 7 \Rightarrow b = 8 )\n- ( a = 8 \Rightarrow b = 7 )\n- ( a = 9 \Rightarrow b = 6 )\nTotal: 4 pairs", "---", "### Step 4: Total Valid Numbers", "Each valid (a, b) pair corresponds to exactly one 3-digit number ending in 3 and divisible by 9.", "So total = 6 (from sum = 6) + 4 (from sum = 15) = 10", "---", "### Examples of Such Numbers", "To confirm, here are the numbers:", "From ( a + b = 6 ):\n653, 743, 833, 923, 113, 203 → Wait — wait! Check:\n- a=1, b=5 → 153\n- a=2, b=4 → 243\n- a=3, b=3 → 333\n- a=4, b=2 → 423\n- a=5, b=1 → 513\n- a=6, b=0 → 603", "From ( a + b = 15 ):\n165 (a=1, b=5), but wait: 1+5=6 → already counted in sum=6", "Wait — no, sum must be 6 or 15. Let's properly generate and verify:", "Numbers ending in 3:\n153 (1+5+3=9 → divisible by 9) ✅\n243 (2+4+3=9 ✅)\n333 (3+3+3=9 ✅)\n423 (4+2+3=9 ✅)\n513 (5+1+3=9 ✅)\n603 (6+0+3=9 ✅)\n165 → 1+6+5=12 ❌ not divisible by 9\n255 → ends in 5 ❌\n...", "Wait — double-check:\nLet’s list all 3-digit numbers ending in 3 with digits summing to 9 (since sum = 9 or 18? Wait — digit sum divisible by 9 → possible 9 or 18 since min sum is 1+0+3=4, max 9+9+3=21 → possible 9 or 18.", "But earlier logic used ( a + b + 3 \equiv 0 \pmod{9} \Rightarrow a + b \equiv 6 \pmod{9} ), so 6 or 15 — but 9 is also possible!", "Wait — this reveals a mistake.", "Because:\nDigit sum = ( a + b + 3 \equiv 0 \pmod{9} )\nSo ( a + b + 3 = 9 ) or ( 18 ) (since min sum is 1+0+3=4 → next multiple is 9, then 18)", "So:\n- ( a + b + 3 = 9 \Rightarrow a + b = 6 )\n- ( a + b + 3 = 18 \Rightarrow a + b = 15 )", "So only 6 and 15 — 9 is not possible because that would require digit sum 12, which is not divisible by 9.", "Thus, only two cases: ( a + b = 6 ) or ( a + b = 15 )", "Now list all numbers:", "For ( a + b = 6 ):\na=1 → b=5 → 153\na=2 → b=4 → 243\na=3 → b=3 → 333\na=4 → b=2 → 423\na=5 → b=1 → 513\na=6 → b=0 → 603\nTotal: 6 numbers", "For ( a + b = 15 ):\na=6 → b=9 → 693\na=7 → b=8 → 783\na=8 → b=7 → 873\na=9 → b=6 → 963\nTotal: 4 numbers", "So total valid numbers: ( 6 + 4 = 10 )", "---", "### Conclusion", "There are exactly 10 positive 3-digit numbers that are divisible by 9 and end with the digit 3.", "This number arises from digit combinations where the sum of digits is a multiple of 9 (specifically 9 or 18), given the fixed last digit 3 and 3-digit boundary.", "---", "### Key Takeaways", "- Numbers ending in 3: constraint on last digit.\n- Divisibility by 9 requires digit sum divisible by 9.\n- With units digit fixed at 3, only sums 9 and 18 are possible for digit sum.\n- Enumerating valid a, b pairs gives a clear count.", "---", "Keywords:\n3-digit numbers divisible by 9, numbers ending in 3, how many three-digit numbers divisible by 9 ending with 3, divisibility by 9 rule, 3-digit number analysis, positive integers divisible by 9, digit sum divisible by 9.", "Meta Description:\nDiscover the exact count of 3-digit numbers divisible by 9 and ending in 3. We analyze digit sums, validate conditions, and confirm a total of 10 such numbers.", "---", "See related articles:\n- All 3-digit numbers divisible by 9\n- Count of integers between 100 and 999 ending in 5\n- Divisibility by 9 rules explained simply"]