Question

please write a proof: There exists a minimum value of k ∈ N such that for...

please write a proof:

There exists a minimum value of k ∈ N such that for every positive integer n ≥ k, ∃x, y ∈ N ∪ {0} such that n = 4x + 7y.

Homework Answers

Answer #1

We will prove that for any , there exist such that .

So for it can be written as of the form for some .

Now for any natural numbers which is greater than 16 can be written as of the forn or .

As   it can be written as of the form for some so   and   also can be written as of the form   for some .

Hence there exist a minimum value such that for every positive integer , such that .

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Discrete Math 6. Prove that for all positive integer n, there exists an even positive integer...
Discrete Math 6. Prove that for all positive integer n, there exists an even positive integer k such that n < k + 3 ≤ n + 2 . (You can use that facts without proof that even plus even is even or/and even plus odd is odd.)
Prove that for every positive integer n, there exists an irreducible polynomial of degree n in...
Prove that for every positive integer n, there exists an irreducible polynomial of degree n in Q[x].
Disprove (using any proof method) For every positive integer n, the integer n n−1 is even
Disprove (using any proof method) For every positive integer n, the integer n n−1 is even
Let A be an n×n matrix. If there exists k > n such that A^k =0,then...
Let A be an n×n matrix. If there exists k > n such that A^k =0,then (a) prove that In − A is nonsingular, where In is the n × n identity matrix; (b) show that there exists r ≤ n such that A^r= 0.
You’re the grader. To each “Proof”, assign one of the following grades: • A (correct), if...
You’re the grader. To each “Proof”, assign one of the following grades: • A (correct), if the claim and proof are correct, even if the proof is not the simplest, or the proof you would have given. • C (partially correct), if the claim is correct and the proof is largely a correct claim, but contains one or two incorrect statements or justications. • F (failure), if the claim is incorrect, the main idea of the proof is incorrect, or...
Prove that for every positive integer n, there exists a multiple of n that has for...
Prove that for every positive integer n, there exists a multiple of n that has for its digits only 0s and 1s.
PLEASE ANSWER EVERYTHING  IN DETAIL.... THANK YOU! Find the mistake in the proof - integer division. Theorem:...
PLEASE ANSWER EVERYTHING  IN DETAIL.... THANK YOU! Find the mistake in the proof - integer division. Theorem: If w, x, y, z are integers where w divides x and y divides z, then wy divides xz. For each "proof" of the theorem, explain where the proof uses invalid reasoning or skips essential steps. (a)Proof. Since, by assumption, w divides x, then x = kw for some integer k. Since, by assumption, y divides z, then z = ky for some integer...
Prove that if for epsilon >0 there exists a positive integer n such that for all...
Prove that if for epsilon >0 there exists a positive integer n such that for all n>N we have p_n is an element of (x+(-epsilon),x+epsilon) then p_1,p_2, ... p_n converges to x.
(a) Prove that if y = 4k for k ≥ 1, then there exists a primitive...
(a) Prove that if y = 4k for k ≥ 1, then there exists a primitive Pythagorean triple (x, y, z) containing y. (b) Prove that if x = 2k+1 is any odd positive integer greater than 1, then there exists a primitive Pythagorean triple (x, y, z) containing x. (c) Find primitive Pythagorean triples (x, y, z) for each of z = 25, 65, 85. Then show that there is no primitive Pythagorean triple (x, y, z) with z...
In this task, you will write a proof to analyze the limit of a sequence. ASSUMPTIONS...
In this task, you will write a proof to analyze the limit of a sequence. ASSUMPTIONS Definition: A sequence {an} for n = 1 to ∞ converges to a real number A if and only if for each ε > 0 there is a positive integer N such that for all n ≥ N, |an – A| < ε . Let P be 6. and Let Q be 24. Define your sequence to be an = 4 + 1/(Pn +...