chessgames.com
Members · Prefs · Laboratory · Collections · Openings · Endgames · Sacrifices · History · Search Kibitzing · Kibitzer's Café · Chessforums · Tournament Index · Players · Kibitzing

Louis Stumpers
L Stumpers 
 

Number of games in database: 63
Years covered: 1932 to 1969
Overall record: +14 -35 =14 (33.3%)*
   * Overall winning percentage = (wins+draws/2) / total games.

Repertoire Explorer
Most played openings
D94 Grunfeld (3 games)
B59 Sicilian, Boleslavsky Variation, 7.Nb3 (2 games)
D31 Queen's Gambit Declined (2 games)
D45 Queen's Gambit Declined Semi-Slav (2 games)
E60 King's Indian Defense (2 games)
E21 Nimzo-Indian, Three Knights (2 games)
C65 Ruy Lopez, Berlin Defense (2 games)


Search Sacrifice Explorer for Louis Stumpers
Search Google for Louis Stumpers

LOUIS STUMPERS
(born Aug-30-1911, died Sep-27-2003, 92 years old) Netherlands

[what is this?]

Frans Louis Henri Marie Stumpers was born in Eindhoven, Netherlands, on 30 August 1911. (1) He was champion of the Eindhoven Chess Club in 1938, 1939, 1946, 1947, 1948, 1949, 1951, 1952, 1953, 1955, 1957, 1958, 1961 and 1963, (2) and champion of the North Brabant Chess Federation (Noord Brabantse Schaak Bond, NBSB) in 1934, 1935, 1936, 1937, 1938, 1939, 1940, 1941, 1942, 1943, 1944, 1946, 1948, 1949, 1950, 1951, 1952, 1953, 1954, 1955, 1959, 1961, 1962, 1963, 1964, 1965, 1966 and 1967. (3) Stumpers participated in five Dutch Chess Championships, with his high-water mark a fourth place finish in 1948, (4) and represented his country at the 1st European Team Championship in Vienna in 1957 (two games, vs Josef Platt and Max Dorn). (5) From 1945 until about 1956, he was first Secretary and then Chairman of the NBSB. (3)

Stumpers was a physicist, and worked for the Philips company as an assistant from 1928. During 1934-1937, he studied at the University of Utrecht, where he took the master's degree. (6) In 1938 Stumpers was again employed at Philips, (6) and at a tournament in 1942, he supplied the hungry chess players with food from his employer. (3) After the war, Stumpers made a career in physics, with patents and awards on information ("radio") technology. He received degrees from several universities and colleges, including in Poland and Japan. (1, 3, 6) Stumpers retired from Philips in 1972, but continued teaching, (6) partly as professor at the University of Utrecht (1977-1981). (7) He was also Vice President (1975-1981) and Honorary President (1990-2003) of URSI, the International Union of Radio Science. (8)

Louis Stumpers married Mieke Driessen in 1954. They had five children, three girls and two boys. (6)

1) Online Familieberichten 1.0 (2016), http://www.online-familieberichten...., Digitaal Tijdschrift, 5 (255), http://www.geneaservice.nl/ar/2003/...
2) Eindhovense Schaakvereniging (2016), http://www.eindhovenseschaakverenig...
3) Noord Brabantse Schaak Bond (2016), http://www.nbsb.nl/pkalgemeen/pk-er... Their main page: http://www.nbsb.nl.
4) Schaaksite.nl (2016), http://www.schaaksite.nl/2016/01/01...
5) Olimpbase, http://www.olimpbase.org/1957eq/195...
6) K. Teer, Levensbericht F. L. H. M. Stumpers, in: Levensberichten en herdenkingen, 2004, Amsterdam, pp. 90-97, http://www.dwc.knaw.nl/DL/levensber... Also available at http://www.hagenbeuk.nl/wp-content/...
7) Catalogus Professorum Academiæ Rheno-Traiectinæ, https://profs.library.uu.nl/index.p...
8) URSI websites (2016), http://www.ursi.org/en/ursi_structu... and http://www.ursi.org/en/ursi_structu...

Suggested reading: Eindhovense Schaakvereniging 100 jaar 1915-2015, by Jules Welling. Stumpers' doctoral thesis Eenige onderzoekingen over trillingen met frequentiemodulatie (Studies on Vibration with Frequency Modulation) is found at http://repository.tudelft.nl/island...

This text by User: Tabanus. The photo was taken from http://www.dwc.knaw.nl.

Last updated: 2022-04-04 00:17:13

Try our new games table.

 page 1 of 3; games 1-25 of 63  PGN Download
