Find the lowest n-digit number multiple of , written only with 6s’ and 7s’

The first few examples,

n = 1 … … 6

n = 2 … … 76

n = 3 … … 776

n = 4 … … 7776

n = 5 … … 67776

n = 6 … … 667776

………………………………………..

………………………………………….

………………………………………….

is 76-digit multiple of

Find a 67-digit multiple of

Paul found:

Using the digits **4** and **5**:

****************************************

Prove, by induction, that for every integer there exists a n-digit multiple of – (a multiple formed with digits 6 and 7 only.

Advertisements

I think this is the one

147573952589676412928 x 45250313829053138281370553831260951302463537892 =

6677767667676666776766667777767666677766776777777777777666766667776

2^67 = 147573952589676412928.

Paul.

Yes. You may want to prove, by induction, that for every integer n there exists a

n-digit multiple of 2^n – a multiple formed with digits 6 and 7 only.

Here’s a 45 and 54 digit number consisting of just the digits 4 and 5 that are multiples of 2^45 and 2^54

554445454544445545455455454544555545454444544 = 35184372088832 x 15758287604070504399244767186717 and

4545554455554445454544445545455455454544555545454444544 = 36028797018963968 x 126164480406100328173225764856620208358

P.

Nice!

Can you do it with other digits?

Yes it can be done with any pair of digits such that the difference between the two numbers is odd.

Here is my MMA code that will print all combinations out

There is quite a lot when it prints.

P.

Yeah, digits don’t cooperate when the difference is even. I’ve tried to find few examples

e.g. combos (2,8), (6,4)