Problem 1804. Fangs of a vampire number

Created by Andrew Newell

Difficulty:Rate

Solve Later
Add To GroupÃ‚

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.
See also: 1825. Find all vampire fangs and 1826. Find vampire numbers.

Solve

Solution Stats

391 Solutions
98 Solvers

Last Solution submitted on Feb 23, 2025

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

Evan on 14 Aug 2013

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

Jean-Marie Sainthillier on 15 Aug 2013

Exactly what I like in Cody. Interesting and modular problem, with good explanations.
What else ?

Andrew Newell on 15 Aug 2013

Thank you, Jean-Marie! If I have time, I might extend the problem even further.

Solution Comments

Show comments

Problem Recent Solvers98

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 1804. Fangs of a vampire number

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers98

Suggested Problems

More from this Author9

Problem Tags

Community Treasure Hunt

Problem 1804. Fangs of a vampire number

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers98

Suggested Problems

More from this Author9

Problem Tags

Community Treasure Hunt

Players