Game  ResultMoves YearEvent/LocaleOpening
1. L Stumpers vs J Lehr 1-0191932EindhovenD18 Queen's Gambit Declined Slav, Dutch
2. L Prins vs L Stumpers  1-0391936NED-ch prelimB20 Sicilian
3. E Sapira vs L Stumpers 0-1251938NBSB-FlandersD94 Grunfeld
4. L Stumpers vs E Spanjaard  1-0551938NED-ch prelimE02 Catalan, Open, 5.Qa4
5. A J Wijnans vs L Stumpers  1-0361939NED-chB05 Alekhine's Defense, Modern
6. J van den Bosch vs L Stumpers  ½-½581939NED-chA48 King's Indian
7. L Stumpers vs S Landau 0-1411939NED-chD33 Queen's Gambit Declined, Tarrasch
8. H van Steenis vs L Stumpers  1-0251939NED-chB02 Alekhine's Defense
9. L Stumpers vs H Kramer  0-1361940HilversumE25 Nimzo-Indian, Samisch
10. L Stumpers vs S Landau  ½-½341940HilversumD31 Queen's Gambit Declined
11. A van den Hoek vs L Stumpers  1-0271941BondswedstrijdenB10 Caro-Kann
12. T van Scheltinga vs L Stumpers 1-0351942NED-ch12D94 Grunfeld
13. W Wolthuis vs L Stumpers  ½-½521946NED-ch prelim IC58 Two Knights
14. L Stumpers vs J H Marwitz  1-0401946NED-ch prelim ID31 Queen's Gambit Declined
15. G Fontein vs L Stumpers  ½-½261946NED-ch prelim ID94 Grunfeld
16. L Stumpers vs H van Steenis 0-1241946NED-ch prelim ID28 Queen's Gambit Accepted, Classical
17. C van den Berg vs L Stumpers  1-0581946NED-ch prelim ID19 Queen's Gambit Declined Slav, Dutch
18. L Stumpers vs Euwe 0-1301946NED-ch prelim IE60 King's Indian Defense
19. L Stumpers vs N Cortlever  ½-½501946NED-ch prelim IE60 King's Indian Defense
20. L Stumpers vs H Grob 1-0601947Baarn Group BA55 Old Indian, Main line
21. L Stumpers vs H van Steenis  0-1331947Baarn Group BD23 Queen's Gambit Accepted
22. Tartakower vs L Stumpers 1-0241947Baarn Group BD74 Neo-Grunfeld, 6.cd Nxd5, 7.O-O
23. V Soultanbeieff vs L Stumpers  ½-½461947Baarn Group BD96 Grunfeld, Russian Variation
24. L Stumpers vs A Vinken  0-1331948NED-ch sfE21 Nimzo-Indian, Three Knights
25. L Prins vs L Stumpers  ½-½301948NED-ch sfD02 Queen's Pawn Game
 page 1 of 3; games 1-25 of 63  PGN Download
  REFINE SEARCH:   White wins (1-0) | Black wins (0-1) | Draws (1/2-1/2) | Stumpers wins | Stumpers loses  

Kibitzer's Corner
< Earlier Kibitzing  · PAGE 20 OF 94 ·  Later Kibitzing>
Sep-18-17  john barleycorn: <al wazir: <john barleycorn: you mean this one:

(2*c)^3 = (2*c)*((2*c)^2 + 3*0)?>

Yes.>

What is wrong with that???

comparing the corresponding terms it gives you:

(a+b)^3 = (2*c)^3 and (a+b)*3*(a-b)^2=0

So, a=b=c is the only trivial solution in the positive integers.

Sep-18-17
Premium Chessgames Member
  al wazir: <john barleycorn: f=a+b must divide (2*c)^3 and if f is not a prime number it does not have to divide 2*c.> Yes, my argument was nonsense.

But you seem to have compared f(f^2 + 3g^2) and f'(f'^2 + 3g'^2) term by term and concluded that f = f' and g = g'.

I don't see how you conclude that.

Sep-18-17  john barleycorn: <al wazir: ...

I don't see how you conclude that.>

Give another factorization of
4*a^3 + 4*b^3.

Sep-18-17
Premium Chessgames Member
  al wazir: 18^3 + 20^3 = 2^3 + 24^3 = 13832

Let a = 20 and b = 18. Let f = a + b = 38 and g = a – b = 2.

Let a' = 24 and b' = 2. Let f' = a' + b' = 26 and g' = a' – b' = 22.

Then f(f^2 + 3g^2) = 55328 = f'(f'^2 + 3g'^2).

But f ≠ f' and g ≠ g'.

Sep-18-17  john barleycorn: < al wazir: 18^3 + 20^3 = 2^3 + 24^3 = 13832 >

