Erdős triangle-tiling problem

Determine for which positive integers N there exist a triangle T and a triangle R such that T can be tiled by N congruent copies of R.

Background

The paper identifies a higher-resolution version of an Erdős problem as its broad motivating question. Unlike the paper’s more specialized results, the general existence problem ranges over both the tiled triangle and the triangular tile and is presented as unresolved.