Let a and b be single-digit numbers and that a < b .
Find the product of the integer solutions. How many digits does the product have?
Try Part 1
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.
Just an observation: if a 2 b 2 has four digits then a 2 b 2 ≥ 1 0 0 0 so a b > 3 1 . If a b > 3 1 then each of a and b is at least 4 , so a b 2 > 1 0 0 . Also a b < 1 0 0 , a b 2 < 1 0 0 0 and a 2 b 2 < 1 0 0 0 0 so we never have too many digits.
This means that all we have to solve is a b > 3 1 and a < b , leading straight to the list you've given.
Rather than work out the full product, it's also a bit easier to get the number of digits taking logarithms base 1 0 ; these just need to be added to get the answer.
Brute force and direct:
Length [ IntegerDigits [ Times @@ Flatten [ Table [ If [ 1 0 ≤ a b ≤ 9 9 ∧ 1 0 0 ≤ a b 2 ≤ 9 9 9 ∧ 1 0 0 0 ≤ a 2 b 2 ≤ 9 9 9 9 , a b , Nothing ] , { b , 9 } , { a , 0 , b − 1 } ] ] ] ] ⇒ 1 9
Problem Loading...
Note Loading...
Set Loading...
The integer solutions are:
Getting all the integer solutions, we get 4 2 × 5 3 × 6 3 × 7 4 × 8 5 × 9 5 to find the product. The product is 2 0 0 6 9 5 8 4 8 5 2 7 4 6 2 4 0 0 0 which has 1 9 digits.