On Thu, Jun 9, 2011 at 6:10 PM, Dan Stromberg drsali...@gmail.com wrote:
On Thu, Jun 9, 2011 at 10:55 AM, geremy condra debat...@gmail.com wrote:
On Thu, Jun 9, 2011 at 4:38 AM, Dave Angel da...@ieee.org wrote:
On 01/-10/-28163 02:59 PM, Chris Rebert wrote:
On Thu, Jun 9, 2011 at 1:31
Hi Guru's,
I'm working on a solution to find the prime factor of the number
This part of the code works.. http://www.pastie.org/2041584
When the number gets bigger, the range cannot iterate through bigger number
and it does not work.
When I googled , I came across creating our own range
On Thu, Jun 9, 2011 at 1:31 AM, Ganapathy Subramanium
sganapathy.subraman...@gmail.com wrote:
Hi Guru's,
I'm working on a solution to find the prime factor of the number
This part of the code works.. http://www.pastie.org/2041584
For the archives, that code is:
num = 13195
#num =
On 09/06/2011 09:31, Ganapathy Subramanium wrote:
Hi Guru's,
I'm working on a solution to find the prime factor of the number
This part of the code works.. http://www.pastie.org/2041584
When the number gets bigger, the range cannot iterate through bigger
number and it does not work.
When I
On Thu, Jun 9, 2011 at 7:06 PM, Chris Rebert c...@rebertia.com wrote:
On Thu, Jun 9, 2011 at 1:31 AM, Ganapathy Subramanium
sganapathy.subraman...@gmail.com wrote:
Hi Guru's,
I'm working on a solution to find the prime factor of the number
This part of the code works..
On 01/-10/-28163 02:59 PM, Chris Rebert wrote:
On Thu, Jun 9, 2011 at 1:31 AM, Ganapathy Subramanium
sganapathy.subraman...@gmail.com wrote:
Hi Guru's,
I'm working on a solution to find the prime factor of the number
This part of the code works.. http://www.pastie.org/2041584
For the
On Thu, Jun 9, 2011 at 4:38 AM, Dave Angel da...@ieee.org wrote:
On 01/-10/-28163 02:59 PM, Chris Rebert wrote:
On Thu, Jun 9, 2011 at 1:31 AM, Ganapathy Subramanium
sganapathy.subraman...@gmail.com wrote:
Hi Guru's,
I'm working on a solution to find the prime factor of the number
This
Chris Angelico wrote:
Rather than find all prime numbers up to num, stop at sqrt(num) - it's
not possible to have any prime factors larger than that.
That's not quite true -- the prime factors of 26 are 2 and 13,
and 13 is clearly greater than sqrt(26).
However, once you've divided out all
On Fri, Jun 10, 2011 at 8:39 AM, Gregory Ewing
greg.ew...@canterbury.ac.nz wrote:
Chris Angelico wrote:
Rather than find all prime numbers up to num, stop at sqrt(num) - it's
not possible to have any prime factors larger than that.
That's not quite true -- the prime factors of 26 are 2 and
On Thu, Jun 9, 2011 at 10:55 AM, geremy condra debat...@gmail.com wrote:
On Thu, Jun 9, 2011 at 4:38 AM, Dave Angel da...@ieee.org wrote:
On 01/-10/-28163 02:59 PM, Chris Rebert wrote:
On Thu, Jun 9, 2011 at 1:31 AM, Ganapathy Subramanium
sganapathy.subraman...@gmail.com wrote:
Hi
10 matches
Mail list logo