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 21 OF 94 ·  Later Kibitzing>
Sep-20-17  Big Pawn: <JBC> is schooling <the charlatan> in a most humiliating way. Someone needs to tell <al-ways boring> that he can't fool the real mathematicians and engineers here with his sophistry.

Bada BOOM, bada BING!

Sep-20-17
Premium Chessgames Member
  FSR: <john barleycorn> Her. No, I don't think I had any idea what a lawyer was at the time.
Sep-20-17  johnlspouge: <FSR> wrote: <johnlspouge> I skipped third grade. (My first-grade teacher didn't like me.) >

Maybe your first-grade teacher recognized that you already lacked social graces and had no need to skip grade two :)

Sep-20-17
Premium Chessgames Member
  al wazir: <john barleycorn>: So maybe you DO have a proof in mind after all! Mirabile dictu!

But it's not complete yet. Your last case, a+b < 2c, a < c < b (the one you left for me to do), is the only one that isn't obvious.

If I substitute a = 1, b = 4, and c = 3, which satisfy those two inequalities, in

(a+b)[(a+b)^2 + 3 (a-b)^2] :: (2c)^3,

I get 5(5^2 +3·3^2) = 260 for the left member and 6^3 = 216 for the right one. The expression on the left has a greater numerical value than the one on the right.

If I substitute a = 1, b = 8, and c = 7, which also satisfy both inequalities, I get 9(9^2 + 3·7^2) = 2052 for the left member and 14^3 = 2744 for the right. Now the expression on the right is numerically greater.

(Of course it's obvious that neither triad of numbers satisfies the equation a^3 + b^3 = 2c^3. There are no solutions, as *I* have already proved.)

But what this numerical example shows is that those inequalities are *not* inconsistent with the equation. In other words, if there *were* any integer solutions a, b, c (though we know that there aren't), they would satisfy those inequalities.

So I'll have to ask you to complete the proof for me. I'm not up to it.

Wouldn't it have saved both of us some time if you had explained it fully in the first place?

Sep-20-17  john barleycorn: <<al wazir: <john barleycorn>: So maybe you DO have a proof in mind after all! Mirabile dictu!

But it's not complete yet. Your last case, a+b < 2c, a < c < b (the one you left for me to do), is the only one that isn't obvious. ...> >

Yes, but it is junior high school stuff that you *mastered*. Remember your arrogant response to me? This is the return ticket. Do it or admit your incompetence.

<If I substitute a = 1, b = 4, and c = 3, which satisfy those two inequalities, in

(a+b)[(a+b)^2 + 3 (a-b)^2] :: (2c)^3,

I get 5(5^2 +3·3^2) = 260 for the left member and 6^3 = 216 for the right one. The expression on the left has a greater numerical value than the one on the right.

If I substitute a = 1, b = 8, and c = 7, which also satisfy both inequalities, I get 9(9^2 + 3·7^2) = 2052 for the left member and 14^3 = 2744 for the right. Now the expression on the right is numerically greater.>

Oh my, I claimed that equality does not hold. Your examples (like those *counterexamples* you gave before in another situation) show that you do not understand plain English or the problem. You always get lost in non-relevant and selfconstructed details losing sight of the problem and what was said.

<So I'll have to ask you to complete the proof for me. I'm not up to it.>

Hey, are you admitting that you are not able to do junior high calculations? Take your time.

<Wouldn't it have saved both of us some time if you had explained it fully in the first place?>

I did. Ok, when I gave the hint I assumed that most mathematically inclined people would see it. I was overestimating your abilities. After that we have your permanent and seemingly deliberate "misunderstandings" of basics.

Sorry, you are a joke. I am not going to waste my time with you, any longer.

Sep-20-17
Premium Chessgames Member
  al wazir: <john barleycorn: I am not going to waste my time with you, any longer.>

You've spent all that time proving how smart you are, and you're not going to finish the job?

I guess the proposition you're trying to prove isn't true.

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

I guess the proposition you're trying to prove isn't true.>

hahaha. up to you to figure it out, boy.

Sep-20-17
Premium Chessgames Member
  al wazir: <john barleycorn>: I meant the proposition about how smart you are. You haven't proved it.

I posted a *complete proof* that there are no nontrivial integer solutions of a^3 + b^3 = 2c^3.

You haven't. QED.

Sep-20-17  john barleycorn: <al wazir: <john barleycorn>: I meant the proposition about how smart you are. ...>

Oh my, <princeton joker>. I never made that proposition. However, I proved what a hot air balloon you are. Anyway, we should put this into the "memorable quotes":

<<al wazir: ...
You don't belong on this page. You're not smart enough.>

And now *enough is enough*. Come back with a proof in the case a<c<b or get lost.

Sep-20-17
Premium Chessgames Member
  FSR: <johnlspouge> That's entirely possible.
Sep-22-17  john barleycorn: Another elementary proof that a^3 + b^3 =2*c^3 has no non-trivial solution in the positive integers.

Let a ≠ b,

a^3 + b^3 = 2*c^3 <=> (is equivalent to)

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

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

(a+b) =(2*c)*(p^2 + 3*q^2)

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

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

thus be have:
1.) a+b = 2*c*(p^2 + 3*q^2)
2.) (a+b)*p + 3*q*(a-b) = 2*c
3.) (a-b)*p = q*(a+b)

