[QUOTE=lorgix;233533] (Planning on learning a programming language, but I don't know which, and where to start. Most of my computing power go into finding factors in GIMPS, but with some programming skills I would branch out.)[/QUOTE]

What platform are you (windows, Linux, etc)?

If Linux start with a scripting language (eg. Shell scripts, Perl, Python). Once reasonably confident with that learn a compiled language such as C.

To do really serious work you need assembly language. But do NOT try to lean that as your first or second language!

Chris K

My main comp, unfortunately, died. It's been taken for repairs. Hopefully these are done soon, so that I may resume business. So, I'm pretty much restricted to small primes.

Let's see. (112393574355618506681^56-2)/7 ?

Primality testing (112393574355618506681^56-2)/7 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
(112393574355618506681^56-2)/7 is PRP! (0.2023s+0.0125s)

Well.. It's a proven prime to me.

(Passed 90 M-R tests for 90 random bases.)

[QUOTE=chris2be8;233543]What platform are you (windows, Linux, etc)?

If Linux start with a scripting language (eg. Shell scripts, Perl, Python). Once reasonably confident with that learn a compiled language such as C.

To do really serious work you need assembly language. But do NOT try to lean that as your first or second language!

Chris K[/QUOTE]

Thanks for responding,

[B]This is going OT, and therefore should only continue by PM, or after being made into a new thread.[/B]

I'm running Windows XP.

A few years back I used some high-level language (mostly simple Boole terms) to control machinery.

I have also occasionally written simple programs on my TI-84+ calculator.

That's it!

I have felt the need many times.
Simple example related to GIMPS(etc.); I have two simple *.txt lists of numbers that I want to produce a third *.txt list from by applying say XOR, AND, OR... very basic. I can't fix that...

Also, provided source code, I know I need an assembler, but I barely know what that is.

What to do...

Suggestion(s)?

[URL="http://www.mersenneforum.org/showthread.php?t=14062"]NEW THREAD! --->> http://www.mersenneforum.org/showthread.php?t=14062[/URL]

[QUOTE]This is going OT, and therefore should only continue by PM, or after being made into a new thread.
[/QUOTE]

Copy-paste that post into a new thread; Delete that post.

[QUOTE=3.14159;233545]My main comp, unfortunately, died. It's been taken for repairs. Hopefully these are done soon, so that I may resume business. So, I'm pretty much restricted to small primes.

Let's see. (112393574355618506681^56-2)/7 ?

Primality testing (112393574355618506681^56-2)/7 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
(112393574355618506681^56-2)/7 is PRP! (0.2023s+0.0125s)

Well.. It's a proven prime to me.

(Passed 90 M-R tests for 90 random bases.)[/QUOTE]

It's prime alright.

What part of Primos output should I post? I don't know enough about the inner workings of Primo yet.

"
Created=10-16-2010 02:16:53 PM
TestCount=158
Status=Candidate certified prime
"

Obv. doesn't prove anything...

How long did that take?

[QUOTE=3.14159;233549]How long did that take?[/QUOTE]

Well, I ran a bunch of other stuff simultaneously, and tampered with the priority but....

[Running Times]
Initialization=2.93s
1stPhase=1h 12mn 11s
2ndPhase=20mn 1s
Total=1h 32mn 15s

19413*9900^1486+1 (5942 digits).

Verification:
Primality testing 19413*9900^1486+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 7
Special modular reduction using zero-padded FFT length 4K on 19413*9900^1486+1
Calling Brillhart-Lehmer-Selfridge with factored part 34.96%
19413*9900^1486+1 is prime! (3.0440s+0.0010s)

[QUOTE=lorgix;233548]It's prime alright.

What part of Primos output should I post? I don't know enough about the inner workings of Primo yet.

"
Created=10-16-2010 02:16:53 PM
TestCount=158
Status=Candidate certified prime
"

Obv. doesn't prove anything...[/QUOTE]

To just report (unverifiably) that the number is prime: what you've already posted is enough. If it was found to be composite, it wouldn't give you that status.
To allow your result to be verified: zip the .out file and attach it here. It can be verified very quickly by another person.

[QUOTE=Mini-Geek;233558]To just report (unverifiably) that the number is prime: what you've already posted is enough. If it was found to be composite, it wouldn't give you that status.
To allow your result to be verified: zip the .out file and attach it here. It can be verified very quickly by another person.[/QUOTE]

I see.

I'll just try it out for the sake of it.

[QUOTE=lorgix;233560]I see.

I'll just try it out for the sake of it.[/QUOTE]

I've verified that the number is prime:[CODE][PRIMO - Task Report]
Version=3.0.7
WebSite=http://www.ellipsa.net/
Task=Verification
ID=B336D02DC5DAD
Created=10/16/2010 01:19:56 PM

[Common]
Path=C:\Files\Prime\Primo\work\
Selected=1
Processed=1
Valid=1
Certificate #1=Valid, 1mn 27s

[Certificate #1]
Input=primo-B336D03103D08-001.out
Status=Valid certificate

[/CODE]