Sixes and sevens

How many (Base 10) 67-digit multiples of \(2^{67}\) exist which can be written exclusively with the digits 6 and 7 ?

SOLUTION HAS BEEN ADDED AS A COMMENT

As an additional exercise, try the following:

Show that every number which is not divisible by 5 has a multiple whose only digits are 6 and 7.

Note by Bruce Wayne
4 years, 5 months ago

No vote yet
6 votes

  Easy Math Editor

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 \( 2 \times 3 \)
2^{34} \( 2^{34} \)
a_{i-1} \( a_{i-1} \)
\frac{2}{3} \( \frac{2}{3} \)
\sqrt{2} \( \sqrt{2} \)
\sum_{i=1}^3 \( \sum_{i=1}^3 \)
\sin \theta \( \sin \theta \)
\boxed{123} \( \boxed{123} \)

Comments

Sort by:

Top Newest

FOLLOWING IS THE SOLUTION. DON'T READ THIS COMMENT IF YOU HAVEN'T TRIED THE PROBLEM ON YOUR OWN

There are exactly \(2^{67}\) 67-digit numbers containing only the digits 6 and 7. The difference of any two of these is not divisible by \(2^{67}\) since it is expressible as the sum or difference of powers of 10.

Hence, these \(2^{67}\) numbers have pairwise different remainders on division by \(2^{67}\), and since there are \(2^{67}\) such remainders (from \(0\) to \(2^{67}-1\))there must be (exactly one) which has remainder 0 and hence is divisible by \(2^{67}\).

Bruce Wayne - 4 years, 5 months ago

Log in to reply

I don't think the fact that the difference being expressible as the sum or difference of powers of \(10\) trivially concludes that it's not divisible by \(2^{67}\), although I've seen a similar problem before which elaborates further (somewhere along "\(\displaystyle\sum_{i=0}^{k-1} a_i10^i\) where \(a_i \in \{-1,0,1\}\) is not divisible by \(2^k\) except when it's equal to \(0\)").

Ivan Koswara - 4 years, 5 months ago

Log in to reply

Comment deleted Dec 11, 2013

Log in to reply

Please avoid adding answers which do not increase the knowledge of the community. This is an actual question that I came across. I was amazed on seeing the simple elegant solution to this problem and thus wanted to share it with everyone. If you have a solution, please share it.

Bruce Wayne - 4 years, 5 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...