A vampire number is a number v that is the product of two numbers x and y such that the following conditions are satisfied:
- at most one of x and y is divisible by 10;
- x and y have the same number of digits; and
- The digits in v consist of the digits of x and y (including any repetitions).
If these conditions are met, x and y are known as "fangs" of v. For example, 1260 is a vampire number because 1260 = 21*60, so 21 and 60 are the fangs.
Write a function that determines whether two numbers are fangs of a vampire number.
Solution Stats
Problem Comments
4 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers105
Suggested Problems
-
3403 Solvers
-
171 Solvers
-
Calculate the area of a triangle between three points
3424 Solvers
-
Calculate the Number of Sign Changes in a Row Vector (No Element Is Zero)
905 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2144 Solvers
More from this Author9
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Sorry for all the false positives. I have added more test cases.
It turns out that the difference in meaning between "not both" and "both not" is critical to this problem. Do'h! Took me a while to figure out where I was going wrong. :P
Exactly what I like in Cody. Interesting and modular problem, with good explanations.
What else ?
Thank you, Jean-Marie! If I have time, I might extend the problem even further.