Reputation
3,460
Top tag
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
18 29
Newest
 Nice Answer
Impact
~63k people reached

2d
comment Solving the recurrence $A_n = \sum_{k=1}^{n} 2^{k+1} A_{n-k}$
I wish Martin had asked this a few days earlier. I just assigned some similar problems to my linear algebra students and this one actually is much nicer than the artificial ones I came up with.
2d
revised Solving the recurrence $A_n = \sum_{k=1}^{n} 2^{k+1} A_{n-k}$
added 15 characters in body
2d
answered Solving the recurrence $A_n = \sum_{k=1}^{n} 2^{k+1} A_{n-k}$
Jan
31
awarded  Nice Answer
Jan
11
awarded  Guru
Jan
10
comment What's an example of an infinitesimal?
@CarlMummert please see this MO question to understand user72694's comment : mathoverflow.net/questions/227945/…
Dec
16
awarded  Nice Answer
Jul
20
awarded  Yearling
May
3
awarded  Good Answer
Feb
11
awarded  Necromancer
Dec
19
awarded  Constituent
Dec
10
awarded  Caucus
Oct
5
awarded  Nice Answer
Jul
20
awarded  Yearling
Jul
7
awarded  Nice Answer
Mar
8
comment Are there statements that are undecidable but not provably undecidable
@JDH's objection is correct but there is more. The implicit assumption is actually that ZFC+Con(ZFC) is $\Sigma^0_1$-sound: that this theory does not prove any false $\Sigma^0_1$-statement. If ZFC+Con(ZFC) is not $\Sigma^0_1$-sound then there is a Turing machine $M$ such that ZFC + Con(ZFC) proves that "$M$ halts" but $M$ doesn't actually halt...
Dec
23
comment Problems with introducing ordered pairs axiomatically
Andrej, this doesn't answer the question as posed. The OP is asking about a global pairing function, not about the existence of products, which only gives local pairing functions.
Dec
23
answered Problems with introducing ordered pairs axiomatically
Nov
22
awarded  Nice Answer
Aug
26
comment Special subgroup of a group of order $n$
@RobertM: When in doubt, flag for moderator attention and explain what you want to do. There are mechanisms set up to transfer questions from one site to another.