diff --git a/euler25.php b/euler25.php
index c2c5882..40f7dc9 100644
--- a/euler25.php
+++ b/euler25.php
@@ -1,25 +1,20 @@
 <?php
 /*
-* Gnieark's anwser to euler problem 26
-* https://projecteuler.net/problem=26
+* Gnieark's anwser to euler problem 25
+* https://projecteuler.net/problem=25
 */
-$beastDenominateur=0;
-$longestCycle=0;
-for ($denominateur=2; $denominateur < 1000; $denominateur ++){
-  
-  $reste=1;
-  $restes=array();
-  $count=0;
-  while (!in_array($reste,$restes)){
-    $restes[]=$reste;
-    $reste=$reste*10;
-    $reste=fmod($reste,$denominateur);
+//see  https://fr.wikipedia.org/wiki/Suite_de_Fibonacci#Avec_la_formule_de_Binet
+echo intval((log(10)*999 + (log(5)/2) ) / log(1.61803398875)) +1;
+/*
+Very long solution that didn't test :
+$i=1;
+$j=2;
+$count=2;
+while(strlen($i)<1000){
+    $new=gmp_add($i,$j);
+    $i=$j;
+    $j=$new;
     $count++;
-  }  
-  if($count > $longestCycle){
-    $longestCycle=$count;
-    $beastDenominateur=$denominateur;
-  }
 }
-
-echo $beastDenominateur."\n";
\ No newline at end of file
+echo $count;
+*/
\ No newline at end of file
diff --git a/euler26.php b/euler26.php
new file mode 100644
index 0000000..c2c5882
--- /dev/null
+++ b/euler26.php
@@ -0,0 +1,25 @@
+<?php
+/*
+* Gnieark's anwser to euler problem 26
+* https://projecteuler.net/problem=26
+*/
+$beastDenominateur=0;
+$longestCycle=0;
+for ($denominateur=2; $denominateur < 1000; $denominateur ++){
+  
+  $reste=1;
+  $restes=array();
+  $count=0;
+  while (!in_array($reste,$restes)){
+    $restes[]=$reste;
+    $reste=$reste*10;
+    $reste=fmod($reste,$denominateur);
+    $count++;
+  }  
+  if($count > $longestCycle){
+    $longestCycle=$count;
+    $beastDenominateur=$denominateur;
+  }
+}
+
+echo $beastDenominateur."\n";
\ No newline at end of file