Purchase Solution

Prove A Variation of Fermat's Theorem

Not what you're looking for?

Ask Custom Question

There always exists a real number n such that a^n = b^n + c^n , where a, b and c are any integers.

The problem is not Fermat's Last Theorem, but a variation of it with real exponents.

Attachments
Purchase this Solution
Solution Summary

It is shown that there always exists a real number n such that a^n = b^n + c^n , where a, b and c are any integers.

Solution Preview

I would be grateful to anyone able to show that there always exists a *real* number n such that

a^n = b^n + c^n , where a, b and c are any integers.

*****************************************************

As long as you don't require n to be an integer, this is fairly straightforward.

We assume that a, b, and c are *positive* or at minimum *non-negative* integers -- if they are negative you run into serious problems with real exponents because the even roots are not defined, so the decimal real roots are sometimes defined and sometimes, not, NOT a function you want to play with.

For b and c fixed positive integers, b^n + c^n is a *continuous* function of n, with range
0< b^n + c^n < infinity
(A continuous ...

Purchase this Solution
Free BrainMass Quizzes
Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

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

Graphs and Functions

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

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

View More Free Quizzes
Related BrainMass Solutions

  • Fermat's Last Theorem Variation

    41535 Fermat's Last Theorem Variation The attached question is a variation on Fermat's Last Theorem.

  • Fermat's Little theorem

    346478 Using Fermat's Little Theorem Please DO NOT USE Euler's function. You can only use Fermat's Little theorem if needed.

  • Prime proofs

    101499 Fermat and Wilson's Theorem 1. If and are distinct primes prove that for any integer a, Use Fermat's theorem 2. Show that if and are both primes, then 4[ (mod Use Wilson's theorem. 3. Let be an odd prime.

  • Combinatorial and Computational Number Theory

    (n,p) = 1 ==> p is not a divisor of n and n is not a divisor of p Hence from (A), pnp-1 -1 (2) Prove that if 3 is not a divisor of n, then 3n2 -1 Solution :- We have from Fermat's Little Theorem,

  • Number Theory, Fermat's Theorm

    Prove that 24|p^2-q^2" is given using Fermat's Theorem in such a way that the students can easily understand and use the method explained for other problems also.

  • Proof using The Euler Function and Fermat's Theorem

    Prove or disprove: If m|n, then . ........................(A) Euler's Theorem Let a and m be coprime. Then a (m) = 1 (mod m).

  • Ideals and Factor Rings : Annihilators

    An annihilator is identified and Fermat's theorem is used.

  • Find all solutions of x^16 = 1 Mod 19

    First we recall Fermat's little theorem: For every element x not equal to zero we have that: x^(p-1) = 1 A simple sketch of a proof goes as follows. Consider the product of all the nonzero elements S = 1*2*3*...

  • Fermat's little theorem described

    Explain, using Fermat's little theorem, the result that states when p is a prime number other than 2 or 5, the entire decimal of 1/p repeats, instead of only part of it.

View More Related Solutions