since Nov 02, 2007

Cows and Likes

Cows

Total received

0

In last 30 days

0

Total given

0

Likes

Total received

0

Received in last 30 days

0

Total given

0

Given in last 30 days

0

Forums and Threads

Scavenger Hunt

Ranch Hand Scavenger Hunt

Greenhorn Scavenger Hunt

Its decently fast. I am working on a new algorithm that takes into account some number theoretic properties. I used this for solving problems involving small prime numbers over at projecteuler.net.

12 years ago

It looks like K & B have answered your question in your quoted text. What are you unclear about?

12 years ago

its been a while but can you find the window hanlde for the object and send it a message to disable it. I remember doing stuff like that about 7 or 8 years ago.

12 years ago

That code will account for even numbers.

12 years ago

Hello there, and welcome.

12 years ago

Wolfram Alpha will help you.

http://www06.wolframalpha.com/input/?i=Solve[2^%28n%2F%28c+P%29%29+%3D%3D+P%2Fn%2C+n]

copy / paste the url... Im not sure what is going on with the clickable link.

http://www06.wolframalpha.com/input/?i=Solve[2^%28n%2F%28c+P%29%29+%3D%3D+P%2Fn%2C+n]

copy / paste the url... Im not sure what is going on with the clickable link.

12 years ago

Do the permutations need to be in lexicographic order ? I used a version of the SEPA algorithm for one of the euler problems.

12 years ago

On my system comparing i <= n/i is faster than comparing i < Math.sqrt(n).

Also since the number is odd you can initialize i to 3 and inc by 2.

12 years ago

It is covered in K&B. I just finished reading it and remember them talking about it. They do not cover it in much detail, however, it is just a simple concept that you should be able to remember.

14 years ago