Let d,m and n be positive integers with m>1 and m≡ 1 (mod d), let
n= c0+mc1+m2c2+m3c3+…+mrcr
be the base=m expansion of n, and let
f = c0+c1+c2+c3+…+cr
Prove that n is divisible by d if and only if f is divisible by d.
Mathematics Homework Solutions
#65115
Discrete mathematics proof
(See attached file for full problem description)
---
Let d,m and n be positive integers with m>1 and m≡ 1 (mod d), let
n= c0+mc1+m2c2+m3c3+…+mrcr
be the base=m expansion of n, and let
f = c0+c1+c2+c3+…+cr
Prove that n is divisible by d if and only if f is divisible by d.
---
This is a discrete math proof of divisibility.
What is this?
By OTA - Overall OTA Rating
Yupei Xiong, PhD - 4.8/5
Purchase Cost Now
$2.19 CAD (was ~$3.99)
Included in Download
- Plain text response
- Attached file(s):
- 65115.doc
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Prove that 7^n - 6n-1 is divisible by 36 for all positive integers n. - Prove that 7^n - 6n-1 is divisible by 36 for all positive integers n.
- Discrete Math - PROVE THAT 5 * 7^n + 3 * 11^n is divisible by 4 for all integers n >=0
- Discrete mathematics - Proper walk through of following proofs required ( for a better understanding ) --- 1) Prove that if n is an odd integer then n2 = 1 mod 8 2) Prove that 5n+3 is divisible by 4 for all intege ...
- Induction - Prove by induction where n is a positive integer. (The questions are attached).
- A proof and a solution involving a Diophantine equation - Show that the Diophantine equation x^2-y^2=n is solvable in integers if and only if n is odd or n is divisible by 4. When this equation is solvable, find all integer solutions.
