domingo, 21 de julio de 2013

UNA INTERESANTE FÓRMULA GENERADORA DE 140 PRIMOS



 

Para  n >=2

DONDE:
GCD (MÁXIMO COMÚN DIVISOR), Mod (FUNCIÓN RESIDUO)
FIBONACCI (ENÉSIMO TÉRMINO DE LA SUCESIÓN DE FIBONACCI),       [] (FUNCIÓN PISO) 

{2,11,19,29,31,41,59,61,71,79,89,101,109,131,139,149,151,
179,181,191,199,211,229,239,241,251,269,271,281,311,331,
349,359,379,389,401,409,419,421,431,439,449,461,479,491,
499,509,521,541,569,571,599,601,619,631,641,659,661,691,
701,709,719,739,751,761,769,809,811,821,829,839,859,881,
911,919,929,941,971,991,1009,1019,1021,1031,1039,1049,
1051,1061,1069,1091,1109,1129,1151,1171,1181,1201,1229,
1231,1249,1259,1279,1289,1291,1301,1319,1321,1361,1381,
1399,1409,1429,1439,1451,1459,1471,1481,1489,1499,1511,
1531,1549,1559,1571,1579,1601,1609,1619,1621,1669,1699,
1709,1721,1741,1759,1789,1801,1811,1831,1861,1871,1879,1889}


AUTOR: CAMACHO MEDINA JOSÉ DE JESÚS    
 

No hay comentarios: