Will I fail again
by hashbrown2009, May 8, 2025, 1:54 PM
This post has been edited 2 times. Last edited by hashbrown2009, Yesterday at 1:55 PM
ARML Location
by deduck, May 6, 2025, 4:19 PM
Loading poll details...
UNR -> Nevada
St Anselm -> New Hampshire
PSU -> Pennsylvania
WCU -> North Carolina
Put your USERNAME in the list ONLY IF YOU WANT TO!!!!
I'm going to UNR if anyone wants to meetup!!!
Current List:
St Anselm -> New Hampshire
PSU -> Pennsylvania
WCU -> North Carolina
Put your USERNAME in the list ONLY IF YOU WANT TO!!!!
I'm going to UNR if anyone wants to meetup!!!
Current List:
This post has been edited 11 times. Last edited by deduck, Wednesday at 4:55 PM
MathILy 2025 Decisions Thread
by mysterynotfound, Apr 21, 2025, 3:35 AM
This post has been edited 2 times. Last edited by mysterynotfound, Apr 21, 2025, 4:28 PM
Sad Algebra
by tastymath75025, Apr 18, 2019, 11:00 PM
Find all polynomials 
with real coefficients such that 
holds for all nonzero real numbers 
satisfying 
.
Proposed by Titu Andreescu and Gabriel Dospinescu
with real coefficients such that 
holds for all nonzero real numbers 
satisfying 
.Proposed by Titu Andreescu and Gabriel Dospinescu
This post has been edited 3 times. Last edited by djmathman, Apr 19, 2019, 3:59 PM
Wizard101
by El_Ectric, Apr 20, 2016, 9:30 PM
Integers 
and 
are given, with 
. You play the following game against an evil wizard.
The wizard has
cards; for each 
, there are two cards labeled 
. Initially, the wizard places all cards face down in a row, in unknown order.
You may repeatedly make moves of the following form: you point to any of the cards. The wizard then turns those cards face up. If any two of the cards match, the game is over and you win. Otherwise, you must look away, while the wizard arbitrarily permutes the chosen cards and then turns them back face-down. Then, it is your turn again.
We say this game is winnable if there exist some positive integer
and some strategy that is guaranteed to win in at most moves, no matter how the wizard responds.
For which values of and is the game winnable?
and 
are given, with 
. You play the following game against an evil wizard.The wizard has
cards; for each 
, there are two cards labeled 
. Initially, the wizard places all cards face down in a row, in unknown order.You may repeatedly make moves of the following form: you point to any
of the cards. The wizard then turns those cards face up. If any two of the cards match, the game is over and you win. Otherwise, you must look away, while the wizard arbitrarily permutes the chosen cards and then turns them back face-down. Then, it is your turn again.We say this game is winnable if there exist some positive integer
and some strategy that is guaranteed to win in at most moves, no matter how the wizard responds.For which values of
and is the game winnable?This post has been edited 1 time. Last edited by v_Enhance, Apr 23, 2016, 1:32 PM
Reason: Use proper italics
Reason: Use proper italics
October 2018
April 2018
April 2016
December 2014
October 2014
September 2014
August 2014