dhtml118:
If i try to post now, the bloo.dy moderator will block it again.

dhtml118:
Hmn, you have a point, okay, I Tony, omo ile Ajanlekoko, hereby challenge the almighty Seun thomas to a programming contest.
Oya, state the nature of the challenge and lets get going!

donsheddy1:
Build a simple algorithm that converts English to Morse code.

class Morsify:
    codedict = {'A': '.-',     'B': '-...',   'C': '-.-.', 
        'D': '-..',    'E': '.',      'F': '..-.',
        'G': '--.',    'H': '....',   'I': '..',
        'J': '.---',   'K': '-.-',    'L': '.-..',
        'M': '--',     'N': '-.',     'O': '---',
        'P': '.--.',   'Q': '--.-',   'R': '.-.',
        'S': '...',    'T': '-',      'U': '..-',
        'V': '...-',   'W': '.--',    'X': '-..-',
        'Y': '-.--',   'Z': '--..',

        '0': '-----',  '1': '.----',  '2': '..---',
        '3': '...--',  '4': '....-',  '5': '.....',
        '6': '-....',  '7': '--...',  '8': '---..',
        '9': '----.' 
        }
    reversedict = {value:key for key,value in codedict.items()}
    def __init__(self,word):
        self.word=word
    
    def translateEnglishToMorse(self):
        return ' '.join(self.codedict.get(i.upper()) for i in self.word)
        
    def translateMorseToEnglish(self,code):
        return ''.join(self.reversedict.get(i) for i in code.split())
        
if __name__=="__main__":
    word="NAIRALAND"
    transcribe  = Morsify(word)
    morsecode= transcribe.translateEnglishToMorse()
    print transcribe.translateMorseToEnglish(morsecode)

dhtml118:
that is a too generic something, it is something that you can get easily on google or wherever.

donsheddy1:
Build a simple algorithm that converts English to Morse code.

class Igbo {

public static function get_good_eggs( $all_eggs, $bad_eggs) {

$bad_eggs = array_intersect($all_eggs,$bad_eggs);
$good_eggs = array_diff($all_eggs,$bad_eggs);
foreach($bad_eggs as $key => $value) {
$good_eggs[] = $value;
}
return $good_eggs;
}

public static function all_eggs($all,$bad) {
  $response=self::get_good_eggs($all,$bad);
  var_dump($bad);
  var_dump($response);
}

}

$all_eggs=['e1', 'e2', 'e3', 'e4', 'e5', 'e6', 'e7', 'e8', 'e9', 'e10', 'e11', 'e12', 'e13', 'e14', 'e15', 'e16', 'e17', 'e18', 'e19', 'e20'];
$bad_eggs=['e3', 'e7', 'e11', 'e17', 'e19'];

Igbo::all_eggs($all_eggs,$bad_eggs);

talk2hb1:
I challenge you to building a Machine Learning Library/Solution just like Google machine that detect unusual users login

bolkay47:
Euler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of positive numbers less than or equal to n
which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6.
The number 1 is considered to be relatively prime to every positive number, so φ(1)=1.
Interestingly, φ(87109)=79180, and it can be seen that 87109 is a permutation of 79180.
Find the value of n, 1 n 107, for which φ(n) is a permutation of n and the ratio n/φ(n) produces a minimum.

dhtml118:
bearnana, you failed the test : here is the correct php answer

bolkay47:
Euler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of positive numbers less than or equal to n
which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6.
The number 1 is considered to be relatively prime to every positive number, so φ(1)=1.
Interestingly, φ(87109)=79180, and it can be seen that 87109 is a permutation of 79180.
Find the value of n, 1 n 107, for which φ(n) is a permutation of n and the ratio n/φ(n) produces a minimum.

seunthomas:

Though i have experience in ML, doing this is not a small task. For a real good system it would cost a lot of money and data. This days i use mostly deep learning because in most cases its better than other approaches to AI. If you can foot my bill, i can accept your challenge for at least 2-5 million NGN.

bearnana:


I know how to write classes in PHP, why don't you give me credit that my function works



This is interesting...

talk2hb1:

Gbese!!!!

bolkay47:
Euler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of positive numbers less than or equal to n
which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6.
The number 1 is considered to be relatively prime to every positive number, so φ(1)=1.
Interestingly, φ(87109)=79180, and it can be seen that 87109 is a permutation of 79180.
Find the value of n, 1 n 107, for which φ(n) is a permutation of n and the ratio n/φ(n) produces a minimum.

dhtml118:

Pay me 200k to attempt, and 300k more if I pass.

talk2hb1:
I challenge you to building a Machine Learning Library/Solution just like Google machine that detect unusual users login

<?php
		function generate_primes($n) {
	    	$limit = sqrt($n);
	    	$primes = array_fill(0, $n, 0);
	    	$primes[0] = $primes[1] = 1;
	    	for($i = 2; $i <= $limit; $i++) {
	    		if($primes[$i] === 0) {
	    			for($j = 2; $j < $n; $j++) {
	    				if($i*$j > $n)
	    					break;
	    				else
	    					$primes[$i*$j] = 1;
	    			}
	    		}
	    	}
	    	return sizeof($primes)-1;
	    }


?>

bolkay47:
Euler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of positive numbers less than or equal to n
which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6.
The number 1 is considered to be relatively prime to every positive number, so φ(1)=1.
Interestingly, φ(87109)=79180, and it can be seen that 87109 is a permutation of 79180.
Find the value of n, 1 n 107, for which φ(n) is a permutation of n and the ratio n/φ(n) produces a minimum.

bearnana:
With PHP

<?php
		function generate_primes($n) {
	    	$limit = sqrt($n);
	    	$primes = array_fill(0, $n, 0);
	    	$primes[0] = $primes[1] = 1;
	    	for($i = 2; $i <= $limit; $i++) {
	    		if($primes[$i] === 0) {
	    			for($j = 2; $j < $n; $j++) {
	    				if($i*$j > $n)
	    					break;
	    				else
	    					$primes[$i*$j] = 1;
	    			}
	    		}
	    	}
	    	return sizeof($primes)-1;
	    }


?>

I just noticed that this is incomplete, it only solves the Euler Totient function... I'll update later...

bolkay47:
Euler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of positive numbers less than or equal to n
which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, φ(9)=6.
The number 1 is considered to be relatively prime to every positive number, so φ(1)=1.
Interestingly, φ(87109)=79180, and it can be seen that 87109 is a permutation of 79180.
Find the value of n, 1 n 107, for which φ(n) is a permutation of n and the ratio n/φ(n) produces a minimum.

<?php
// Find the GCD between two numbers
function getGCD($num1, $num2) {
   while ($num2 != 0){
     $t = $num1 % $num2;
     $num1 = $num2;
     $num2 = $t;
   }
   return $num1;
}

function PHIfunction($n) {
	if ($n == 1) {
		return 1;
	}
	$count = 0;
	for ($i=1; $i < $n; $i++) {
		if (getGCD($i, $n) === 1) {
			$count++;
		}
	}
	return $count;
}

echo PHIfunction(9);
// returns 6

echo PHIfunction(20);
// returns 8

echo PHIfunction(87109)
// returns 79180

?>

dhtml118:
See them bad guys, I no even fit read these codes, they be like magic to me (maybe I need e-glasses as old e-age don set in).