Pseudo-cryptogram in binary #1
Two different 14 bit (binary digit) primes are multiplied together giving a product. The multiplicand, multiplier and the product (in binary) all have the same number of one bits. You want the solution such that there is only one solution with that number of one bits. What is the product in decimal? Enter product in decimal as this problem's answer. All numbers are in standard binary format with a leading one bit.
The answer is 168042529.
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
1 2 3 7 7 × 1 3 5 7 7 = 1 6 8 0 4 2 5 2 9
1 1 0 0 0 0 0 1 0 1 1 0 0 1 2 × 1 1 0 1 0 1 0 0 0 0 1 0 0 1 2 = 1 0 1 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 1 2