are you thinking of modulo??

$let\quad number\quad =\quad .....7\\ ....7\quad *\quad 5\quad =\quad 7......\\ this\quad is\quad what\quad the\quad question\quad says\\ now\quad notice\quad when\quad we\quad multiply\\ 7\quad with\quad 5\quad unit\quad digit\quad of\quad new\quad no\\ would\quad be\quad 5\quad and\quad hence\quad it\quad would\quad \\ be\quad the\quad 2nd\quad last\quad digit\quad of\quad original\quad \\ number.\quad number\quad =\quad ......57\\ now\quad supposing\quad number\quad to\quad be\quad of\quad \\ different\quad digits.\\ case\quad 1\\ a\quad 3\quad digit\quad number\quad \\ a57\quad *\quad 5\quad =\quad 7a5\\ in\quad expanded\quad form\quad we\quad find\quad the\\ above\quad equation\quad but\quad get\quad a\quad decimal\quad \\ value\quad of\quad a.\quad which\quad is\quad not\quad possible\\ we\quad continue\quad the\quad same\quad process\quad for\quad a\quad 6\\ digit\quad number\quad as\quad before\quad it\quad in\quad all\\ case\quad you\quad will\quad get\quad decimal\quad value\quad of\quad ab\quad or\quad abc\\ case\quad 2\\ a\quad 6\quad digit\quad number\quad \\ abcd57\quad *\quad 5\quad =\quad 7abcd5\\ (100000a\quad +\quad 10000b\quad +\quad 1000c\quad +\quad 100d\quad +\quad 57)5\quad =\quad \\ 5(140000\quad +\quad 2000oa\quad +\quad 2000b\quad +\quad 200c\quad +\quad 2d\quad +\quad 1)\\ solving\quad we\quad get\\ 98(1000a\quad +\quad 100b\quad +\quad 10c\quad +\quad d)\quad =\quad 139944\\ abcd\quad =\quad 1428\quad \\ note\quad :\quad abcd\quad represents\quad 1000a\quad +\quad 100b\quad +\quad 10c\quad +\quad d\\ therefore\quad least\quad such\quad number\\ =\quad abcd57\quad =\quad 142857$ .

Brute force, in Python:

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15

N = 17

count = 0

while True :

    N += 10

    strN = str ( N )

    derived = int ( '%s%s' % ( strN [ -1 ], strN [ : -1 ]) )

    if 5 * N == derived :

        print N, derived