Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I'm trying to solve a cryptarithm that must meet all of the following conditions:

one + one = two

seven is prime

nine is a perfect square

More specifically, i'm trying to find the following:

one =

two =

seven =

nine =

Firstly, can someone explain the first condition (one + one = two) and how it fits in with the other conditons? Is this a sort of cryptarithm within a cryptarithm that must also stay true to the other conditions?

Secondly, what approach should I take to logically deduct the solution?

share|cite|improve this question

Presumably, one is meant to assume that each of the letters o, n, e, t, w, s, v, i stands for a digit (maybe even a different digit) so one is a 3-digit number and so on. Now you make a lot of deductions along the lines of these:

The 1st condition tells you $o\le5$, and $o$ is even. The 2nd condition tells you $n$ is $1$, $3$, $7$, or $9$. The 3rd condition tells you $e$ is $1$, $4$, $5$, $6$, or $9$.

Collect enough of these bits of information and you have a chance of figuring out what each letter stands for.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.