IMO 1962 Problem 01

gistfile1.as

public function solve():void {
  txtResult.text = "";
  var k:int = 1;
  var k_up:int = 10;    // Minimum (10^p) greater that k.
  while (true) {
    var n:int = (10 * k) + 6;
    var m:int = (6 * k_up) + k;
    // Check
    if (m == 4 * n) {
      txtResult.text += "ANSWER: " + n;
      break;
    }
    ++k;
    if (k >= k_up) {
      k_up *= 10;
    }
  }
}