How many ordered sets of positive integer triples ( a , b , c ) are there such that a + b × c = 1 0 0 ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
This question allows us to establish that i = 1 ∑ N ϕ ( i ) = i = 1 ∑ N ⌊ i N ⌋ .
How is it done?
Log in to reply
Isn't ∑ i = 1 N τ ( i ) = ∑ i = 1 N ⌊ i N ⌋ ?
Since a is at least 1, b can take on any value from 1 to 99. For each value of b , c can be an integer from 1 to b 9 9 , and then we set a = 1 0 0 − b × c , to obtain a positive integer. As such, there are ⌊ b 9 9 ⌋ − 1 + 1 possible values for c . (Note: ⌊ x ⌋ denotes the largest integer less than or equal to x ). We now calculate b = 1 ∑ 9 9 ⌊ b 9 9 ⌋ .
For b = 1 , we get ⌊ b 9 9 ⌋ = 9 9 . For b = 2 , we get ⌊ b 9 9 ⌋ = 4 9 . For b = 3 , we get ⌊ b 9 9 ⌋ = 3 3 . For b = 4 , we get ⌊ b 9 9 ⌋ = 2 4 . For b = 5 , we get ⌊ b 9 9 ⌋ = 1 9 . For b = 6 , we get ⌊ b 9 9 ⌋ = 1 6 . For b = 7 , we get ⌊ b 9 9 ⌋ = 1 4 . For b = 8 , we get ⌊ b 9 9 ⌋ = 1 2 . For b = 9 , we get ⌊ b 9 9 ⌋ = 1 1 . For b = 1 0 , 1 1 , we get ⌊ b 9 9 ⌋ = 9 . For b = 1 2 , we get ⌊ b 9 9 ⌋ = 8 . For b = 1 3 , 1 4 , we get ⌊ b 9 9 ⌋ = 7 . For b = 1 5 , 1 6 , we get ⌊ b 9 9 ⌋ = 6 . For b = 1 7 to 1 9 , we get ⌊ b 9 9 ⌋ = 5 . For b = 2 0 to 2 4 , we get ⌊ b 9 9 ⌋ = 4 . For b = 2 5 to 3 3 , we get ⌊ b 9 9 ⌋ = 3 . For b = 3 4 to 4 9 , we get ⌊ b 9 9 ⌋ = 2 . For b = 5 0 to 9 9 , we get ⌊ b 9 9 ⌋ = 1 .
Hence, the total number of positive integer solutions is 9 9 + 4 9 + 3 3 + 2 4 + 1 9 + 1 6 + 1 4 + 1 2 + 1 1 + 9 × 2 + 8 + 7 × 2 + 6 × 2 + 5 × 3 + 4 × 5 + 3 × 9 + 2 × 1 6 + 1 × 5 0 = 4 7 3 .
Note: An alternative solution proceeds by from considering a = 1 to 9 9 and observing that there are σ 0 ( 1 0 0 − a ) solutions. However, this requires listing all values of σ 0 ( n ) , which is tedious. In fact, this method of double-counting shows that i = 1 ∑ N σ 0 ( i ) = i = 1 ∑ N ⌊ i N ⌋ .
Problem Loading...
Note Loading...
Set Loading...
I used the a just to fill in the difference between 100 and b × c . For every pair of integers b × c < 1 0 0 , there will be one and only one triple. I went from 1 to 100 for b and for each value of b , there are ⌊ b 9 9 ⌋ − 1 + 1 possible values for c . Summing this up is a little time consuming from 1 to 19, then the results become easier to calculate, because they come in large groups.
For b = 1 , we get ⌊ b 9 9 ⌋ = 9 9 . For b = 2 , we get ⌊ b 9 9 ⌋ = 4 9 . For b = 3 , we get ⌊ b 9 9 ⌋ = 3 3 . For b = 4 , we get ⌊ b 9 9 ⌋ = 2 4 . For b = 5 , we get ⌊ b 9 9 ⌋ = 1 9 . For b = 6 , we get ⌊ b 9 9 ⌋ = 1 6 . For b = 7 , we get ⌊ b 9 9 ⌋ = 1 4 . For b = 8 , we get ⌊ b 9 9 ⌋ = 1 2 . For b = 9 , we get ⌊ b 9 9 ⌋ = 1 1 . For b = 1 0 , 1 1 , we get ⌊ b 9 9 ⌋ = 9 . For b = 1 2 , we get ⌊ b 9 9 ⌋ = 8 . For b = 1 3 , 1 4 , we get ⌊ b 9 9 ⌋ = 7 . For b = 1 5 , 1 6 , we get ⌊ b 9 9 ⌋ = 6 . For b = 1 7 to 1 9 , we get ⌊ b 9 9 ⌋ = 5 . For b = 2 0 to 2 4 , we get ⌊ b 9 9 ⌋ = 4 . For b = 2 5 to 3 3 , we get ⌊ b 9 9 ⌋ = 3 . For b = 3 4 to 4 9 , we get ⌊ b 9 9 ⌋ = 1 . For b = 5 0 to 9 9 , we get ⌊ b 9 9 ⌋ = 1 .
Hence, the total number of positive integer solutions is 9 9 + 4 9 + 3 3 + 2 4 + 1 9 + 1 6 + 1 4 + 1 2 + 1 1 + 9 × 2 + 8 + 7 × 2 + 6 × 2 + 5 × 3 + 4 × 5 + 3 × 9 + 2 × 1 6 + 1 × 5 0 = 4 7 3 .
[Details filled in - Calvin]