substituting 2.) in 1.) gives

(a+b)*(1-p*(p^2 + 3*q^2) =
(a-b)*(3*q*(p^2 + 3*q^2)

For p=1 and q=0 both sides are 0.
and 2.) gives a+b = 2*c

For all q ≠ 0 we have p≠ 0 because of 3.) and the assumptions about a and b.

Thus a-b=(q/p)*(a+b)

Substituting this in 2.) gives with 1.)
(a+b)((p^2+3*q^2)/p) = 2*c*((p^2+3*q^2)^2)/p = 2*c

or

(p^2+3*q^2)^2 = p which is impossible.

Sep-22-17  ughaibu: All this assumes the consistency of number theory.
Sep-22-17  john barleycorn: <ughaibu: All this assumes the consistency of number theory.>

Let's discuss that after <al wazir> has brought up his usual "you did not prove <(p^2+3*q^2)^2 = p which is impossible.>" hahaha

Sep-22-17  john barleycorn: <al wazir> since you did not come up with a proof in the case a<c<b for a+b<2c and keep trompeting that I don't have one here it is sweet, short and simple.

a+b<2c and a+b=2*c*(p^2 + 3*q^2)

with

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

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

implies

p^2+3*q^2<(1/2)

and thus a+b < c which excludes a<c<b.

Sep-22-17
Premium Chessgames Member
  al wazir: <john barleycorn: here it is sweet, short and simple.>

Your "proofs" are still incomplete. As you've defined p and q, you haven't shown that they are integers.

Also,

a+b<2c and a+b=2*c*(p^2 + 3*q^2) imply p^2+3*q^2<1, not p^2+3*q^2<1/2. (I'm sure that's what you meant.) But there is a contradiction only if p and q are integers.

Finally, you may not have noticed that if we set

2u = a + b and 2v = a - b,

which I wrote as Eq. (3) in Louis Stumpers (kibitz #7988), then your equation

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

becomes

u(u^2 + 3v^2) = c^3,

which was my Eq. (4).

In that post I went on to prove that there are no nontrivial integer solutions to a^3 + b^3 = 2c^3, *without* making the assumptions a + b < 2c or a < c < b.

That proof comprehended all of your cases.

Sep-22-17
Premium Chessgames Member
  al wazir: <john barleycorn: 2 is a prime number and since it divides the right side it divides a and as well b.>

That is the very same elementary blunder that I made, for which you rightly criticized me.

If a and b are both odd, then a^3 + b^3 is even. There is no contradiction.

Sep-22-17  john barleycorn: <al wazir: <john barleycorn: here it is sweet, short and simple.>

Your "proofs" are still incomplete. As you've defined p and q, you haven't shown that they are integers. ...>

Another bunch of baloney? p and q can be rationals you genius.

Sep-22-17  john barleycorn: yes, I erased the teaser post
Sep-22-17
Premium Chessgames Member
  al wazir: <john barleycorn>: I see you deleted that howler. Good move.

You can hide but you can't run.

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

Also,

a+b<2c and a+b=2*c*(p^2 + 3*q^2) imply p^2+3*q^2<1, not p^2+3*q^2<1/2. (I'm sure that's what you meant.) But there is a contradiction only if p and q are integers. ...>>>

Shows how little you understand.

If p and q are integers p^2+3q^2 is an integer >1 if q not 0. Which means a+b>2c which is impossible (case 1)

since a+b is a positive integer and
a+b=2*c*(p^2 + 3*q^2) means 1/(p^2+3q^2) is an integer and divisor of 2*c. the smallest divisor is 2 thus (p^2 + 3*q^2)<(1/2)

Sep-22-17
Premium Chessgames Member
  al wazir: <john barleycorn: Another bunch of baloney? p and q can be rationals you genius.>

You need to take some time off.

Suppose p = 3/5 and q = 1/5. Then p^2 + 3q^2 = 12/25 < 1/2. Where is the contradiction?

Sep-22-17  john barleycorn: <al wazir: <john barleycorn: Another bunch of baloney? p and q can be rationals you genius.>

You need to take some time off.

Suppose p = 3/5 and q = 1/5. ...>

I said p and q can be rationals.

I think you should follow your piece of advice and some take time off.

Sep-22-17
Premium Chessgames Member
  al wazir: <john barleycorn: I said p and q can be rationals.> The ratio of two integers is rational, so 3/5 and 1/5 are rational.

You really are spouting garbage.

Sep-22-17  Marmot PFL: <al wazir> reminds me of this old* German perfectionist math teacher I had once. Best I ever did on any of his tests was a B+.

*probably mid-40s, which seemed old to me then

Sep-22-17  john barleycorn: <al wazir: <john barleycorn: I said p and q can be rationals.> The ratio of two integers is rational, so 3/5 and 1/5 are rational.

You really are spouting garbage.>

<al wazir: ...

Your "proofs" are still incomplete. As you've defined p and q, you haven't shown that they are integers. ...>

there is only one case they are integers p=1 and q=0 (by the integers form a subset of rationals, don't you know?) Anyway, the garbage come from you <Your "proofs" are still incomplete. As you've defined p and q, you haven't shown that they are integers>

Now, take a nap and come back with a fresh mind.

Jump to page #   (enter # from 1 to 94)
search thread:   
< Earlier Kibitzing  · PAGE 21 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