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:
How many beautiful positive integers are there with exactly sixteen digits?
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.
We will show that every sixteen-digit number is a beautiful number. Let a 1 a 2 a 3 a 4 … a 1 5 a 1 6 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 , then we can produce the a 1 , a 1 ∗ a 2 , a 1 ∗ a 2 ∗ a 3 , … a 1 ∗ a 2 ∗ a 3 ∗ … a 1 6 numbers in a 2 v ∗ 3 x ∗ 5 y ∗ 7 z formula.
If a 1 ∗ a 2 ∗ … a n 's and a 1 ∗ a 2 ∗ … a k 's ( n > k ) v , x , y , z 's parity is pairwise equal (parity means even or odd), then a 1 ∗ a 2 ∗ … a k a 1 ∗ a 2 ∗ … a n is a square number, and it can be made by a k ∗ a k + 1 ∗ ⋯ ∗ a n .
The 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 1 6 which parities are pairwise equal.
So each sixteen-digit number is beautiful and there are 9 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ( 9 ∗ 1 0 1 6 ) sixteen-digit numbers.