Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.java.programmer > #15105 > unrolled thread

Quick n-th Square of BigInteger

Back to article view | Back to comp.lang.java.programmer

Contents

  Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-08 21:03 +0200
    Re: Quick n-th Square of BigInteger Gene Wirchenko <genew@ocis.net> - 2012-06-08 13:34 -0700
      Quick n-th Root of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-08 22:36 +0200
        Re: Quick n-th Root of BigInteger markspace <-@.> - 2012-06-08 13:55 -0700
          Re: Quick n-th Root of BigInteger glen herrmannsfeldt <gah@ugcs.caltech.edu> - 2012-06-08 21:06 +0000
            Re: Quick n-th Root of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-08 23:21 +0200
          Re: Quick n-th Root of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-08 23:34 +0200
            Re: Quick n-th Root of BigInteger Lew <lewbloch@gmail.com> - 2012-06-08 14:43 -0700
              Re: Quick n-th Root of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-08 23:47 +0200
                Re: Quick n-th Root of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-08 23:47 +0200
                Re: Quick n-th Root of BigInteger Lew <lewbloch@gmail.com> - 2012-06-08 14:55 -0700
                  Re: Quick n-th Root of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 00:00 +0200
                    Re: Quick n-th Root of BigInteger Lew <lewbloch@gmail.com> - 2012-06-08 15:10 -0700
                      Re: Quick n-th Root of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 00:12 +0200
                        Re: Quick n-th Root of BigInteger Lew <lewbloch@gmail.com> - 2012-06-08 15:18 -0700
              Re: Quick n-th Root of BigInteger glen herrmannsfeldt <gah@ugcs.caltech.edu> - 2012-06-08 22:59 +0000
                Re: Quick n-th Root of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 01:05 +0200
              Re: Quick n-th Root of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 01:00 +0200
                Re: Quick n-th Root of BigInteger Lew <lewbloch@gmail.com> - 2012-06-08 16:15 -0700
                  Re: Quick n-th Root of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 01:51 +0200
                  Re: Quick n-th Root of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 02:32 +0200
    Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-08 23:00 +0200
    Re: Quick n-th Square of BigInteger Eric Sosman <esosman@ieee-dot-org.invalid> - 2012-06-08 17:04 -0400
      Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-08 23:19 +0200
        Re: Quick n-th Square of BigInteger Eric Sosman <esosman@ieee-dot-org.invalid> - 2012-06-08 17:40 -0400
          Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-08 23:43 +0200
            Re: Quick n-th Square of BigInteger Lew <lewbloch@gmail.com> - 2012-06-08 14:52 -0700
              Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 00:30 +0200
                Re: Quick n-th Square of BigInteger glen herrmannsfeldt <gah@ugcs.caltech.edu> - 2012-06-08 23:05 +0000
      Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-11 14:53 +0200
    Re: Quick n-th Square of BigInteger Roedy Green <see_website@mindprod.com.invalid> - 2012-06-08 15:32 -0700
      Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 00:37 +0200
        Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 00:39 +0200
        Re: Quick n-th Square of BigInteger glen herrmannsfeldt <gah@ugcs.caltech.edu> - 2012-06-08 23:34 +0000
          Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 01:44 +0200
            Re: Quick n-th Square of BigInteger glen herrmannsfeldt <gah@ugcs.caltech.edu> - 2012-06-09 01:06 +0000
      Re: Quick n-th Square of BigInteger glen herrmannsfeldt <gah@ugcs.caltech.edu> - 2012-06-08 23:25 +0000
        Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 01:29 +0200
          Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 01:29 +0200
      Re: Quick n-th Square of BigInteger Wanja Gayk <brixomatic@yahoo.com> - 2012-06-17 15:00 +0200
    Re: Quick n-th Square of BigInteger Leif Roar Moldskred <leifm@dimnakorr.com> - 2012-06-09 08:42 -0500
      Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 16:54 +0200
        Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 17:56 +0200
          Re: Quick n-th Square of BigInteger Leif Roar Moldskred <leifm@dimnakorr.com> - 2012-06-09 12:52 -0500
        Re: Quick n-th Square of BigInteger Joshua Cranmer <Pidgeot18@verizon.invalid> - 2012-06-09 12:55 -0400
          Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 21:23 +0200
        Re: Quick n-th Square of BigInteger Leif Roar Moldskred <leifm@dimnakorr.com> - 2012-06-09 12:44 -0500
          Re: Quick n-th Square of BigInteger markspace <-@.> - 2012-06-09 11:50 -0700
            Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 21:13 +0200
              Re: Quick n-th Square of BigInteger markspace <-@.> - 2012-06-09 12:25 -0700
                Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-09 21:29 +0200
          Re: Quick n-th Square of BigInteger Joshua Cranmer <Pidgeot18@verizon.invalid> - 2012-06-09 21:27 -0400
            Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-10 12:08 +0200
              Re: Quick n-th Square of BigInteger Joshua Cranmer <Pidgeot18@verizon.invalid> - 2012-06-10 08:23 -0400
            Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-10 13:31 +0200
              Re: Quick n-th Square of BigInteger Wanja Gayk <brixomatic@yahoo.com> - 2012-06-17 15:11 +0200
          Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-10 12:04 +0200
        Re: Quick n-th Square of BigInteger Roedy Green <see_website@mindprod.com.invalid> - 2012-06-16 17:45 -0700
          Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-17 03:17 +0200
          Re: Quick n-th Square of BigInteger Jan Burse <janburse@fastmail.fm> - 2012-06-17 03:38 +0200
    Troll Parade Closing, Award Ceremony Jan Burse <janburse@fastmail.fm> - 2012-06-10 12:31 +0200
      Re: Troll Parade Closing, Award Ceremony Jan Burse <janburse@fastmail.fm> - 2012-06-10 12:35 +0200
      Re: Troll Parade Closing, Award Ceremony Leif Roar Moldskred <leifm@dimnakorr.com> - 2012-06-10 06:28 -0500
        Re: Troll Parade Closing, Award Ceremony Jan Burse <janburse@fastmail.fm> - 2012-06-10 13:30 +0200
      Re: Troll Parade Closing, Award Ceremony Joshua Cranmer <Pidgeot18@verizon.invalid> - 2012-06-10 08:25 -0400
        Re: Troll Parade Closing, Award Ceremony Jan Burse <janburse@fastmail.fm> - 2012-06-10 14:48 +0200
      Re: Troll Parade Closing, Award Ceremony Daniel Pitts <newsgroup.nospam@virtualinfinity.net> - 2012-06-10 11:49 -0700

