hardmath

Knoxville, TN

uclue.com

Age: 62

Enjoys programming in Prolog.

Richard O'Keefe: "Prolog is an efficient programming language because it is a very stupid theorem prover."

When I cross the street, I look both ways: up and dn.

1h
comment Basic question about finite fields and characteristic
Yes, it follows from the distributivity of multiplication over addition in $D$, but since we have repeated addition (aka "multiplication" by $s$), there is an element of induction in proving this.
1h
answered Basic question about finite fields and characteristic
2h
reviewed Approve suggested edit on Merging duplicated rows in sql table
2h
reviewed Reject suggested edit on How is Appgyver Steroids faster than PhoneGap?
3h
comment Speeding up integer division if only certain bits in result are needed
Knuth (AOCP vol. II, Semi-numerical Algorithms) may have some material on the question of whether it is possible to derive the low-order half of an arithmetic operation with any better method than truncating the full result.
6h
comment Has this puzzle got a name?
As you have framed the Question, it is not much of a puzzle. You assume the samples $A$ and $B$ are independent, but in fact $A$ is known after the first card is turned over. If the distribution of $B$ is known (you said "suppose $N(0,1)$ for simplicity"), then there is no "strategy" to decide whether $A$ is larger than $B$, only a computation from the known distribution as to the probability that $B \lt A$.
10h
comment Closed form of sum with binomial
Have you tried some small values of $n $ for inspiration?
10h
comment methods of constructing a matrix from its null space span
Perhaps this is what you yourself are noting in the last sentence, but the null space does not fully determine the matrix.
13h
comment Queuing Theory: Maths, CS, or Statistics?
I like your question and suspect that Math.SE is the best fit for an analytic solution. CrossValidated does seem to be pretty broaded in their coverage of topics, not just bread-and-butter statistics, so I would search there for queuing theory posts.
14h
comment procedure doesn't work for evey pattern in prolog
Note that you have mistyped a period . where a comma , belongs in your second code block, between R = 0 and R = R+1. As CommuSoft points out, the latter statement will not do anything useful, or at least will not do what you hoped here.
14h
comment Prolog Recursion with lists
It's hard to guess where your understanding of recursion begins. It may be daunting to understand "recursion in [P]rolog", but how about your comfort with recursion in other languages, such as C? Recursion is of special importance in writing Prolog code, but broadly asking "how to approach a question like this" is not a good fit for this Community. See [ask].
23h
reviewed Leave Open Proving question on sets
23h
reviewed Close Is there a nice meaning to the geometric triple product?
23h
reviewed Leave Open How to prove $\sinh^{-1}x=\ln\left(x+\sqrt{x^2+1}\right)$
23h
reviewed Close Applications of math
23h
reviewed Leave Open $\operatorname{Ext}$ and projective dim
23h
reviewed Leave Closed Mastermind Probability Distribution
1d
reviewed Approve suggested edit on Definition of limit point
1d
comment Given two R3 linear maps, calculate the composite function and represent as a matrix
I'm voting to close this question as off-topic because it is math-only, no programming involved.
1d
comment Given two R3 linear maps, calculate the composite function and represent as a matrix
This seems off-topic for StackOverflow, as it is purely a math question (see Math.SE). In any case @JayKominek is right. The composite function f o g means first do g, then do f, and if the matrix representation of f is A and that of g is B, then AB represents f o g.
1 2 3 4 5