Skip to main content

PHP function for checking IMEI

Image
By 

Luhn algorithm for IMEI Check



public function __checkIMEI($imei){
   if(strlen($imei)==15){
             $imeia=($imei[1]*2);
         if(strlen($imeia)==2){$imeia=str_split($imeia,1);  $imeia=$imeia[0]+$imeia[1]; }
            $imeib=($imei[3]*2);
            if(strlen($imeib)==2){$imeib=str_split($imeib,1); $imeib=$imeib[0]+$imeib[1]; }
            $imeic=($imei[5]*2);
            if(strlen($imeic)==2){$imeic=str_split($imeic,1); $imeic=$imeic[0]+$imeic[1]; }
            $imeid=($imei[7]*2);
            if(strlen($imeid)==2){$imeid=str_split($imeid,1); $imeid=$imeid[0]+$imeid[1];}
            $imeie=($imei[9]*2);
            if(strlen($imeie)==2){$imeie=str_split($imeie,1); $imeie=$imeie[0]+$imeie[1]; }
            $imeif=($imei[11]*2);
            if(strlen($imeif)==2){$imeif=str_split($imeif,1); $imeif=$imeif[0]+$imeif[1]; }
            $imeig=($imei[13]*2);
            if(strlen($imeig)==2){$imeig=str_split($imeig,1); $imeig=$imeig[0]+$imeig[1]; }
     $IMEI=
            ($imei[0]+$imeia+$imei[2]+$imeib+$imei[4]+$imeic+$imei[6]+$imeid+$imei[8]
             +$imeie+$imei[10]+$imeif+$imei[12]+$imeig);
            $IMEI=($IMEI%10);
                if($IMEI!=0){
                   $IMEI=10-$IMEI;
            }
            if($IMEI!=0){
                $IMEI=10-$IMEI;
            }
            if($IMEI==$imei[14]){
                return true;
            }else{
                return true;
            }
        }else{
            return false;
        }
Labels:

Comments

Post a Comment

Popular posts from this blog

PHP code for Implementing LRU cache.

By
<?php interface LRUCache{ /** •@param string $key •@param string $value •@return bool $result • •Stores value against the key in the cache */ public function insertIntoCache($key,$value); /** •@param string $key •@return string $value •Gets the value of a key from the cache */ public function getFromCache($key); /** Purge the entire cache */ public function purgeCache(); /** •@return int $count •Gets the number of successful cache hits so far */ public function allCacheHits(); /** •@return int $count •Gets the number of unsuccessful cache hits so far **/ public function allCacheMissed(); } class Cache implements LRUCache{ // int the max number of elements the cache supports private $capaci...
Post a Comment
Read more

PHP code for finding Longest Repeated Substrings (LRS)

By
<?php Class LRS{ /** •@param array $texts •Prints longest repeated substrings for each text */ public static function getAllLRS($texts){ $stringArr = array(); foreach($texts as $string){ $stringArr[] = self::LongestRepeatedSubstring($string); } return $stringArr; } public function LongestRepeatedSubstring($string){ if ($string == null) return null; $string_length = strlen($string); $substrings = array(); for ($i=0; $i < $string_length; $i++){ $substrings[$i] = substr($string, $i); } sort($substrings); $result = ""; for ($i = 0; $i < $string_length - 1; $i++){ $lcs = self::LongestCommonString($substrings[$i], $substrings[$i ...
Post a Comment
Read more