Page 3 of 4 — ← Prev page 1 2 [3] 4  Next page →

#15146

Jan Burse <janburse@fastmail.fm> wrote:
> Dear All,
> 
> What is your favorite algorithm to compute the n-th Square of
> a BigInteger, i.e.

Whichever algorithm happens to be the best suited to the specific 
context the problem occurs in, of course.

-- 
Leif Roar Moldskred

[toc] | [prev] | [next] | [standalone]

#15147

Leif Roar Moldskred schrieb:
> Jan Burse <janburse@fastmail.fm> wrote:
>> Dear All,
>>
>> What is your favorite algorithm to compute the n-th Square of
>> a BigInteger, i.e.
>
> Whichever algorithm happens to be the best suited to the specific
> context the problem occurs in, of course.
>

I was actually waiting for this troll meme: "Could you tell
us more about your application domain, we are sorry, we can't
answer your question without more context information".

It is even more astonishing that this troll meme only pops
up after already a couple of solutions have pured in, and even
nobody on stackoverflow was throughing up the meme.

Anyway, the troll count goes up from 3 to 4, since I didn't
count Roedy. But your impudence deserves it.

Bye

[toc] | [prev] | [next] | [standalone]

#15148

Hi Trolls,

Let me make a prediction how the troll parade will
continue. The next troll meme that will pop up will
be: "Why are you angry, he only wants to help you
that is why he is asking for context, if you refuse
help you don't deserve help".

