Problem 1826. Find vampire numbers
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 are 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 anyrepetitions).
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 returns all the vampire numbers in a given array. The output is a vector.
Example: disp(find_vampire(1000:2000) 1260 1395 1435 1530 1827
Solution Stats
Problem Comments
-
3 Comments
Rafael S.T. Vieira
on 16 Jul 2020
Are you sure about the first rule? It doesn't seem necessary according to https://oeis.org/A014575.
Adib
on 27 Jul 2020
The problem is really fun.
邵俊淞2353280
on 31 Jul 2024
fun
Solution Comments
Show commentsProblem Recent Solvers310
Suggested Problems
-
Find the longest sequence of 1's in a binary sequence.
6233 Solvers
-
1596 Solvers
-
8989 Solvers
-
276 Solvers
-
958 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!