View source for Talk:Positive decimal integers with the digit 1 occurring exactly twice

== 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 task can have my vote for deletion as well. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 03:58, 9 July 2021 (UTC)
:It is a variant of the task [[Permutations_with_some_identical_elements]].--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 15:57, 10 July 2021 (UTC)

== suggest a task rename ==

I suggest that this (draft) task be renamed to reflect:

::* &nbsp; that &nbsp; ''positive integers'' &nbsp; be specified instead of &nbsp; ''numbers''.
::* &nbsp; that the &nbsp; number &nbsp; '''one''' be found in the number be changed to the &nbsp; ''digit'' &nbsp; '''one''' &nbsp; be found in ... 
::* &nbsp; indicate that the integers be expressed in base ten.
::* &nbsp; specify that &nbsp; ''exactly'' &nbsp; two &nbsp; '''one''' &nbsp; digits be found.



The number &nbsp; '''1211''' &nbsp; does have two &nbsp; '''1''' &nbsp; digits in it. &nbsp; It also has a &nbsp; '''1''' &nbsp; digit in it.

I've already modified the (draft) task's requirements &nbsp; (as everyone appears to have already assumed positive base ten numbers). &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 23:27, 8 July 2021 (UTC)