This forum is like a platform for troll ballerinas,
that are adicted to show their rhetorik pirouette.
Please go on and show us your figures, I will update
the counter but I will not applaude, since I have
seen them already.

Bye

Jan Burse schrieb:
> Leif Roar Moldskred schrieb:
>> Jan Burse <janburse@fastmail.fm> wrote:
>>> Dear All,
>>>
>>> What is your favorite algorithm to compute the n-th Square of
>>> a BigInteger, i.e.
>>
>> Whichever algorithm happens to be the best suited to the specific
>> context the problem occurs in, of course.
>>
>
> I was actually waiting for this troll meme: "Could you tell
> us more about your application domain, we are sorry, we can't
> answer your question without more context information".
>
> It is even more astonishing that this troll meme only pops
> up after already a couple of solutions have pured in, and even
> nobody on stackoverflow was throughing up the meme.
>
> Anyway, the troll count goes up from 3 to 4, since I didn't
> count Roedy. But your impudence deserves it.
>
> Bye
>

[toc] | [prev] | [next] | [standalone]

#15151

Jan Burse <janburse@fastmail.fm> wrote:
> Hi Trolls,
> 
> Let me make a prediction how the troll parade will
> continue. 

[SNIP]

Not bad. Baiting with both top-posting and the "forum" misnomer,
while at the same time continuing the original line of trolling.
You're a little too obvious a little too early, of course, but
I suppose that's to make it sporting?

-- 
Leif Roar Moldskred

[toc] | [prev] | [next] | [standalone]

#15149

On 6/9/2012 10:54 AM, Jan Burse wrote:
> Leif Roar Moldskred schrieb:
>> Jan Burse <janburse@fastmail.fm> wrote:
>>> Dear All,
>>>
>>> What is your favorite algorithm to compute the n-th Square of
>>> a BigInteger, i.e.
>>
>> Whichever algorithm happens to be the best suited to the specific
>> context the problem occurs in, of course.
>>
>
> I was actually waiting for this troll meme: "Could you tell
> us more about your application domain, we are sorry, we can't
> answer your question without more context information".

I saw it more as a sarcastic response. Of course, why attribute it to 
sarcasm when you can attribute it to malice? :-P

-- 
Beware of bugs in the above code; I have only proved it correct, not 
tried it. -- Donald E. Knuth

[toc] | [prev] | [next] | [standalone]

#15154

Joshua Cranmer schrieb:
> I saw it more as a sarcastic response. Of course, why attribute it to
> sarcasm when you can attribute it to malice? :-P

Oops, sorry Cranmer can't count you as a troll.
Although there is no jury on the beauty of a trolling,
a minimal artistic level is required. Somehow the
above comment lacks a certain intimidation coupled with
plain stupidity, it is too rational.

[toc] | [prev] | [next] | [standalone]

#15150

Jan Burse <janburse@fastmail.fm> wrote:
 
> I was actually waiting for this troll meme: "Could you tell
> us more about your application domain, we are sorry, we can't
> answer your question without more context information".

*shrugs* Which algorithm you should use depends on the purpose you
need to use it for. What constraints are you working under?  Which
factor has highest priority? Average speed, worst-case speed,
accuracy, precision, memory footprint, degree of parallism, time of
development, ease of maintenance? What range will the input values be
in? How many different combination of input values will there be?

There's no use to have a "favorite algorithm" decoupled from
context.. Quicksort is a nice sorting algorithm, by all means, but
sometimes -- admittedly very rarely -- the right choice is nonetheless
bubblesort.

-- 
Leif Roar Moldskred

[toc] | [prev] | [next] | [standalone]

#15152

On 6/9/2012 10:44 AM, Leif Roar Moldskred wrote:

