TC Kimlik No Algoritması

function tcknGecerliMi(no) {
  if (!/^[1-9]\d{10}$/.test(String(no))) return false;
  const d = [...no].map(Number);
  const tek = d[0] + d[2] + d[4] + d[6] + d[8];
  const cift = d[1] + d[3] + d[5] + d[7];
  const toplam = d.slice(0, 10).reduce((a, b) => a + b, 0);
  return d[9] === (tek * 7 + cift * 9) % 10 && d[10] === toplam % 10;
}

export function tcknGecerliMi(no: string): boolean {
  if (!/^[1-9]\d{10}$/.test(no)) return false;
  const d: number[] = [...no].map(Number);
  const tek = d[0] + d[2] + d[4] + d[6] + d[8];
  const cift = d[1] + d[3] + d[5] + d[7];
  const toplam = d.slice(0, 10).reduce((a, b) => a + b, 0);
  return d[9] === (tek * 7 + cift * 9) % 10 && d[10] === toplam % 10;
}

def tckn_gecerli_mi(no: str) -> bool:
    if len(no) != 11 or not (no.isascii() and no.isdigit()) or no[0] == "0":
        return False
    d = [int(c) for c in no]
    tek = d[0] + d[2] + d[4] + d[6] + d[8]
    cift = d[1] + d[3] + d[5] + d[7]
    return d[9] == (tek * 7 + cift * 9) % 10 and d[10] == sum(d[:10]) % 10

function tcknGecerliMi(string $no): bool
{
    if (!preg_match('/^[1-9][0-9]{10}$/', $no)) return false;
    $d = array_map('intval', str_split($no));
    $tek = $d[0] + $d[2] + $d[4] + $d[6] + $d[8];
    $cift = $d[1] + $d[3] + $d[5] + $d[7];
    $toplam = array_sum(array_slice($d, 0, 10));
    return $d[9] === ($tek * 7 + $cift * 9) % 10 && $d[10] === $toplam % 10;
}

public static class Tckn
{
    public static bool GecerliMi(string no)
    {
        if (no == null || no.Length != 11 || no[0] == '0') return false;
        int[] d = new int[11];
        for (int i = 0; i < 11; i++)
        {
            if (no[i] < '0' || no[i] > '9') return false;
            d[i] = no[i] - '0';
        }
        int tek = d[0] + d[2] + d[4] + d[6] + d[8];
        int cift = d[1] + d[3] + d[5] + d[7];
        int toplam = 0;
        for (int i = 0; i < 10; i++) toplam += d[i];
        return d[9] == (tek * 7 + cift * 9) % 10 && d[10] == toplam % 10;
    }
}

public final class Tckn {
    public static boolean gecerliMi(String no) {
        if (no == null || no.length() != 11 || no.charAt(0) == '0') return false;
        int[] d = new int[11];
        for (int i = 0; i < 11; i++) {
            char ch = no.charAt(i);
            if (ch < '0' || ch > '9') return false;
            d[i] = ch - '0';
        }
        int tek = d[0] + d[2] + d[4] + d[6] + d[8];
        int cift = d[1] + d[3] + d[5] + d[7];
        int toplam = 0;
        for (int i = 0; i < 10; i++) toplam += d[i];
        return d[9] == (tek * 7 + cift * 9) % 10 && d[10] == toplam % 10;
    }
}

package tckn

func GecerliMi(no string) bool {
	if len(no) != 11 || no[0] == '0' {
		return false
	}
	var d [11]int
	for i := 0; i < 11; i++ {
		if no[i] < '0' || no[i] > '9' {
			return false
		}
		d[i] = int(no[i] - '0')
	}
	tek := d[0] + d[2] + d[4] + d[6] + d[8]
	cift := d[1] + d[3] + d[5] + d[7]
	toplam := 0
	for i := 0; i < 10; i++ {
		toplam += d[i]
	}
	return d[9] == (tek*7+cift*9)%10 && d[10] == toplam%10
}

-- MySQL / MariaDB
DELIMITER //
CREATE FUNCTION tckn_gecerli_mi(p_no VARCHAR(20)) RETURNS BOOLEAN DETERMINISTIC
BEGIN
  DECLARE tek INT;
  DECLARE cift INT;
  DECLARE toplam INT DEFAULT 0;
  DECLARE i INT DEFAULT 1;
  IF p_no IS NULL OR p_no NOT REGEXP '^[1-9][0-9]{10}$' THEN RETURN FALSE; END IF;
  SET tek = SUBSTRING(p_no, 1, 1) + SUBSTRING(p_no, 3, 1) + SUBSTRING(p_no, 5, 1) + SUBSTRING(p_no, 7, 1) + SUBSTRING(p_no, 9, 1);
  SET cift = SUBSTRING(p_no, 2, 1) + SUBSTRING(p_no, 4, 1) + SUBSTRING(p_no, 6, 1) + SUBSTRING(p_no, 8, 1);
  WHILE i <= 10 DO
    SET toplam = toplam + SUBSTRING(p_no, i, 1);
    SET i = i + 1;
  END WHILE;
  RETURN MOD(tek * 7 + cift * 9, 10) = SUBSTRING(p_no, 10, 1) AND MOD(toplam, 10) = SUBSTRING(p_no, 11, 1);
END //
DELIMITER ;