Problem 1826. Find vampire numbers

• Created by Andrew Newell
• Appears in 3 groups

×

By solving this problem, you will make progress in the following group(s)

Magic Numbers

• 19 Problems
• 84 Finishers

Basics - Factorization

• 10 Problems
• 227 Finishers

Tough Stuff

• 19 Problems
• 7 Finishers

Like (11)

Difficulty:

(176)

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:

1. at most one of x and y are divisible by 10;
2. x and y have the same number of digits; and
3. 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

See also: Problem 1825. Find all vampire fangs and Problem 1804. Fangs of a vampire number.

Solve

Solution Stats

24.94% Correct | 75.06% Incorrect

• 1612 Solutions
• 351 Solvers

Last Solution submitted on Apr 21, 2025

Last 200 Solutions

Solution Comments

Problem Recent Solvers351

Suggested Problems

• Project Euler: Problem 4, Palindromic numbers

  1157 Solvers

• Back to basics 4 - Search Path

  372 Solvers

• Narcissistic number ?

  334 Solvers

• MATLAB Basic: rounding II

  5708 Solvers

• the average value of the elements

  1850 Solvers

More from this Author9

• Negation the hard way

  68 Solvers

• Multivariate polynomials - emulate symbolic form

  7 Solvers

• Multivariate polynomials - sort monomials

  9 Solvers

• Product of two multivariate polynomials

  18 Solvers

• Multivariate polynomials - overload multiplication

  10 Solvers