A number with sixteen digits

If a number has some adjacent digits (it can also be only one digit) the product of which is a square number, then it's a beautiful number.

For example:

  • 12 is a beautiful number, because 1 is a square number.
  • 23 is a not a beautiful number, because neither 2, 3, nor 2 × \times 3 is a square number.
  • 233 is a beautiful number, because 3 × \times 3 is a square number.
  • 323 is not a beautiful number, because neither 2, 3, 2 × \times 3, nor 3 × \times 2 × \times 3 is a square number.

How many beautiful positive integers are there with exactly sixteen digits?


The answer is 9000000000000000.

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

We will show that every sixteen-digit number is a beautiful number. Let a 1 a 2 a 3 a 4 a 15 a 16 a_1a_2a_3a_4\dots a_{15}a_{16} be a sixteen-digit number. If it has a digit which is a square number, then it is a beautiful number. If it has only digits from 2 , 3 , 5 , 6 , 7 , 8 {2, 3, 5, 6, 7, 8} , then we can produce the a 1 , a 1 a 2 , a 1 a 2 a 3 , a 1 a 2 a 3 a 16 a_1, a_1*a_2, a_1*a_2*a_3, \dots a_1*a_2*a_3*\dots a_{16} numbers in a 2 v 3 x 5 y 7 z 2^v*3^x*5^y*7^z formula.

If a 1 a 2 a n a_1*a_2*\dots a_n 's and a 1 a 2 a k a_1*a_2*\dots a_k 's ( n > k ) (n>k) v , x , y , z v, x, y, z 's parity is pairwise equal (parity means even or odd), then a 1 a 2 a n a 1 a 2 a k \frac{a_1*a_2*\dots a_n}{a_1*a_2*\dots a_k} is a square number, and it can be made by a k a k + 1 a n a_k*a_{k+1}*\dots*a_n .

The v x y z v-x-y-z 's parity has sixteen options: (E:even, O:odd)

EEEE, EEEO, EEOE, EOEE, OEEE, EEOO, EOEO, OEEO, EOOE, OEOE, OOEE, EOOO, OEOO, OOEO, OOOE, OOOO.

But EEEE is not possible because it is a square number. So there has to be two of the a 1 , a 1 a 2 , a 1 a 2 a 3 , a 1 a 2 a 3 a 16 a_1, a_1*a_2, a_1*a_2*a_3, \dots a_1*a_2*a_3*\dots a_{16} which parities are pairwise equal.

So each sixteen-digit number is beautiful and there are 9000000000000000 9000000000000000 ( 9 1 0 16 ) (9*10^{16}) sixteen-digit numbers.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...