Loading [MathJax]/jax/output/SVG/jax.js
 

heureka

avatar
Benutzernameheureka
Punkte26396
Membership
Stats
Fragen 17
Antworten 5678

 #4
avatar+26396 
0

 

1:97=0. remainder 1110:97=0 remainder 101010:97=1 remainder 3310:97=0 remainder 303010:97=3 remainder 9910:97=0 remainder 909010:97=9 remainder 272710:97=2 remainder 76z10:97=A remainder yy10:97=6 remainder xx10:97=7 remainder 1 end of repeating part remainder =1

 

We solve A:

We have:

x10:97=7 remainder 1 or x10=797+1x=797+110x=68010x=68

 

...and we have:

y10:97=6 remainder x or y10=697+68y=697+6810y=65010y=65

 

...and...

z10:97=A remainder y or z10=A97+65

 

We have to solve the Diophantine equation  10z97A=65.

We can do it with a variation of the Euclidean algorithm, or we can do it with Euler's Method etc.


I will do it with Euler's theorem:

In number theory, Euler's theorem (also known as the Fermat–Euler theorem or Euler's totient theorem)states that if m and a are coprime positive integers, then aφ(m)1(modm), if  gcd(a,m)=1oraφ(m)(modm)1|1aaφ(m)a(modm)1a=a1aφ(m)1(modm)1a=a1a1=1aaφ(m)1(modm), if  gcd(a,m)=1

 

We need this Formula: a1=1aaφ(m)1(modm), if  gcd(a,m)=1

 

an we need the Euler's Totient Function: φ(10)=10(112)(115)=4, because  10=25

 

so we have:

10z97A=6597A=10z65|(mod10)97A65(mod10)97A65+710(mod10)97A5(mod10)97A197597(mod10)A5197(mod10)197(mod10)97φ(10)1(mod10) see Formula above,we can do it because,  gcd(97,10)=19741(mod10)973(mod10)912673(mod10)3(mod10)A5197(mod10)A53(mod10)A15(mod10)A5(mod10)A=5

 


laugh

01.06.2016
 #1
avatar+26396 
+5

Larry has 4-cent stamps and 9-cent stamps, which he can combine to produce various amounts of postage. For example, he can make 40 cents by using four 9-cent stamps and a 4-cent stamp, or by using ten 4-cent stamps. However, there are some amounts of postage he can't make exactly, such as 10 cents. {nl} {nl} What is the largest number of cents that Larry cannot make exactly from a combination of 4- and/or 9-cent stamps? {nl} {nl} Explain how you know your answer is correct. (You should explain two things: why Larry can't make the amount of your answer, and why he can make any bigger amount.)

 

All figures can be divided into 4 groups.

Group 1: 4n

Group 2: 4n+1

Group 3: 4n+2

Group 4: 4n+3

 

With 4-cent stamps we get Group 1. (Beginning with n=1 we have 4, 8, 12, 16, 32, ...)

 

With one 9-cent(4*2+1) we can start Group 2. (Beginning with n=2 we have 9 ) and continuing 4*3 + 1(=13) with one 4-cent, 4*4 + 1(=17) with two 4-cent, 4*5+1(=21) with three 4-cent etc.

 

With two 9-cent(4*4+2) we can start Group 3. (Beginning with n=4 we have 18 ) and continuing 4*5 + 2(=22) with one 4-cent, 4*6 + 2(=26) with two 4-cent, 4*7+2 (=30) with three 4-cent etc.

 

With three 9-cent(4*6+3) we can start Group 4. (Beginning with n=6 we have 27 ) and continuing 4*7 + 3(=31) with one 4-cent, 4*8 + 3(=35) with two 4-cent, 4*9+3 (=39) with three 4-cent etc.

 

All NumbersGroup 1Group 2Group 3Group 44n+14n+24n+34n1234+45678+49101112+413141516+417181920+421222324+425262728+429303132+433343536+437382940+4

 

the largest number of cents that Larry cannot make exactly from a combination of 4- and/or 9-cent stamps is 23.

 

laugh

27.05.2016