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

  • Thread starter ipitydatfu
  • Start date
  • Tags
    Induction
In summary, the conversation discusses how any number greater than 23 can be written as a sum of 5's and/or 7's. The pattern of expressing a number as 5a + 7b is observed and it is noted that this can be proven for all values by showing it is true for 24, 25, 26, 27, and 28.
  • #1
ipitydatfu
14
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
  • #2
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?
 
  • #3
lol yeah. i kinda figured it out similar to that way after taking a long nap. thanks for the response though!
 

What does the statement "Prove Sum of 5s and 7s for n > 23" mean?

The statement is referring to a mathematical proof that shows the sum of all multiples of 5 and 7 for values of n greater than 23 is equal to 0 mod 12.

Why is the value of n restricted to be greater than 23?

This restriction is necessary because values of n less than 23 do not have enough multiples of both 5 and 7 to accurately represent the pattern of the sum.

What is the significance of proving this statement?

Proving this statement is important in mathematics because it demonstrates the use of modular arithmetic and the concept of congruence. It also has practical applications in fields such as cryptography.

What is the general approach to proving this statement?

The general approach is to use mathematical induction, which involves proving the statement for a base case (in this case, n = 24) and then showing that if the statement holds for a particular value of n, it also holds for n+1. This process is repeated until the statement is proven for all values greater than 23.

Are there any other similar statements that can be proven using this approach?

Yes, there are many other similar statements that can be proven using the same approach. For example, the sum of all multiples of 3 and 4 for values of n greater than 11 is also equal to 0 mod 12. This approach can be applied to a variety of different numbers and patterns.

Similar threads

  • Calculus and Beyond Homework Help
Replies
1
Views
1K
Replies
5
Views
2K
  • General Math
Replies
24
Views
2K
  • Nuclear Engineering
Replies
7
Views
536
  • Introductory Physics Homework Help
Replies
2
Views
872
Replies
3
Views
2K
  • MATLAB, Maple, Mathematica, LaTeX
Replies
1
Views
1K
  • Precalculus Mathematics Homework Help
Replies
11
Views
1K
  • Programming and Computer Science
Replies
2
Views
311
  • Set Theory, Logic, Probability, Statistics
Replies
9
Views
1K
Back
Top