20151125, 15:07  #12 
"Ram Shanker"
May 2015
Delhi
38_{10} Posts 
What is that gp> console you guys using?

20151125, 15:12  #13 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 

20151125, 19:22  #14 
1100111001000_{2} Posts 
(20:15) gp > 304795270400000*3*4*5*6*3*2*4*5*7*8
%37 = 737360718151680000000 (20:16) gp > isprime(%1) %38 = 1 (20:17) gp > thank you for the program PARI. Now i can test , this is number 8 but ..... Last fiddled with by Ale on 20151125 at 19:26 
20151125, 19:46  #15 
2·11·107 Posts 
(20:40) gp > 304795270400000*3*4*5*6*3*2*4*5*7*8*3*5*7*8*3*7*8*9
%67 = 936507100910085734400000000 (20:41) gp > isprime(%1) %68 = 1 (20:42) gp > and this is the number 9 , but is different , is more complex , thinking 
20151125, 19:56  #16 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}×131 Posts 

20151125, 20:01  #17 
3^{2}×11×23 Posts 
chain of numbers, but I think it is impossible now

20151125, 20:04  #18 
"Forget I exist"
Jul 2009
Dumbassville
10000011000000_{2} Posts 
okay how is this chain produced ? and how can you guarantee it's prime ? edit: could the strong law of small numbers be playing a role ?
Last fiddled with by science_man_88 on 20151125 at 20:04 
20151125, 20:23  #19 
2^{3}×7×157 Posts 
the number * 3 *, is always after a series chain of numbers, example 2 * 4 * 5, but at 8 is not yet chain of numbers, see 2 * 4 * 5 * 7 * 8, there isn't 6.
I thought, example 2 * 4 * 5 repeated three times, 2 * 4 repeated two times , an so up . 
20151125, 20:42  #20  
"Forget I exist"
Jul 2009
Dumbassville
8384_{10} Posts 
Quote:
Va bene, quindi quali sono le specifiche dell'algoritmo, e qual è il vostro livello di conoscenza di: 1) Sieve techniques/tecniche di Sieve 2) remainder math/resto matematica 3) Prime numbers/numeri primi 4) Factorials/fattoriali 5) Programming/Programmazione Last fiddled with by science_man_88 on 20151125 at 20:43 

20151125, 20:57  #21 
2^{4}×353 Posts 
only hobby

20151125, 21:15  #22 
"Forget I exist"
Jul 2009
Dumbassville
2^{6}·131 Posts 
Okay well without specifics, it's pretty difficult to give a program equivalent to what needs to be done. do you know the fact that all primes greater than 3 must have a remainder of 1 or 5 when divided by 6 ? are you aware of how/why the sieve of Eratosthenes works ? are you aware of other ways to find prime numbers ?
Va bene anche senza specifiche, è piuttosto difficile dare un programma equivalente a quello che deve essere fatto. sapete il fatto che tutti i numeri primi superiore a 3 deve avere un resto di 1 o 5 quando diviso per 6? siete consapevoli di come / perché il crivello di Eratostene funziona? siete a conoscenza di altri modi per trovare i numeri primi? 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Endorsement Prime Numbers finding algorithm  marouane  Computer Science & Computational Number Theory  18  20171106 15:41 
A simple idea for factoring numbers  ThiloHarich  Factoring  15  20170306 11:23 
Formublablabla to calculate the sum of two Prime numbers just by knowing the product  Godzilla  Miscellaneous Math  107  20161206 17:48 
Getting a new Prime to calculate  roemer2201  PrimeNet  2  20081220 16:12 
Fastest possible algorithm to calculate the square root of a 10,000,000 digit number  Fusion_power  Math  19  20071102 21:37 