> *shrugs* Which algorithm you should use depends on the purpose you
> need to use it for. What constraints are you working under?  Which
> factor has highest priority? Average speed, worst-case speed,
> accuracy, precision, memory footprint, degree of parallism, time of
> development, ease of maintenance?


To illustrate this, I had a prototype working about 30 to 40 minutes I 
first answered Jan's question.  It seems to converge quickly and run 
correctly, and in many cases I'd guess it's fast enough, no need to 
optimize more.

Now of course I'm unwilling to post the full code.  Jan can do his own 
coding.  But here's the driver and output.




    static BigInteger[] testVectors = {
       new BigInteger( "1" ), new BigInteger( "1" ),
       new BigInteger( "2" ), new BigInteger( "4" ),
       new BigInteger( "3" ), new BigInteger( "9" ),
       new BigInteger( "4" ), new BigInteger( "16" ),
    };

    public static void main(String[] args) {
       for ( int i = 0; i < testVectors.length; i+=2 ) {
          BigInteger root = nthRoot( testVectors[i+1], 2 );
          BigInteger expected = testVectors[i];
          if( root.compareTo( expected ) != 0 ){
             throw new AssertionError( "Expected " + expected +
", got "+root );
          }
       }
       System.out.println("All passed.");

       for( int i = 1; i <= 10 ; i++ ) {
          System.out.println( "root( 100, "+i+") = "+nthRoot(
                  new BigInteger( "100" ), i ) );
       }
       for( int i = 1; i <= 10 ; i++ ) {
          System.out.println( "root( 1000000000000000, "+i +
") = "+nthRoot(
                  new BigInteger(   "1000000000000000" ), i ) );
       }
    }


run:
All passed.
root( 100, 1) = 100
root( 100, 2) = 10
root( 100, 3) = 4
root( 100, 4) = 3
root( 100, 5) = 2
root( 100, 6) = 2
root( 100, 7) = 1
root( 100, 8) = 1
root( 100, 9) = 1
root( 100, 10) = 1
root( 1000000000000000, 1) = 1000000000000000
root( 1000000000000000, 2) = 31622776
root( 1000000000000000, 3) = 100000
root( 1000000000000000, 4) = 5623
root( 1000000000000000, 5) = 1000
root( 1000000000000000, 6) = 316
root( 1000000000000000, 7) = 138
root( 1000000000000000, 8) = 74
root( 1000000000000000, 9) = 46
root( 1000000000000000, 10) = 31
BUILD SUCCESSFUL (total time: 0 seconds)

[toc] | [prev] | [next] | [standalone]

#15153

markspace schrieb:
> To illustrate this, I had a prototype working about 30 to 40 minutes I

@markspace, @Leif
Sorry, won't count a troll more than once. Even if
you show a very artistic trolling, each troll is
only counted once. And there is no jury on the beauty
of the trolling. But I must admit it gets better and better.

So please make space markspace for other trolls,
please get a life Leif there are other trolls probably
waiting. We want to see the full parade here. Use an
alternate e-mail address when you want to see the count
increase.

[toc] | [prev] | [next] | [standalone]

#15155

On 6/9/2012 12:13 PM, Jan Burse wrote:
> markspace schrieb:
>> To illustrate this, I had a prototype working about 30 to 40 minutes I
>
> @markspace, @Leif
> Sorry, won't count a troll more than once.


Why not?  I count each post you make.

[toc] | [prev] | [next] | [standalone]

#15156

markspace schrieb:
>
> Why not?  I count each post you make.

The jury does not accept presents neither
will it change its mind by compliments.
Sorry, nice try.

[toc] | [prev] | [next] | [standalone]

#15157

On 6/9/2012 1:44 PM, Leif Roar Moldskred wrote:
> There's no use to have a "favorite algorithm" decoupled from
> context.. Quicksort is a nice sorting algorithm, by all means, but
> sometimes -- admittedly very rarely -- the right choice is nonetheless
> bubblesort.

