Talk:Positive decimal integers with the digit 1 occurring exactly twice: Difference between revisions
Content added Content deleted
(Created page with "This is the number of ways to place two ones in three slots, which is three, times the number of ways to place 0,2-9 in the remaining slot, which is nine. So at least twenty s...") |
(added a new talk section concerning the wording of the task's title and the task's requirements.) |
||
| Line 1: | Line 1: | ||
== number of ways to place two ones in three slots == |
|||
This is the number of ways to place two ones in three slots, which is three, times the number of ways to place 0,2-9 in the remaining slot, which is nine. So at least twenty seven is the correct answer. Surely somewhere this task is already covered.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 17:00, 8 July 2021 (UTC) |
This is the number of ways to place two ones in three slots, which is three, times the number of ways to place 0,2-9 in the remaining slot, which is nine. So at least twenty seven is the correct answer. Surely somewhere this task is already covered.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 17:00, 8 July 2021 (UTC) |
||
== suggest a task rename == |
|||
I suggest that this (draft) task be renamed to reflect: |
|||
::* that ''positive integers'' be specified instead of ''numbers''. |
|||
::* that the number '''one''' be found in the number be changed to the ''digit'' '''one''' be found in ... |
|||
::* indicate that the integers be expressed in base ten. |
|||
::* specify that ''exactly'' two '''one''' digits be found. |
|||
The number '''1211''' does have two '''1''' digits in it. It also has a '''1''' digit in it. |
|||
I've already modified the (draft) task's requirements (as everyone appears to have already assumed positive base ten numbers). -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:27, 8 July 2021 (UTC) |
|||
Revision as of 23:27, 8 July 2021
number of ways to place two ones in three slots
This is the number of ways to place two ones in three slots, which is three, times the number of ways to place 0,2-9 in the remaining slot, which is nine. So at least twenty seven is the correct answer. Surely somewhere this task is already covered.--Nigel Galloway (talk) 17:00, 8 July 2021 (UTC)
suggest a task rename
I suggest that this (draft) task be renamed to reflect:
- that positive integers be specified instead of numbers.
- that the number one be found in the number be changed to the digit one be found in ...
- indicate that the integers be expressed in base ten.
- specify that exactly two one digits be found.
The number 1211 does have two 1 digits in it. It also has a 1 digit in it.
I've already modified the (draft) task's requirements (as everyone appears to have already assumed positive base ten numbers). -- Gerard Schildberger (talk) 23:27, 8 July 2021 (UTC)