on-line programming courses

I am interested in acquiring some rudimentary programming skills. I am
interested in such stuff as (eg) Goldbach numbers - how many ways can
two primes (or two lucky numbers) sum to a given number; or Levy
numbers - how many ways can a prime plus twice a prime sum to a given
odd number? How do I find the (possibly) smallest set of primes such
that all even numbers <= to a given number can be expressed as the sum
of two of these primes? <--I have some info on this latter problem from
John Bowker in which he uses Perl plus clever intuition. I am a
complete jerk when it comes to computers in general, and programming in
particular. Any pointing to on-line sites which are relatively easy to
absorb will be appreciated. If it is pertinent, I have access to
Mathcad 11. Thanks.

.

Relevant Pages

  • Re: approaching a proof
    ... > number is the sum of two primes). ... > probabilistic sense, the limit of our proofs as M goes to infinity ...
    (sci.logic)
  • Re: Some question in prime number!
    ... He didn't say "a sum of two distinct primes", ... every positive integer can be written as a product of primes, ...
    (sci.math)
  • Re: GetNext Pythagorean Triple?
    ... function which will spout out all primes of the form 4n + 1. ... can be expressed in exactly one way as the sum of two squares. ... > criteria to longest leg and shortest leg. ...
    (sci.math)
  • Re: a nice infinite product
    ... is to log them out to a sum ... now expand the ln as a series ... ``Sum of two fourth powers of integers" ... Example 1 (for n a product of 3 primes) is: ...
    (sci.math)
  • A question on "sufficiently large".
    ... large even integer is a sum of two primes and exactly 13 powers ... Or does he mean there exist infinite numbers of such "sufficiently ... large" even ones that satisfy Goldbach Conjecture, ...
    (sci.logic)