project_euler.problem_032.sol32
===============================

.. py:module:: project_euler.problem_032.sol32

.. autoapi-nested-parse::

   We shall say that an n-digit number is pandigital if it makes use of all the
   digits 1 to n exactly once; for example, the 5-digit number, 15234, is 1 through
   5 pandigital.

   The product 7254 is unusual, as the identity, 39 x 186 = 7254, containing
   multiplicand, multiplier, and product is 1 through 9 pandigital.

   Find the sum of all products whose multiplicand/multiplier/product identity can
   be written as a 1 through 9 pandigital.

   HINT: Some products can be obtained in more than one way so be sure to only
   include it once in your sum.



Functions
---------

.. autoapisummary::

   project_euler.problem_032.sol32.is_combination_valid
   project_euler.problem_032.sol32.solution


Module Contents
---------------

.. py:function:: is_combination_valid(combination)

   Checks if a combination (a tuple of 9 digits)
   is a valid product equation.

   >>> is_combination_valid(('3', '9', '1', '8', '6', '7', '2', '5', '4'))
   True

   >>> is_combination_valid(('1', '2', '3', '4', '5', '6', '7', '8', '9'))
   False



.. py:function:: solution()

   Finds the sum of all products whose multiplicand/multiplier/product identity
   can be written as a 1 through 9 pandigital

   >>> solution()
   45228