Wheel factorization: Efficient? - Page 18

CRGreathouse · 2010-07-22, 18:50

I'll see your Dilbert and raise you an xkcd:
http://xkcd.com/221/

3.14159 · 2010-07-23, 00:52

For logs of different bases:

Ex: log₁₀(n):

Should I write: 10^x=n; x = log₁₀(n)?

It states: "deep recursion", when I test it.

CRGreathouse · 2010-07-23, 01:27

log(n)/log(10)

3.14159 · 2010-07-23, 01:28

Quote:

log(n)/log(10)

log(n)/log(10)?

You're right.

science_man_88 · 2010-07-23, 12:11

Quote:

Originally Posted by 3.14159

log(n)/log(10)?

You're right.

first I knew how to do any log like that and second the second picture looks like one of my cats lol.

3.14159 · 2010-07-23, 12:58

Quote:

first I knew how to do any log like that and second the second picture looks like one of my cats lol.

How many cats do you have?

science_man_88 · 2010-07-23, 13:11

Quote:

Originally Posted by 3.14159

How many cats do you have?

off topic or what lol 3 surviving so far 1 that got take by coyotes i think and one long before that and I think we had 2 dogs while growing up my sister is moved out and has a hampster at last check.

3.14159 · 2010-07-23, 13:24

Quote:

off topic or what lol 3 surviving so far 1 that got take by coyotes i think and one long before that and I think we had 2 dogs while growing up my sister is moved out and has a hampster at last check.

Yep. Another case of

Anyway:

I'll see if I can code retina's test, which I saved onto a text document.

retina · 2010-07-23, 13:39

Quote:

Originally Posted by 3.14159

I'll see if I can code retina's test, which I saved onto a text document.

First time I've ever had a test named after me. However I don't think it is worthy of either being named after anyone or being called a test. It is just a bound selection.

As for the MR test bound. I never posted my test bounds because they don't apply to your case. I never did a proof, I stopped at the MR test. My level of paranoia allowed me to stop when I was satisfied that the estimated MR failure probability was <2^-100. Note that this level of probability is the same as used by the banking industry when selecting "random" primes for their crypto systems.

3.14159 · 2010-07-23, 13:46

Quote:

First time I've ever had a test named after me. However I don't think it is worthy of either being named after anyone or being called a test. It is just a bound selection.

Only applies if your name is really "Retina".

Quote:

As for the MR test bound. I never posted my test bounds because they don't apply to your case. I never did a proof, I stopped at the MR test. My level of paranoia allowed me to stop when I was satisfied that the estimated MR failure probability was <2¹⁰⁰. Note that this level of probability is the same as used by the banking industry when selecting "random" numbers for their crypto systems.

Probability that an attack might succeed? Or one of the pseudoprimes being chosen being a composite pseudoprime? Also: I'm sure you meant: 1 in 2¹⁰⁰.

retina · 2010-07-23, 13:48

Quote:

Originally Posted by 3.14159

Probability that an attack might succeed? Or one of the numbers not being prime?

Probability of the number not really being prime.

2010-07-23, 00:52	#189
3.14159 May 2010 Prime hunting commission. 2⁴·3·5·7 Posts	For logs of different bases: Ex: log₁₀(n): Should I write: 10^x=n; x = log₁₀(n)? It states: "deep recursion", when I test it. Last fiddled with by 3.14159 on 2010-07-23 at 00:55

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Wheel Factorization	a1call	Factoring	11	2017-06-19 14:04
Efficient Test	paulunderwood	Computer Science & Computational Number Theory	5	2017-06-09 14:02
LL tests more credit-efficient than P-1?	ixfd64	Software	3	2011-02-20 16:24
A Wheel	storm5510	Puzzles	7	2010-06-25 10:29
Most efficient way to LL	hj47	Software	11	2009-01-29 00:45

2010-07-22, 18:50	#188
CRGreathouse Aug 2006 3·1,993 Posts	I'll see your Dilbert and raise you an xkcd: http://xkcd.com/221/

2010-07-23, 01:27	#190
CRGreathouse Aug 2006 3×1,993 Posts	log(n)/log(10)