mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2015-11-25, 15:07   #12
ramshanker
 
ramshanker's Avatar
 
"Ram Shanker"
May 2015
Delhi

468 Posts
Default

What is that gp> console you guys using?
ramshanker is offline   Reply With Quote
Old 2015-11-25, 15:12   #13
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

838410 Posts
Default

Quote:
Originally Posted by ramshanker View Post
What is that gp> console you guys using?
http://pari.math.u-bordeaux.fr/
science_man_88 is offline   Reply With Quote
Old 2015-11-25, 19:22   #14
Ale
 
Nov 2015

52 Posts
Default

(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 2015-11-25 at 19:26
Ale is offline   Reply With Quote
Old 2015-11-25, 19:46   #15
Ale
 
Nov 2015

52 Posts
Default

(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
Ale is offline   Reply With Quote
Old 2015-11-25, 19:56   #16
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

100000110000002 Posts
Default

Quote:
Originally Posted by Ale View Post
(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
still wondering what the "mechanism" is .
science_man_88 is offline   Reply With Quote
Old 2015-11-25, 20:01   #17
Ale
 
Nov 2015

52 Posts
Default

chain of numbers, but I think it is impossible now
Ale is offline   Reply With Quote
Old 2015-11-25, 20:04   #18
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

Quote:
Originally Posted by Ale View Post
chain of numbers, but I think it is impossible now
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 2015-11-25 at 20:04
science_man_88 is offline   Reply With Quote
Old 2015-11-25, 20:23   #19
Ale
 
Nov 2015

1916 Posts
Default

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 .
Ale is offline   Reply With Quote
Old 2015-11-25, 20:42   #20
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

Quote:
Originally Posted by Ale View Post
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 .
okay, so what are the specifics of the algorithm, and what is your level of knowledge of:
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 2015-11-25 at 20:43
science_man_88 is offline   Reply With Quote
Old 2015-11-25, 20:57   #21
Ale
 
Nov 2015

52 Posts
Default

only hobby
Ale is offline   Reply With Quote
Old 2015-11-25, 21:15   #22
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

20C016 Posts
Default

Quote:
Originally Posted by Ale View Post
only hobby
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?
science_man_88 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Endorsement Prime Numbers finding algorithm marouane Computer Science & Computational Number Theory 18 2017-11-06 15:41
A simple idea for factoring numbers ThiloHarich Factoring 15 2017-03-06 11:23
Formubla-bla-bla to calculate the sum of two Prime numbers just by knowing the product Godzilla Miscellaneous Math 107 2016-12-06 17:48
Getting a new Prime to calculate roemer2201 PrimeNet 2 2008-12-20 16:12
Fastest possible algorithm to calculate the square root of a 10,000,000 digit number Fusion_power Math 19 2007-11-02 21:37

All times are UTC. The time now is 01:42.

Sun Jun 20 01:42:52 UTC 2021 up 22 days, 23:30, 0 users, load averages: 1.14, 1.26, 1.30

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.