Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

2001 APMO Problems/Problem 2

Revision as of 17:02, 26 December 2022 by Aopsonline2020888 (talk | contribs) (→‎Problem)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Find the largest positive integer $N$ so that the number of integers in the set $\{1,2,\dots,N\}$ which are divisible by 3 is equal to the number of integers which are divisible by 5 or 7 (or both).

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2001_APMO_Problems/Problem_2&oldid=184946"