Does every finite graph with minimum degree at least 3 contain a cycle of length $2^k$ for some $k\geq 2$?