MHB Prove $5x+9y=n$ Solutions for $n \ge 32$, $\mathbb{Z}_0^+$

  • Thread starter Thread starter ssome help
  • Start date Start date
Click For Summary
The discussion focuses on proving that any amount \( n \ge 32 \) can be expressed as \( 5x + 9y \) where \( x \) and \( y \) are non-negative integers. An initial case is provided with \( n = 32 \) showing \( x = 1 \) and \( y = 3 \) as a valid solution. The proof employs mathematical induction, assuming the statement holds for some integer \( k \ge 32 \) and demonstrating it for \( k + 1 \). The discussion also explores specific cases for \( k + 1 \) based on the values of \( y \), leading to valid constructions for \( n \). The conclusion affirms that all integers \( n \) from 32 onward can indeed be represented in this form.
ssome help
Messages
3
Reaction score
0
Prove that $n \ge \$32$ can be paid in \$5 and \$9 dollar bills ie the equation $5x+9y=n$ has solutions $x$ and $y$ element $\mathbb{Z}_0^+$ for $n$ element of $\mathbb{Z}^+$ and $n \ge 32$.
 
Last edited by a moderator:
Physics news on Phys.org
Re: $ solutions

ssome help said:
Prove that $n >=(greater than or equal to) 32 can be paid in $5 and $9 dollar bills ie the equation 5x+9y=n has solutions x and y element (Z(sub0)^+) for n element of Z^+ and n >=32.

See a similar problem here.

On this forum, the dollar sign starts a "mathematical mode" where one can use special commands to produce symbols like $\pi$ and $\int$. If you want to write a dollar sign, you can type dollar, backslash and two dollars, like this: $\$$.
 
Re: $ solutions

Alternatively you can type:
Code:
\$
which comes out as \$.
 
Re: $ solutions

ssome help said:
Prove that $n >=(greater than or equal to) 32 can be paid in $5 and $9 dollar bills ie the equation 5x+9y=n has solutions x and y element (Z(sub0)^+) for n element of Z^+ and n >=32.
induction at n for n=32 x=1,y=3
5 + 3(9) = 32
note that 1 = 2(5) - 9
so 33 = 5 + 2(5) + 3(9) - 9
suppose it is true for k>=32 integer there exist a positive integers x,y such that

5x + 9y = k
for k+1
k+1 = 5x + 9y +1
choose 1 = 2(5) - 9, if y>=1
if y = 0
then k multiple of 5 which is 35 or larger, x>=7 so choose
1= -7(5) + 4(9)
 
The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...

Similar threads

Replies
2
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K
Replies
8
Views
2K
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K