Prove Sum of 5s and 7s for n > 23

  • Thread starter Thread starter ipitydatfu
  • Start date Start date
  • Tags Tags
    Induction
AI Thread Summary
Any number greater than 23 can be expressed as a sum of 5's and/or 7's, as demonstrated by specific examples for numbers 24 through 34. The pattern established shows that these numbers can be represented in the form n = 5a + 7b, where a and b are non-negative integers. The discussion suggests that proving this for 24 to 28 allows for a generalization to all subsequent numbers by adding multiples of 5. This approach confirms the validity of the statement for all integers greater than 23. The conclusion emphasizes that the established pattern provides a solid basis for the proof.
ipitydatfu
Messages
13
Reaction score
0
Question Details:
show that any number greater than 23 can be written as a sum of 5's and/or 7's


attempt:
24: 7 7 5 5
25: 5 5 5 5 5
26: 7 7 7 5
27: 7 5 5 5 5
28: 7 7 7 7
29: 7 7 5 5 5
30: 5 5 5 5 5 5
31: 7 7 7 5 5
32: 7 5 5 5 5 5
33: 7 7 7 7 5
34: 7 7 5 5 5 5

from this, i see that this follows a pattern:
n = f(a,b) = 5a + 7b

for n> 23


but how do i go about to prove this for all values?
 
Physics news on Phys.org
Could you show that it was true for 24,25,26,27,28 then just say that every number beyond these can be expressed as x + 5n, where x is one of 24,25,26,27,28 and n is a natural number?
 
lol yeah. i kinda figured it out similar to that way after taking a long nap. thanks for the response though!
 
I'm taking a look at intuitionistic propositional logic (IPL). Basically it exclude Double Negation Elimination (DNE) from the set of axiom schemas replacing it with Ex falso quodlibet: ⊥ → p for any proposition p (including both atomic and composite propositions). In IPL, for instance, the Law of Excluded Middle (LEM) p ∨ ¬p is no longer a theorem. My question: aside from the logic formal perspective, is IPL supposed to model/address some specific "kind of world" ? Thanks.
I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
Back
Top