Well, I believe Knuth once said that bubblesort has nothing to recommend 
it except some interesting math problems.

I tend to use heapsort or insertion sort pretty exclusively if I have to 
code a sort by hand.


-- 
Beware of bugs in the above code; I have only proved it correct, not 
tried it. -- Donald E. Knuth

[toc] | [prev] | [next] | [standalone]

#15159

Joshua Cranmer schrieb:
> Well, I believe Knuth once said that bubblesort has nothing to recommend
> it except some interesting math problems.
>
> I tend to use heapsort or insertion sort pretty exclusively if I have to
> code a sort by hand.

@Cranmer
Ok, if you insists, the troll count goes up to
5 for irrelevant bla bla. Great you did it.

[toc] | [prev] | [next] | [standalone]

#15165

On 6/10/2012 6:08 AM, Jan Burse wrote:
> Joshua Cranmer schrieb:
>> Well, I believe Knuth once said that bubblesort has nothing to recommend
>> it except some interesting math problems.
>>
>> I tend to use heapsort or insertion sort pretty exclusively if I have to
>> code a sort by hand.
>
> @Cranmer
> Ok, if you insists, the troll count goes up to
> 5 for irrelevant bla bla. Great you did it.

Why do you think I was trolling? I was being honest, and responding 
specifically to Leif's question, which is distinct from your original 
question.

Oh, because every post in this thread must be someone trolling you. Or 
you complaining that you're being trolled.

-- 
Beware of bugs in the above code; I have only proved it correct, not 
tried it. -- Donald E. Knuth

[toc] | [prev] | [next] | [standalone]

#15164

Joshua Cranmer schrieb:
> On 6/9/2012 1:44 PM, Leif Roar Moldskred wrote:
>> There's no use to have a "favorite algorithm" decoupled from
>> context.. Quicksort is a nice sorting algorithm, by all means, but
>> sometimes -- admittedly very rarely -- the right choice is nonetheless
>> bubblesort.
>
> Well, I believe Knuth once said that bubblesort has nothing to recommend
> it except some interesting math problems.
>
> I tend to use heapsort or insertion sort pretty exclusively if I have to
> code a sort by hand.
>
>

Oops, the jury forgot to honor the above troll meme: "Hi I am
junior troll, I know I lack the originality and spice of
real trolls, but I know how to use my keyboard and
can easily add to the smoke rising."

[toc] | [prev] | [next] | [standalone]

#15358

In article <jr20jd$hs5$2@news.albasani.net>, janburse@fastmail.fm 
says...

> Oops, the jury forgot to honor the above troll meme: [..]

To be honest you could save me a lot of reading effort, if you could 
stop answering each and every troll posting, fuelling the fire even 
more.

I'm really rather interested in reading suggested solutions and 
discussions evolving around them, or a funny remark to have a laugh once 
in a while.

Kind regards,
Wanja

-- 
The best troll is one that is ignored.

--- Posted via news://freenews.netfront.net/ - Complaints to news@netfront.net ---

[toc] | [prev] | [next] | [standalone]

#15158

Leif Roar Moldskred schrieb:
> There's no use to have a "favorite algorithm"
 > decoupled from context..

Anyway, for those who didn't recognize the troll
meme here: "When you ask for favorite algorithm,
you must sure ask for favorite in the absolute,
and not in the relative, which nobody can answer".

Suppose I am asking what is you favorite holiday
resort. Of course a normal person can answer
in winter I usually go to ... and in summer I
usually go to .... But trolls are not normal
persons.

Trolls are so special. They are close to broken
search engines. If a question is not already
narrowed down so that only two or three answers
are possible, they fail with a result overflow.
Trolls are very limited, I guess the limit is
five search hits or so before they need reboot.

But sorry the troll count doesn't change,
since I counted you already. But the troll
parade is still open.

