My Math Forum  

Go Back   My Math Forum > College Math Forum > Number Theory

Number Theory Number Theory Math Forum

LinkBack Thread Tools Display Modes
April 19th, 2010, 05:56 AM   #1
Joined: May 2009

Posts: 20
Thanks: 0

discrete mathematics

How many strings of 9 digits have each of the digits 1, 3, and 7 appearing at least once?
conradtsmith is offline  
April 19th, 2010, 06:11 AM   #2
Global Moderator
CRGreathouse's Avatar
Joined: Nov 2006
From: UTC -5

Posts: 16,046
Thanks: 933

Math Focus: Number theory, computational mathematics, combinatorics, FOM, symbolic logic, TCS, algorithms
Re: discrete mathematics

Use inclusion-exclusion.

Count the number of 9-digit strings. Now subtract the number of 9-digit strings without 1s, the number without 3s, and the number without 7s. Now add on the 9-digit strings with neither 1s nor 3s, the strings with neither 1s nor 7s, and the strings with neither 3s nor 7s; these have been subtracted twice. Now subtract the strings with no 1s, 3s, or 7s.

Be careful about the first digit as well; it probably isn't allowed to be 0.
CRGreathouse is offline  

  My Math Forum > College Math Forum > Number Theory

discrete, mathematics

Thread Tools
Display Modes

Similar Threads
Thread Thread Starter Forum Replies Last Post
Discrete Mathematics. Shruthi318 Applied Math 0 November 9th, 2013 09:42 PM
Discrete Mathematics - Set Theory OriaG Applied Math 2 February 16th, 2013 06:19 AM
Discrete mathematics question 2 mathboss Applied Math 0 January 18th, 2013 04:43 AM
discrete mathematics conradtsmith Abstract Algebra 1 April 19th, 2010 07:02 AM
Discrete Mathematics. Shruthi318 Complex Analysis 0 December 31st, 1969 04:00 PM

Copyright © 2017 My Math Forum. All rights reserved.