oh man, you must be under shock after your bombast was brought to nothing.

We are discussing a^3+b^3=2*c^3. And in this particular case you can proceed as I did.

Really, you do not <... need help from Mr. Euler and Mr. Binet after all.> Better ask <Niesjesram> or <Abdel>.

Sorry, but I was patient enough, I think.

Sep-18-17
Premium Chessgames Member
  al wazir: And if you insist that a, b must both be odd, here is another example:

121^3 + 137^3 = 23^3 + 163^3 = 4342914.

Let f = 258, g = 16; f' = 186, g' = 140.

f(f^2 + 3g^2) = 17371656 = f'(f'^2 + 3g'^2), but f ≠ f' and g ≠ g'.

Sep-18-17  Tiggler: Just kibitzing on the last few pages here, I have a couple of questions.

1. <jb> advises another frequent poster to "stick to recreational mathematics." Does this mean that <jb>. has discovered a branch of mathematics that is no fun? I'd like to what <johnl> thinks of that.

2. <johnl> uses a mathematical wonder "to evoke a sense of awe at a universe where ...". What universe is that? Is there a mapping between mathematics and the natural universe? Which way does it go, or is it both ways?

I'm not (only) trolling: I'd really like to know.

Sep-18-17
Premium Chessgames Member
  al wazir: 251^3 + 333^3 = 17^3 + 375^3 = 52739288

In this case f(f^2 +3g^2) is divisible by 4, so there's your alternative factorization.

Sep-18-17  john barleycorn: <Give another factorization of 4*a^3 + 4*b^3.>

<al wazir: 251^3 + 333^3 = 17^3 + 375^3 = 52739288

In this case f(f^2 +3g^2) is divisible by 4, so there's your alternative factorization.>

are you just playing stupid?
If you have 2 factors X and Y with
X*Y = 4*a^3 + 4*b^3 = (a+b)((a+b)^2 + 3*(a-b)^2) you have especially X*Y = (a+b)((a+b)^2 + 3*(a-b)^2). Did you get that?

Make (a+b)((a+b)^2 + 3*(a-b)^2) the prototype. And all works well.

Sep-18-17  john barleycorn: <Tiggler: ...

1. <jb> advises another frequent poster to "stick to recreational mathematics." Does this mean that <jb>. has discovered a branch of mathematics that is no fun? ...>

Recreational mathematics for me is what you find e.g. in Martin Gardner's books. Easy to digest on weekends with a glas of wine.

Everybody who did mathematics has his favourite subjects. My particular dislike was statistics and numerical analysis. No fun for me.

Sep-18-17  john barleycorn: Oh <Tiggler> and just today I added "teaching mathematics on Stumpers" hahaha
Sep-18-17
Premium Chessgames Member
  al wazir: <john barleycorn: If you have 2 factors X and Y with X*Y = 4*a^3 + 4*b^3 = (a+b)((a+b)^2 + 3*(a-b)^2) you have especially X*Y = (a+b)((a+b)^2 + 3*(a-b)^2). Did you get that?>

No. You're just repeating yourself.

Sep-18-17  john barleycorn: <al wazir: ...

No. You're just repeating yourself.>

Seemingly too few times to get into your head. But I give it up.

Sep-18-17  Tiggler: <jb> OK, I get that. If you ever teach math anywhere, your students will add: any math topic taught by a blowhard.

Isn't Stumpers a recreational page, or do you have a professional mission to enlighten and impress, even here?

Sep-18-17  john barleycorn: <Tiggler: ...any math topic taught by a blowhard.

Isn't Stumpers a recreational page, or do you have a professional mission to enlighten and impress, even here?>

1. make it taught by an "authentic" blowhard.

2. "impress" is <al wazir>'s mission though it is mostly all bluff. He should have added Jacobi, Legendre and a few other greats in his long posts about a problem which a college student trained by an authentic blowhard would have solved before breakfast.