[toc] | [prev] | [next] | [standalone]

#15343

On Sat, 09 Jun 2012 16:54:17 +0200, Jan Burse <janburse@fastmail.fm>
wrote, quoted or indirectly quoted someone who said :

>Anyway, the troll count goes up from 3 to 4, since I didn't
>count Roedy. But your impudence deserves it.

That was uncalled for. Whether you like the answer or not, he took
time out to brainstorm with you.   All he did was point out that if
one of the numbers is a constant known ahead of time it greatly
simplifies the problem.  He did not try to hurt you.

When you snap at him, you suggest to everyone else that unless their
offerings please your majesty you will similarly order decapitations.
People will leave you  alone fearing your wrath.  You are showing
signs of pathological entitlement syndrome. Keep in mind, you are not
ENTITLED to an answer. Anything people give you is a favour.

What motivates people to answer?  They are hoping something they say
will prove useful and will be acknowledged as such.  Why do people
avoid answering?  They don't know the answer or they fear criticism.

see http://mindprod.com/jgloss/brainstorming.html

http://mindprod.com/jgloss/newsgroups.html

http://www.amazon.com/gp/product/0452272041/ref=as_li_tf_t1?ie=UTF8&tag=canadianmindprod&linkCode=as2&camp=1789&creative=9325&creativeASIN=0452272041




-- 
Roedy Green Canadian Mind Products
http://mindprod.com
Controlling complexity is the essence of computer programming.
~ Brian W. Kernighan 1942-01-01
.

[toc] | [prev] | [next] | [standalone]

#15344

Roedy Green schrieb:
>> Anyway, the troll count goes up from 3 to 4, since I didn't
>> >count Roedy. But your impudence deserves it.
> That was uncalled for. Whether you like the answer or not, he took
> time out to brainstorm with you.   All he did was point out that if
> one of the numbers is a constant known ahead of time it greatly
> simplifies the problem.  He did not try to hurt you.

@Roedy
Please don't cite the jury out of context. Here is the
full context why the jury judged the post as trolling:

Leif wrote:
 > Whichever algorithm happens to be the best suited to the specific
 > context the problem occurs in, of course.

The jury wrote:
 > I was actually waiting for this troll meme: "Could you tell
 > us more about your application domain, we are sorry, we can't
 > answer your question without more context information".
 >
 > It is even more astonishing that this troll meme only pops
 > up after already a couple of solutions have pured in, and even
 > nobody on stackoverflow was throughing up the meme.
 >
 > Anyway, the troll count goes up from 3 to 4, since I didn't
 > count Roedy. But your impudence deserves it.

[toc] | [prev] | [next] | [standalone]

#15345

Roedy Green schrieb:
> On Sat, 09 Jun 2012 16:54:17 +0200, Jan Burse <janburse@fastmail.fm>
> wrote, quoted or indirectly quoted someone who said :
>
>> Anyway, the troll count goes up from 3 to 4, since I didn't
>> count Roedy. But your impudence deserves it.
>
> That was uncalled for. Whether you like the answer or not, he took
> time out to brainstorm with you.   All he did was point out that if
> one of the numbers is a constant known ahead of time it greatly
> simplifies the problem.  He did not try to hurt you.

Anyway the contest is already closed. The jury cannot
add you anymore on the troll list, although the above
would clearly qualify as trolling. The troll meme has
already been part of the parade. Its "the why don't you
want help" meme.

But your trolling has an additional twist. Since it
is a balant spam for your web-site. The articles of
the association forbid spam of non registered sponsors
of the contest. You have to register with us before
you can use the contest for advertisement.

But since your troll glossary entry is not that bad:
http://mindprod.com/jgloss/troll.html
The jury will refrain from a fine this time.

Bye

[toc] | [prev] | [next] | [standalone]

Page 3 of 4 — ← Prev page 1 2 [3] 4  Next page →

Back to top | Article view | comp.lang.java.programmer

csiph-web