bio | website | bu.edu/sed/about-us/faculty/… |
---|---|---|
location | Boston University, SED | |
age | 28 | |
visits | member for | 2 years, 9 months |
seen | 5 hours ago | |
stats | profile views | 2,872 |
Postdoctoral Fellow, Mathematics Education, Boston University SED.
Ph.D., Mathematics Education, Columbia University. 2014. NSFGRFP.
Dissertation: Conceptions of Creativity in Elementary School Mathematical Problem Posing. (Relevant MESE post here.)
M.Phil., Mathematics Education, Columbia University. 2014.
Fulbright Grant, Mathematics/Mathematics Education, Nanjing Normal University (南京师范大学). 2008-2009.
Research Topic: High School Mathematics Teacher Training in China.
B.A., Mathematics, Amherst College. 2008. Honors Program.
Undergraduate Thesis: On a Theorem of Dwork. (p-adic proof of the rationality part of the Weil Conjectures; relevant MSE post here.)
Have you solved any of my puzzles? If so, send me an email!
Email: bdickman[at]bu。edu
Jan 28 |
comment |
For a mathematician that English is not the native language, does he/she think in english or graph or native language?
I do not think your question will fit well here at MO, but you might take a look at MESE 1794; in particular, the comments in the linked response from More precisely, Hadamard writes... onward. (I would highly recommend Hadamard's 1945 book.) |
Jan 25 |
comment |
How to calculate the infinite sum of this double series?
See also: math.stackexchange.com/q/1117583/37122 |
Jan 16 |
comment |
Extending an assignment property from Q to R (or C)
(See also: A Problem That Bears Repeating: 11002 in the AMM.) |
Jan 14 |
comment |
What mathematical models can analyze and optimize systems based on gossip?
The first thing that comes to mind for me is a note about a secondary school lesson plan; on the off chance that it is of any use, here is a link to the page 8 excerpt from this lesson in COMAP's Mathematical Modeling Handbook. |
Jan 10 |
awarded | Pundit |
Jan 9 |
comment |
Cube-free infinite binary words
@JoelReyesNoche Ah, I see now that $x$ can be one or more letters; my erroneous count is for the restriction $|x| = 1$. Thanks for the clarification. |
Jan 9 |
comment |
Cube-free infinite binary words
@JoelReyesNoche and OP: w.r.t. (3) - Isn't the number of finite binary cfw of length $n$ just twice the $(n+1)$st Fibonacci number? |
Jan 3 |
comment |
Are there any serious investigations of whether “mathematicians do their best work when they're young”?
Simonton's 1997 article is available here. |
Jan 1 |
comment |
Who first introduced the functional definition of symmetry?
I had wondered specifically if there was anything of value in foot-note 3 of p. 163: The source is in German (Wulff, 1897) but I could not track down that particular reference... You are right that it (and other sources) are mentioned in Hilton (1903); I had not searched through Hilton for that reference, though it makes sense reading Rogers' acknowledgement at the end of the paper. (In any event: your answer here is very nice!) |
Dec 31 |
comment |
Who first introduced the functional definition of symmetry?
You might check: Rogers, A. F. (1926). A mathematical study of crystal symmetry. Proceedings of the American Academy of Arts and Sciences (pp. 161-203). American Academy of Arts and Sciences. (In particular, "Symmetry Operations" beginning on p. 162 and the references contained therein.) |
Dec 29 |
awarded | Popular Question |
Dec 28 |
comment |
Mod sequences that seem to become constant; and the number 316
@PaceNielsen I think this is the same as your latter observation, just slightly restated: Even in JO'R's original problem, assuming randomness, the chance of getting a number to appear for a second time in a row is $1/n$ for step $n$ (really beginning at step two, so your product counter would start at $n=2$). As István observes, a number appearing twice in a row is sufficient for the sequence to become constant. So the probability of no repeats is $\prod_{n=2}^{\infty} (1-1/n) \rightarrow 0$. There would need to be a major conspiracy for there never to be any repetition... |
Dec 27 |
comment |
Mod sequences that seem to become constant; and the number 316
Your $a_n$ are each computed $\mod n$; does the $A(s)$ sequence still appear to become constant if you use a different increasing sequence for each $a_n$, e.g., $\mod p_n$ where $p_n:=$ the $n$th prime? (If these sequences also become constant: How do they compare to the ones computed here?) The same could be asked $\mod n^2$ etc... |
Dec 24 |
comment |
Continuity of central point operation
What is the difference between absolutely central and strongly central as defined here? (Maybe the latter refers to non-empty finite subsets?) |
Dec 24 |
comment |
Ruth-Aaron triples, etc
JO'R: Apparently only two triples are known. Besides what you list in your post, the other known one is: 6913943284, 6913943285, 6913943286 (source). That link checks up to at least 532,320,600,592 (I had to "stop" the page because it was very slow to load!) so I think you would need to look pretty far to find a quadruple. |
Dec 24 |
comment |
Ruth-Aaron triples, etc
@WillJagy Actually, Erdos is known (in a piece of mathematical folklore) as having met Aaron and signed a baseball together, as reported by Pomerance (mentioned in my answer below). See here: "Carl Pomerance (now at Dartmouth College), who had a long and fruitful collaboration with Paul, reports having a baseball autographed by both of them, occasioned by their both having received honorary degrees at Emory University in 1995" in connection with the Ruth-Aaron numbers asked about. |
Dec 23 |
answered | Ruth-Aaron triples, etc |
Dec 23 |
comment |
How prove this polynomial inequality from a book
Not sure why there is a bounty when Lucia already gave an answer; perhaps another place to look would be Goldman's The Queen of Mathematics in which you will find the same result. See Chapter 22 pp. 461-462 (here) in which the result is discussed as a special case of Minkowski's proof of a conjecture due to Kronecker. |
Dec 16 |
comment |
Producing finite objects by forcing!
w.r.t. @AndreasBlass' comment ("As for making 'genuine' priority arguments look like forcing, I think there have been many attempts over the years, but I haven't really learned about any of them") I asked a related question about the priority method and forcing some time ago: mathoverflow.net/q/124011/22971 |
Dec 14 |
comment |
Good Pre-Calculus book?
As yet another alternative: matheducators.stackexchange.com is a stackexchange site specifically for questions about mathematics education. |