I was asked to prove that 5^(2n+1) + 4^(2n+1) is divisible by 9 for all n that are positive integers. I’m not allowed to use modular arithmetic, only proof by induction. I’ve proven my base case and started my inductive step, but can’t find an algebraic truck to get the result I want.

I was asked to prove that 5^(2n+1) + 4^(2n+1) is divisible by 9 for all n that are positive integers. I’m not allowed to use modular arithmetic, only proof by induction. I’ve proven my base case and started my inductive step, but can’t find an algebraic truck to get the result I want.

Algebra and Trigonometry (6th Edition)

6th Edition

ISBN:9780134463216

Author:Robert F. Blitzer

Publisher:Robert F. Blitzer

ChapterP: Prerequisites: Fundamental Concepts Of Algebra

Section: Chapter Questions

Problem 1MCCP: In Exercises 1-25, simplify the given expression or perform the indicated operation (and simplify,...

See similar textbooks

Similar questions

1. Express × (4)* X 3 as a power with a base of 4. (*√16)
x+(x+1)+(x+2)+(x+3)+(x+4)=5x+10 What does this prove about the sum of these natural numbers?
Let a be an integer such that the remainder of dividing a by 17 is 15. What isthe remainder of dividing a^2 + a + 1 by 17? Justify your answer. You are not allowed to use congruences.
Why is prime numbers commnoly used in cryptography? Prime numbers are very rare and hard to find making the key encryption very unique. The pattern of prime numbers are hard to predict, somtimes they appear very closely in proximity with one another, while in other times, we can have 1 million cosecutive numbers without a single prime in them. It is relatively hard and takes a long time to decompose very large numbers into its prime factors, adding difficulty in cracking the encryption. Prime numbers are scary, forcing potential hacker to stay away on any enryption created using prime numbers.
Prove that 2^(27) - 1 is not a prime number.
Can you fully expand (3x + 2)5 with Pascal's Triangle?
Parallel to the line given?...and through the point (3,5)?? I'm not sure what to do.
Solve this problem using mathematical induction. 1. Prove that 3n^2 + 1is divisible by 4 whenever n is an odd number.
Determine using induction all the positive integer values of n for n^3 > 2^n. Prove your answer using mathematical induction. Please read the question. This is NOT asking to prove that all integers satisfy this, it is asking to find the integers that do satisfy it via induction. Please explain every step.
5^14 ( mod 26).
Is 2^39-1 a prime?
Show that sqrt(3) is an irrational number. (And show and use that if 3 divides n^2, then 3 divides n, and use the fact that every natural number n can be written as n = 3k + a for some natural number k and a = {0, 1, 2}.)