by StupidDingDong July 30, 2019
(on weeaboo sites and chatrooms) to lol. The "w" comes from "warau" (笑う), Japanese verb for "laugh". The actual number of w's used is immaterial but 5 is considered to be a common minimum.
by Zinggg August 25, 2008
A type of generic spam often found on Internet message boards and forums. Sometimes used to simply disurpt a thread, other times used more malaciously to flood or disable a forum.
Thread Topic: How 'bout them Bears?
Post A: Yeah, they doin great this year.
Post B: Their contract deals suck, they're going down fast.
Post C: WWWWWWWWWWWWWWW...
Post A: Yeah, they doin great this year.
Post B: Their contract deals suck, they're going down fast.
Post C: WWWWWWWWWWWWWWW...
by C March 25, 2004
WWWWW or w.w.w.w.w is an abbreviation of the 5 W’s
The Five Ws are questions whose answers are considered basic in information gathering.
Those questions are
1. Who?
2. What?
3. Where?
4. When?
5. Why?
The Five Ws are questions whose answers are considered basic in information gathering.
Those questions are
1. Who?
2. What?
3. Where?
4. When?
5. Why?
When gathering information for your blog ask yourself wwwww (the 5 w’s) to help you make the point more clear to your readers.
by LexiSux December 21, 2022
Which Was What We Wanted. The abbreviation WWWWW may be placed at the end of a mathematical proof to serve a similar purpose as QED.
We will prove by reductio ad absurdum that there are infinitely many primes.
Assume the opposite, that there are exactly n primes. Let set S contain all n primes in increasing order, such that S={X1, X2, X3... Xn}.
Consider Y such that Y=1+(X1*X2*X3*...*Xn)
Y gives a remainder of 1 when divided by any element of S. Hence Y is not divisible by any prime and must be a prime itself. Yet this contradicts the assumption that there are only n primes, as the existence of Y means there must be at least n+1 primes.
The assumption must then be false and there must be infinitely many primes.
WWWWW.
Assume the opposite, that there are exactly n primes. Let set S contain all n primes in increasing order, such that S={X1, X2, X3... Xn}.
Consider Y such that Y=1+(X1*X2*X3*...*Xn)
Y gives a remainder of 1 when divided by any element of S. Hence Y is not divisible by any prime and must be a prime itself. Yet this contradicts the assumption that there are only n primes, as the existence of Y means there must be at least n+1 primes.
The assumption must then be false and there must be infinitely many primes.
WWWWW.
by J.Sun March 22, 2009