Purchase Solution

Algebra : Remainders

Not what you're looking for?

Ask Custom Question

What is the remainder when the product of one hundred 5's is divided by 7?

Please be detailed in your response.

Purchase this Solution
Solution Summary

The remainder when the product of one hundred 5's is divided by 7 is found.

Solution Preview

The product of 100 5's is 5^100.
In doing this problem the important thing is to reduce
5^100.
decrease the power
find the nearest multiple of 7
reduce by binomial ...

Purchase this Solution
Free BrainMass Quizzes
Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Probability Quiz

Some questions on probability

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

View More Free Quizzes
Related BrainMass Solutions

  • Algebra : Word Problem - Remainders

    8454 Algebra : Word Problem - Remainders A large purse is full of coins. If you count them by 13's, 23's, or 31's, there will be one left over. If you count them by 73's there will be none left over. How many coins are there in the purse?

  • Assorted Algebra - Inequalities, Remainders, Signs etc.

    543958 Assorted Algebra - Inequalities, Remainders, Signs etc. Please find my algebra questions in the file attached. They are mostly on inequalities, remainder theorem and Descartes' rule of signs among other topics. 1.

  • Division of Expressions for Quotients and Remainders

    37639 Division of Expressions for Quotients and Remainders Find the quotient and remainder x^3 - 9x^2 + 3x - 6 divided by x + 1 See attached Find the quotient and remainder x3 + x2 ________ -10x2 +

  • Remainders of Euclidean Algorithms

    111793 Remainders of Euclidean Algorithms Let b = r_0, r_1, r_2, ... be the successive remainders in the Euclidean Algorithm applied to a and b. Show that every 2 steps reduces the remainder by at least one half.

  • Simplifying Expressions

    The quotient and remainders are determined.

  • Algebra : Simplifying Expressions and Solving Equations

    Use the Remainder Theorem to determine the remainders ( do not divide).

  • Application of Chinese Remainder Theorem (II)

    23512 Application of Chinese Remainder Theorem (II) Find the least positive integer that yields the remainders 1,3 and 5 when divided by 5,7 and 9 respectively.

  • Proof using The Euler Function and Fermat's Theorem

    Proof The proof is completely analogous to that of the Fermat's Theorem except that instead of the set of non-negative remainders {1,2,...,m-1} we now consider the set {m1,m2,...,m (m)} of the remainders of division by m coprime to m.

  • GCD, Mods and Remainders

    GCD, Mods and Remainders are investigated. The solution is detailed and well presented. The response was given a rating of "5/5" by the student who originally posted the question.

View More Related Solutions