Re: As the Crow flies.

On Oct 13, 3:52 pm, Garamond Lethe <cartographi...@xxxxxxxxx> wrote:
On Oct 13, 4:03 am, spintronic <spintro...@xxxxxxxxxxx> wrote:


I have an idea, since you obviously think you know more than the
person who wrote the code
with a 10 minute glance.

Implement the changes you describe, and come back with an apology
when the program gives you incorrect results.

I showed you how to do that already.

No.

1) No changes need to be made.
2) You have not implemented any changes, If you had,
you will (assuming you have the brain power) realise that
the program ceases to function correctly.



Integer division truncates, so there's no need to round down.  

You obviously think this function "rounds down" to the nearest
integer. Let me save you some head-banging. It *doesn't*.

It rounds down to the nearest "prime or pseudo prime".


Use the floor() function for doubles. If what you were trying to
do was something other than "Rounddown", your error is in
naming the function.


No. I get to name the function, since it's my invention.

You want to name something, I suggest you buy a dog.



Tell me, using floats, if I get a result ending (inter.decimal) = (n.
5)
Do you round up or down?

Depends on what your algorithm needs.


Well obviously you dont know, since you have no idea how this program
works.



floor() will round that down.  ceil() will round that up.  <snip>

yes, yes, yes. Tell me something I don't know.

Again (from the person who wrote the program) *floats* don't work.

Show, don't tell.


You are having trouble with much simpler concepts. Lets work through
them
before you attempt elementary stuff, eh?



It's not that hard once you know what you are doing.

I don't seem to be the one having difficulty here.

You are. Your just to ignorant to know.



You either made an error naming the function,

No. There *IS* no function for what that code does. Because IT DOES
NOT
EXIST. It's NEW MATH.

"Rounddown" is new math?

Let me ask a very simple question.

*If* this was suppose to be a "floor function", why would it do this:

101 -> |_101_|
100 -> |_97_|
99 -> |_97_|
98 -> |_97_|
97 -> |_97_|
96 - > |_95_|
95 -> |_95_|
94 -> |_91_|
93 -> |_91_|
92 -> |_91_|
91 -> |_91_|

Let me guess. You have no idea.


Since you're unable to explain this code, my best guess is that you've
copied it from somebody else, probably a student.

Loon.
Garmond Screams
"''I don't understand' ergo 'my best solution is to scream
you could not have possibly wrote this, it's beyond my
comprehension''".

Did you write it?

Of course I wrote it. It would not be posted by me if I didn't.



Yes, hense when asked is this implemented on paper I earlier said
"yes"
because the math, algorithms and charts are on paper here right in
front of me.

Good.  What's the algorithm you're trying to implement in Rounddown?
You've got it in front of you, right?


Any prime number is either 1/3 or 2/3 from a whole number. We can
follow a
simple pattern.
All odd integers + 2/3 * 3
All even integers + 1/3 *3


0.666*3 = 2
1.666*3 = 5
2.333*3 = 7
3.666*3 = 11
4.333*3 = 13
5.666*3 = 17
6.333*3 = 19
7.666*3 = 23
8.333*3 = 25.

With this simple rule we have eliminated 17 integers in our search
for primes below 25. Thats why it's so efficient.

The "round-down" algorithm "floors" to either a "prime" or what I call
a "pseudo prime". (25 is one example here)

Now, that's 1 function explained.

.

Relevant Pages

  • New RUIX cipher
    ... The implementation has a mainroutine that calls the encode function ... Rounds are calculated taking 3 bits of the key expansion and computing ... i make key addition xoring the corresponding 4 byte key with plaintext ... be implemented in other versions of this algorithm ...
    (sci.crypt)
  • Re: More math stuff, truth and social reality
    ... > the math people have basically set up one criteria to block the proofs: ... Assuming you have the truth, denial is indeed wrong and indeed foolish. ... people don't seem to be requesting you to provide an algorithm that factors ... If you have, indeed, provided one which these posters ...
    (sci.math)
  • Re: Prime Number Question
    ... were discovered a simply algorithm for generating all prime numbers ... directly, in batches, with each batch being used ... batches will need quite a while to get to numbers that big. ... and math and taught many college levelmath courses at Cornell University. ...
    (comp.unix.bsd.openbsd.misc)
  • Re: simple math question
    ... Th subet of math that is used in physics. ... algorithm when it is clear that you don't understand the math behind ... very simple linear algebriac polynomial several times during the runtime of ... much mathematics. ...
    (sci.crypt)
  • Re: SproutMethod.pdf
    ... >> There is a threshold when software becomes much bigger system them ... >> just an algorithm. ... Now thats a hard job to model in math. ... Tsolak Petrosian ...
    (comp.object)