Re: finding primes


CBFalconer wrote:
Azumanga wrote:
dcorbit@xxxxxxxxx wrote:

... snip ...

On the other hand, we are assuming that sqrt(n*n) results in
exactly n and not: (n-1)+0.9999999999999999

In any language I'm familar with, if you found an n where that
happened, you'd submit a HUGE bug comment to the people who make the
langauge. Seriously, it you can't count on that working, I don't see
why you think the division is any more likely to work correctly...

Not very familiar with floating point, are you?

I am, and therefore would never have even considered using them to find
if numbers were prime. Surely it would simply be impossible?

Chris

.

Relevant Pages

  • Re: C++ in embedded systems
    ... CBFalconer wrote: ... > Of course I seriously mis-spoke in the above. ... > itself can be gainfully applied to any language, ...
    (comp.os.linux.embedded)
  • Re: Static allocation failure?
    ... In article, CBFalconer ... snip ... ... implementation is non-conforming, ... defined or unspecified parts of the language... ...
    (comp.arch.embedded)
  • Re: finding primes
    ... Azumanga wrote: ... snip ... ... In any language I'm familar with, if you found an n where that ...
    (comp.programming)
  • [OT] Re: 32 or 64 bit processor info in C
    ... CBFalconer wrote: ... snip ... ... So you're arguing ... that the language design should be driven by the needs of the ...
    (comp.lang.c)
  • Re: Are we abandoning writing again?
    ... We don't have the memory or even the attention span for oral ... concerned about how they use language than others. ...
    (uk.religion.pagan)