Knoxville, TN


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.

comment Find the sum of the series $1+\frac{1}{3}\cdot\frac{1}{4}+\frac{1}{5}\cdot\frac{1}{4^2}+\frac{1}{7}\cdot\frac{1}{4^3}+\cdots$
@PeterWoolfitt: Indeed if you multiply by $\frac{1}{2}$, this is $\tanh^{-1} \frac{1}{2}$. Please feel free to post an Answer.
comment Direct sum of two points on an elliptic curve
I recommend Silverman and Tate's book Rational Points on Elliptic Curves, which gives a nice foundation for such calculations and important additional topics (such as the relationship to primality testing and factorization).
reviewed Close Approximation of uniform distribution.
reviewed Close Urn draw probabilities
comment Find maximal clique in a complete graph with $n$ vertices, where each vertex is colored with $k$ colors.
Per @Arthur 's comment, it would otherwise seem the "graph" on $n$ vertices plays no role in the problem formulation.
comment Knowledge representation in intelligent system using Resource Description Framework and Predicate logic?
I'm going to vote to close as off-topic, since the mathematical context is less clear than one for software development, but this also seems too broad.
comment Where is this formula about cyclotomic polynomials proved?
How should the index of the product be interpreted, e.g. when $n=3$?
revised How can I maximize the time the "high" lasts?
extended discussion to an approach of divided doses and low-carb diet
answered How can I maximize the time the "high" lasts?
comment Can there be a lottery of the natural numbers?
No, there is no way around it. There is no uniform (probability) measure on a countably infinite set. When one needs something like this, a typical approach is to obtain a result for a uniform probability on a finite set $\{1,\ldots, N\}$ and then pass to a limit as $N \to \infty$, depending on what actually is to be shown. For example, one might ask: what is the probability that "two natural numbers chosen at random" are coprime? A sensible interpretation of this question can be made using the limit approach, although strictly speaking there is no way to uniformly select a natural number.
comment Support function relation
Normally we define the support of a function to be the closure of what you said (points where function $f$ is nonzero).
answered How many 40-multisets
comment How many 40-multisets
Okay, I will assume the "at most ten letters" includes any repeated letters counted according to their multiplicity..
reviewed Reopen How to prove k-colorablity of G by considering $G$ x $K_k$?
comment Showing the determinant is non-zero
I have rolled back your last edit, which removed all but the first line of your Question. Perhaps this was unintended self-defacement. If you want to remove your post, you can self-delete it as long as there are no up-voted or accepted answers. Look for the delete link by hovering your mouse under the body of the Question, near the "edit" link.
reviewed Close ROC of complex numbers
reviewed Reopen Can monadic second-order logic characterize finiteness?
reviewed Close an example for computing conditional independent
reviewed Close Prove subspace of finite dimensional vector space is finite dimensional
reviewed Close Combinations and permutations (Evergreen)
1 2 3 4 5