Sep-19-17
Premium Chessgames Member
  al wazir: <john barleycorn>: I gave a proof (Louis Stumpers (kibitz #7988)) that there are no non-trivial solutions to a^3 + b^3 = 2c^3, based on Euler's argument for the same equation without the factor of 2. But earlier you seemed to be implying (Louis Stumpers (kibitz #7967)) that there's a simpler proof.

You posted a "hint" (Louis Stumpers (kibitz #7989)), which I didn't understand. (It's nothing more than a restatement of the formula for the factorization of the sum of two cubes, which I learned in junior high school.)

I asked a question. Your answer didn't make it clearer. Maybe you really do have a simple proof in mind, but you explained it very poorly. I still don't understand.

If you can't explain it any better than that, I'll have to conclude that you are talking nonsense.

Sep-20-17  john barleycorn: <al wazir> you are an "interesting" debater.

<al wazir: ... (It's nothing more than a restatement of the formula for the factorization of the sum of two cubes, which I learned in junior high school.)>

Since you learned that so early in your life you may have missed that

(a+b)*((a+b)^2 + 3*(a-b)^2) = (2*c)^3

allows for the conclusion a+b = 2*c.

that is why I wrote

(2*c)^3 = (2*c)*((2*c)^2 + 3*0).

a+b > 2*c and a+b < 2*c are impossible which leaves a+b = 2*c which necessarily gives a=b. (Remember, we are considering positive integers before you bring up further mental crap)

Furthermore, you apparently do not have a clue how the Euler/Binet formulae were derived.

So, here is a free lesson for you:

Treating the equation

a^3 + b^3 = c^3 + d^3

they put A = a + b, B = a - b,
C = c + d, and D = c - d which gives
A*(A^2 + 3*B^2) = C*(C^2 + 3*D^2).

Now, we are considering the case c = d.

That simplifies the equation to

a^3 + b^3 = 2*c^3.

With the little trick multiplying the equation by 4 we have

4*a^3 + 4*b^3 = (2*c)^3 =
(2*c)((2*c)^2 + 3*0^2)

and without any substitution required we have

(a+b)*((a+b)^2 + 3*(a-b)^2) =
(2*c)*((2*c)^2 + 3*0^2)

from which we can conclude a=b (see above)

(something that slipped you attention completely.)

What is interesting is since you did not understand these simple manipulations you threw in examples like

<al wazir: And if you insist that a, b must both be odd, here is another example:

121^3 + 137^3 = 23^3 + 163^3 = 4342914.

Let f = 258, g = 16; f' = 186, g' = 140.

f(f^2 + 3g^2) = 17371656 = f'(f'^2 + 3g'^2), but f ≠ f' and g ≠ g'.>.

Clearly documenting that you are confused and trying to make a point that has nothing to do with the case in question.

I think, I was lucid enough for a second grader to understand and hope that in a year or so you might understand, too.

Sep-20-17  john barleycorn: <al wazir: ...

You posted a "hint" (Louis Stumpers (kibitz #7989)), which I didn't understand. ...>

Well, that's a different statement from what you posted right after my hint (which was a proof for those in the know):

< al wazir: <john barleycorn>: Your last equation makes no sense. But I see the contradiction, and it's a lot shorter than my proof.>

<I see the contradiction> and then admitting

<al wazir: <john barleycorn: f=a+b must divide (2*c)^3 and if f is not a prime number it does not have to divide 2*c.> Yes, my argument was nonsense.

But you seem to have compared f(f^2 + 3g^2) and f'(f'^2 + 3g'^2) term by term and concluded that f = f' and g = g'.

I don't see how you conclude that.>

That is hilarious. See my previous post. Junior high school stuff as to your own admission.

Sep-20-17
Premium Chessgames Member
  al wazir: <john barleycorn>: You don't have a proof. You don't even have a clue about a proof. You just fake it. You never even read through the correct proof I gave, which followed Euler's treatment of the n=3 case of Fermat's Theorem. It was probably too difficult for you.

Yes, I made a mistake and admitted it. But you can't do that. The Euler-Binet formulae deal with Fibonacci numbers. They have zero connection with this problem. Maybe what you meant was the Stanford-Binet formulae?

You don't belong on this page. You're not smart enough.

Sep-20-17  john barleycorn: <al wazir: <john barleycorn>: You don't have a proof. You don't even have a clue about a proof. You just fake it. ...

You don't belong on this page. You're not smart enough.>

wow. that is all what you got in reply?

Maybe, some members here think differently. Don't know.

Auf Wiedersehen....or better not.

Sep-20-17
Premium Chessgames Member
  al wazir: <john barleycorn: Furthermore, you apparently do not have a clue how the Euler/Binet formulae were derived.

So, here is a free lesson for you:

Treating the equation

a^3 + b^3 = c^3 + d^3

they put A = a + b, B = a - b,
C = c + d, and D = c - d which gives
A*(A^2 + 3*B^2) = C*(C^2 + 3*D^2).>

NONE of the articles on the Euler-Binet (properly, Binet's) formula or the Fibonacci numbers that I consulted make use of that equation. You may be confusing it with Euler's treatment of the n=3 case of Fermat's theorem, which I modeled my proof on, or (less plausibly) with Lagrange's identity, which is a special case of the *Cauchy-Binet* identity. (I looked it up in Weisstein.)

Thank you for providing a step by step exposition of your "proof." It is still equivalent -- as I said earlier -- to arguing that

f(f^2 + 3g^2) = f'(f'^2 + 3g'2)

implies f = f' and g = g'. I gave several counterexamples.

You say that your explanation is "lucid enough for a second grader to understand." Alas, when I was in elementary school I went directly from first grade to third, skipping second grade. That's probably why I still don't understand.

Sep-20-17  johnlspouge: < <al wazir> wrote: You say that your explanation is "lucid enough for a second grader to understand." Alas, when I was in elementary school I went directly from first grade to third, skipping second grade. >

And alas, another thing we have in common.

They must have taught the social graces in grade two.

Sep-20-17
Premium Chessgames Member
  FSR: <johnlspouge> I skipped third grade. (My first-grade teacher didn't like me.)
Sep-20-17  john barleycorn: <al wazir: ...

NONE of the articles on the Euler-Binet (properly, Binet's) formula or the Fibonacci numbers that I consulted make use of that equation....>

Typical for your reading problems. I wrote Euler/Binet not Euler-Binet to avoid confusions. It did not work in your case, though. My apologies. ("the complete solution was found by Euler and simplified by Binet" as per 5th edition of "An Introduction to the Theory of Numbers",by Hardy and Wright (p. 199)

Please note, that I also wrote (and you may not have read it):

<Since you learned that so early in your life you may have missed that

(a+b)*((a+b)^2 + 3*(a-b)^2) = (2*c)^3

allows for the conclusion a+b = 2*c.

...

a+b > 2*c and a+b < 2*c are impossible which leaves a+b = 2*c which necessarily gives a=b. >

Since you skipped grade 2 let me show you (a,b,c denote positive integers):

1) a+b>2c =>

(a+b)((a+b)^2+3(a-b)^2)>(a+b)^3>(2c)^3
if a≠b. If a=b we have (a+b)^3>(2c)^3 right away.

Are you still with me <al wazir>? yes? good!

2. a+b =2c gives

(a+b)((a+b)^2+3(a-b)^2)=(2c)^3+(2c)3(a-b)^2=(2c)^- 3 ergo (2c)3(a-b)^2=0 and a=b

Piece of cake, isn't it?

3. a+b<2c
(without loss of generality we assume a<b. a=b is trivial and if b<a you know what to do <al wazir>, don't you?

a) a<c and b<c
then a^3+b^3<2b^3<2c^3

b) a<c<b
That is left as an exercise for advanced second graders or average junior high school students.

Sep-20-17  john barleycorn: <FSR: <johnlspouge> I skipped third grade. (My first-grade teacher didn't like me.)>

hahaha. Did you tell him that you are going to be a lawyer?

Jump to page #   (enter # from 1 to 94)
search thread:   
< Earlier Kibitzing  · PAGE 20 OF 94 ·  Later Kibitzing>

NOTE: Create an account today to post replies and access other powerful features which are available only to registered users. Becoming a member is free, anonymous, and takes less than 1 minute! If you already have a username, then simply login login under your username now to join the discussion.

Please observe our posting guidelines:

  1. No obscene, racist, sexist, or profane language.
  2. No spamming, advertising, duplicate, or gibberish posts.
  3. No vitriolic or systematic personal attacks against other members.
  4. Nothing in violation of United States law.
  5. No cyberstalking or malicious posting of negative or private information (doxing/doxxing) of members.
  6. No trolling.
  7. The use of "sock puppet" accounts to circumvent disciplinary action taken by moderators, create a false impression of consensus or support, or stage conversations, is prohibited.
  8. Do not degrade Chessgames or any of it's staff/volunteers.

Please try to maintain a semblance of civility at all times.

Blow the Whistle

See something that violates our rules? Blow the whistle and inform a moderator.


NOTE: Please keep all discussion on-topic. This forum is for this specific player only. To discuss chess or this site in general, visit the Kibitzer's Café.

Messages posted by Chessgames members do not necessarily represent the views of Chessgames.com, its employees, or sponsors.
All moderator actions taken are ultimately at the sole discretion of the administration.

Spot an error? Please suggest your correction and help us eliminate database mistakes!
Home | About | Login | Logout | F.A.Q. | Profile | Preferences | Premium Membership | Kibitzer's Café | Biographer's Bistro | New Kibitzing | Chessforums | Tournament Index | Player Directory | Notable Games | World Chess Championships | Opening Explorer | Guess the Move | Game Collections | ChessBookie Game | Chessgames Challenge | Store | Privacy Notice | Contact Us

Copyright 2001-2025, Chessgames Services LLC