2005 AMC 8 Problem 18

Attempt Problem 18 of the 2005 AMC 8 below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2005 AMC 8 solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

18.

How many three-digit numbers are divisible by 13?13?
77
6767
6969
7676
7777
Answer: C
Concepts:counting integers in a rangemultiple
Small hint:
A three-digit multiple of 1313 has form 13k13k.
Big hint:
Find the smallest and largest possible values of kk.
Solution:
We want to find how many kk exist such that 13k13k is a three-digit number.
The smallest possible kk such that 13k>9913k \gt 99 is k=8.k = 8.
The largest possible kk such that 13k<100013k \lt 1000 is k=76.k = 76.
This tells us that kk can range from 88 to 76,76, which gives us 6969 values for k.k.
Thus, C is the correct answer.
LIVE by Po-Shen Loh
Programs

LIVE Classes

Self-Paced Classes

Stars

Scholarship

About Us

Who Is Po-Shen Loh?

Email Contact

Newsletter

Jobs

Become a Star

For a more Thought Full world.

© 2026 Expii, Inc.