Tricky Lists

The list A A is the list of all positive integers from 1 1 to 1000 1000 . We create a list B B by changing all the multiples of 3 3 from the list A A by its successors. Then we create the list C C by changing all the multiples of 7 7 from the list B B by its predecessors.

How many numbers in list A A still appears at least one time in the list C C ?


The answer is 620.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Mark Hennings
Sep 25, 2018

By the time you get to list C, have have lost multiples of 3 3 and 7 7 , but regained those multiples of 3 3 which are 1 1 less than a multiple of 7 7 . There are

  • 333 333 multiples of 3 3 ,
  • 142 142 multiples of 7 7 ,
  • 47 47 multiples of 21 21 ,

so there are 333 + 142 47 = 428 333 + 142 - 47 = 428 numbers which are multiples of either 3 3 or 7 7 . Numbers which are multiples of 3 3 and also 1 1 less than a multiple of 7 7 are of the form 6 + 21 k 6 + 21k for k 0 k \ge 0 , and so there are 48 48 such numbers. Thus a total of 428 48 = 380 428-48 = 380 numbers are removed from list A when list C is created, and so there are 620 \boxed{620} different numbers still left in list C.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...