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

Difference between revisions of "2007 AIME I Problems/Problem 7"

m (→‎Solution)
m (→‎Solution)
 
(8 intermediate revisions by 6 users not shown)
Line 10: Line 10:
 
The change of base formula shows that <math>\frac{\log k}{\log \sqrt{2}} = \frac{2 \log k}{\log 2}</math>. For the <math>\log 2</math> term to cancel out, <math>k</math> is a [[exponent|power]] of <math>2</math>. Thus, <math>N</math> is equal to the sum of all the numbers from 1 to 1000, excluding all powers of 2 from <math>2^0 = 1</math> to <math>2^9 = 512</math>.  
 
The change of base formula shows that <math>\frac{\log k}{\log \sqrt{2}} = \frac{2 \log k}{\log 2}</math>. For the <math>\log 2</math> term to cancel out, <math>k</math> is a [[exponent|power]] of <math>2</math>. Thus, <math>N</math> is equal to the sum of all the numbers from 1 to 1000, excluding all powers of 2 from <math>2^0 = 1</math> to <math>2^9 = 512</math>.  
  
−
The formula for the sum of an [[arithmetic sequence]] and the sum of a [[geometric sequence]] yields that <math>\frac{(1000 + 1)(1000)}{2} - (1 + 2 + 2^2 + \ldots + 2^9) = 500500 - \frac{2^{10}-1}{2-1} = 499477</math>. The solution is <math>\boxed{477}</math>.
+
The formula for the sum of an [[arithmetic sequence]] and the sum of a [[geometric sequence]] yields that our answer is <math>\left[\frac{(1000 + 1)(1000)}{2} - (1 + 2 + 2^2 + \ldots + 2^9)\right] \mod{1000}</math>.
 +
 
 +
Simplifying, we get
 +
<math>\left[1000\left(\frac{1000+1}{2}\right) -1023\right] \mod{1000} \equiv [500-23] \mod{1000} \equiv 477 \mod{1000}.</math> The answer is <math>\boxed{477}</math>
  
 
== See also ==
 
== See also ==
Line 17: Line 20:
  
 
[[Category:Intermediate Algebra Problems]]
 
[[Category:Intermediate Algebra Problems]]
 +
{{MAA Notice}}

Latest revision as of 19:26, 20 April 2023

Problem

Let $N = \sum_{k = 1}^{1000} k ( \lceil \log_{\sqrt{2}} k \rceil - \lfloor \log_{\sqrt{2}} k \rfloor )$

Find the remainder when $N$ is divided by 1000. ($\lfloor{k}\rfloor$ is the greatest integer less than or equal to $k$, and $\lceil{k}\rceil$ is the least integer greater than or equal to $k$.)

Solution

The ceiling of a number minus the floor of a number is either equal to zero (if the number is an integer); otherwise, it is equal to 1. Thus, we need to find when or not $\log_{\sqrt{2}} k$ is an integer.

The change of base formula shows that $\frac{\log k}{\log \sqrt{2}} = \frac{2 \log k}{\log 2}$. For the $\log 2$ term to cancel out, $k$ is a power of $2$. Thus, $N$ is equal to the sum of all the numbers from 1 to 1000, excluding all powers of 2 from $2^0 = 1$ to $2^9 = 512$.

The formula for the sum of an arithmetic sequence and the sum of a geometric sequence yields that our answer is $\left[\frac{(1000 + 1)(1000)}{2} - (1 + 2 + 2^2 + \ldots + 2^9)\right] \mod{1000}$.

Simplifying, we get $\left[1000\left(\frac{1000+1}{2}\right) -1023\right] \mod{1000} \equiv [500-23] \mod{1000} \equiv 477 \mod{1000}.$ The answer is $\boxed{477}$

See also

2007 AIME I (Problems • Answer Key • Resources)
Preceded by
Problem 6 		Followed by
Problem 8
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15
All AIME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2007_AIME_I_Problems/Problem_7&oldid=192369"