All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
one, two, six, mod alphametics (Posted on 2008-11-30) Difficulty: 3 of 5
Substitute each of the small letters in bold with a different decimal digit from 0 to 9, to satisfy the following system of simultaneous modular alphametic equations:

one ≡ 1 (mod two), and:
one ≡ 1 (mod six), and:
six ≡ 0 (mod two)

where, none of s, o and t is zero.

Note: Try to derive a non computer-assisted solution, although computer program/spreadsheet solutions are welcome.

See The Solution Submitted by K Sengupta    
Rating: 5.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
Solutioncomputer solutionCharlie2008-11-30 21:44:26
SolutionsolutionDej Mar2008-11-30 17:49:52
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information