Subject: Re: Bananas
Date: Thu, 17 Apr 1997 11:44:48 -0400
From: Alexander Bogomolny

Yes, of course.

You are looking for a number k such that 81k+65 is divisible by 8. The simplest way is to use the modulo arithmetic:

81 = 1 (mod 8) and 65 = 1 (mod 8)

which only means that the remainder of division by 8 is 1 in both cases. Your equation is equivalent to

1*k + 1 = 0 (mod 8)

Or

k = -1 (mod 8)

Note that -1 = 7 (mod 8) which gives your result.

Modulo arithmetic is exactly the same except at every stage you substitute the remainder.

Best regards,
Alexander Bogomolny

|Reply| |Up| |Down| |Exchange index| |Contents| |Store|

Copyright © 1996-2012 Alexander Bogomolny

 40614944

A math books store at a unique math study site. Shopping at the store helps maintain the site. Thank you.
Sites for teachers
Sites for parents
Terms of use
Awards
Interactive Activities

CTK Exchange
CTK Wiki Math
CTK Insights - a blog
Math Help
Games & Puzzles
What Is What
Arithmetic
Algebra
Geometry
Probability
Outline Mathematics
Make an Identity
Book Reviews
Stories for Young
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
Visual Illusions
My Logo
Math Poll
Cut The Knot!
MSET99 Talk
Old and nice bookstore
Other Math sites
Front Page
Movie shortcuts
Personal info
Privacy Policy

Guest book
News sites

Recommend this site

Sites for parents

Education & Parenting

Search:
Keywords:

Google
Web CTK
Supported by
3wVentures