mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 60
Search took 0.02 seconds.
Search: Posts Made By: vasyannyasha
Forum: Homework Help 2019-06-25, 06:34
Replies: 4
Views: 1,663
Posted By vasyannyasha
Im searching for numbers that n-gonal pyramidal...

Im searching for numbers that n-gonal pyramidal number and n-angular number. Cannonball problem for different bases
Forum: Homework Help 2019-06-16, 08:43
Replies: 4
Views: 1,663
Posted By vasyannyasha
And i forget about searching from some minimal...

And i forget about searching from some minimal border.
How to find nmin without computing previous P_n^r?
Pre-thx
Forum: Homework Help 2019-06-15, 11:45
Replies: 4
Views: 1,663
Posted By vasyannyasha
Searching many formulas to one limit

Hi guys!
This is formula for nth r-gonal pyramidal number
P_n^r= \frac{3n^2 + n^3(r-2) - n(r-5)}{6}
I have , for example 2<r<1000.
And i want to search all this numbers to one constant border(for...
Forum: FactorDB 2019-06-13, 13:26
Replies: 126
Views: 18,001
Posted By vasyannyasha
(2127031+1)/3 is just above 38000 digits.

(2127031+1)/3 is just above 38000 digits.
Forum: Riesel Prime Search 2019-05-30, 07:09
Replies: 380
Views: 40,195
Posted By vasyannyasha
2641908225

Reserving 2641908225
Pre-thanks
Forum: News 2018-12-09, 15:44
Replies: 270
Views: 30,361
Posted By vasyannyasha
Congratulations to discoverer! Curtis Cooper is...

Congratulations to discoverer!
Curtis Cooper is discoverer or not?
Forum: Msieve 2018-12-05, 11:04
Replies: 1
Views: 1,446
Posted By vasyannyasha
Msieve error

Im using ggnfs with factmsieve.py to factor 91-digit number.
After finding 100%+ relations i got this problem
appending spairs.out.T0 to spairs.out
appending spairs.out.T1 to spairs.out
appending...
Forum: Riesel Prime Search 2018-02-18, 14:18
Replies: 995
Views: 99,027
Posted By vasyannyasha
Kosmaj, check again. Everything work fine now....

Kosmaj, check again. Everything work fine now. PRPNet server was down.
Forum: Data 2018-01-20, 16:02
Replies: 17
Views: 3,913
Posted By vasyannyasha
Actually we have determenistic P-1 Pollard test. ...

Actually we have determenistic P-1 Pollard test.
On mersenne.ca we see B1=5*10^12
So the minimum P-1 factorisation is B1*B1
Which is 2.5*10^25.
Log2(2.5*10^25)=84.4
So "No factors below 2^84"
Forum: Aliquot Sequences 2018-01-12, 21:09
Replies: 244
Views: 22,962
Posted By vasyannyasha
Escape from 26 3087...

Escape from 26
3087 3883520684800021728793155600525505797862818464717560389541258977182719674383518775541911157072918588442565642944=2^6 *...
Forum: Factoring 2018-01-12, 17:52
Replies: 7
Views: 889
Posted By vasyannyasha
Before this I find dozens of different factors...

Before this I find dozens of different factors with ECM.
Memory work fine.
Maybe this was bug for 30 seconds.
After this P-1 test used 2 GB and find this factor.
Forum: Factoring 2018-01-12, 17:20
Replies: 7
Views: 889
Posted By vasyannyasha
GMP-ECM write only about odds for 35-digit factor...

GMP-ECM write only about odds for 35-digit factor and bigger.
Forum: Factoring 2018-01-12, 17:18
Replies: 7
Views: 889
Posted By vasyannyasha
111-digit number from aliquot sequence

111-digit number from aliquot sequence
Forum: Factoring 2018-01-12, 15:25
Replies: 7
Views: 889
Posted By vasyannyasha
My luck

I didn't find 12-digit factor after 1000 curves with B1=11000
What are the odds?
Forum: News 2018-01-03, 19:09
Replies: 505
Views: 70,726
Posted By vasyannyasha
467333183359...069762179071

467333183359...069762179071
Forum: News 2017-12-30, 20:31
Replies: 505
Views: 70,726
Posted By vasyannyasha
I calculated that this number have approx 23.1...

I calculated that this number have approx 23.1 million digits,so this number close to M77000000.
Forum: News 2017-12-28, 18:50
Replies: 505
Views: 70,726
Posted By vasyannyasha
Congratulations!!! Sweet dreams are made of...

Congratulations!!!

Sweet dreams are made of this
Who am I to disagree?
I travel the forum
And the seven threads
Forum: Aliquot Sequences 2017-12-23, 12:27
Replies: 3,350
Views: 262,420
Posted By vasyannyasha
Hi I reserve 1281810 Pre-thanks

Hi
I reserve 1281810
Pre-thanks
Forum: Software 2017-12-19, 07:18
Replies: 6
Views: 681
Posted By vasyannyasha
Cpu-Z write L1-D=16Kb*4 L1-I=96Kb*2(in...

Cpu-Z write
L1-D=16Kb*4
L1-I=96Kb*2(in previous message i wrote 96Kb*4. Sorry, my mistake. In first message everything is right)
L2=2048Kb
So L2 per core=2048/4=512Kb
Forum: Software 2017-12-18, 16:56
Replies: 6
Views: 681
Posted By vasyannyasha
L1 D(Data?)=16KB *4 L1 I(intsructions?)=96KB*4

L1 D(Data?)=16KB *4
L1 I(intsructions?)=96KB*4
Forum: Software 2017-12-18, 15:59
Replies: 6
Views: 681
Posted By vasyannyasha
LLR can't find all L1 cache

I have AMD Athlon X4 860K with L1=16*4+96*2=256 KB
But LLR write
L1 cache size : 16 KB
Could somebody explain this?
pre-thanks
Forum: Conjectures 'R Us 2017-12-05, 18:51
Replies: 596
Views: 39,808
Posted By vasyannyasha
R622

I want to reserve R622.
Pre-thanks
Forum: And now for something completely different 2017-12-03, 19:02
Replies: 239
Views: 25,105
Posted By vasyannyasha
base 48 and 52

Base 52 from n=1000 to 10000
No primes

Base 48 from n=1000 to 10000
Four primes

(48^1153+1)^2-2
(48^3882-1)^2-2
(48^4687+1)^2-2
(48^6123-1)^2-2
Forum: PrimeNet 2017-12-02, 18:38
Replies: 11
Views: 5,846
Posted By vasyannyasha
From post #9 112349 seconds to test exponent...

From post #9
112349 seconds to test exponent M35000011 4 cores
43.75 Ghz-day=12 PFLOP
So 1 Ghz-day=0.27 PFLOP=274 TFLOP

I made measurements on my AMD
760208 seconds to test exponent M35000011...
Forum: And now for something completely different 2017-12-01, 07:02
Replies: 239
Views: 25,105
Posted By vasyannyasha
My English.. Sorry, my mistake

My English..
Sorry, my mistake
Showing results 1 to 25 of 60

 
All times are UTC. The time now is 13:04.

Tue Oct 27 13:04:05 UTC 2020 up 47 days, 10:15, 0 users, load averages: 2.47, 3.01, 2.75

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.