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

2025 SSMO Relay Round 4 Problems/Problem 1

Revision as of 11:44, 9 September 2025 by Pinkpig (talk | contribs) (Created page with "==Problem== Call a positive integer <i>chuzzed</i> if the sum of the digits in its binary representation is equal to the units digit of its base-<math>10</math> representatio...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Call a positive integer chuzzed if the sum of the digits in its binary representation is equal to the units digit of its base-$10$ representation. Similarly, call a positive integer chopped if its binary representation does not contain two consecutive ones. Find the number of positive integers less than $128$ that are chuzzed and chopped.

Solution

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2025_SSMO_Relay_Round_4_Problems/Problem_1&oldid=260096"