Let E be the set of even integers and let OO be the set of odd integers. Suppose that a computer is programmed to input a sequence of elements of E and output a sequence of elements of O according to some rule. You run a test of this program using 12,6,8,10,212,6,8,10,2 as input, and the computer outputs 81,9,25,49,181,9,25,49,1. What rule does the computer appear to be using?

Let E be the set of even integers and let OO be the set of odd integers. Suppose that a computer is programmed to input a sequence of elements of E and output a sequence of elements of O according to some rule. You run a test of this program using 12,6,8,10,212,6,8,10,2 as input, and the computer outputs 81,9,25,49,181,9,25,49,1. What rule does the computer appear to be using?

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

The following table shows the number of new (single-unit) houses started, in thousands, in the different regions of the United States during 2012-2014. Take S to be the set of all housing starts represented in the table, and label the sets representing the housing starts in each row and column as shown (so, for example, N is the set of all housing starts in the Northeast during 2012-2014). 2012 (4) 2013 (8) 2014 (C) Total Northeast (N) 50 60 OBOM' OBUM' OANM' OcnM O AUM Compute its cardinality. thousand 50 160 Use symbols to describe the given set. Midwest South (M) (S) 90 100 110 300 280 330 350 960 West (W) 110 130 150 390 Total 530 620 660 1,810 the set of housing starts in 2013 excluding housing starts in the the Midwest
What if the jelly bean machine gives 9 jelly beans to the first customer who put in a coin, 13 to the second, 17 to the third, 21 to the fourth, etc. How many jelly beans will the machine give out if the machine will receive its 35th coin?How many has the machine given out after 35 coins are put into the machine?
suppose that five service customers need service call and the maintenance worker can only service three of them each morning, the customers dont care when are serviced as long as it is before noon, so the dispatcher does not care who is serviced first, second or third. find the number of ways in order of which these customers would be served
Suppose we want to choose 2 colors without replacement from 5 colors red, blue, green, purple, and yellow. How many ways can this be done, if the order of choices is relevant? How many ways can this be done if the order of choices is not relevant?
14! / 8!6!
Suppose 10 baseball players are available to be drafted by 4 teams where each team might win any number of these players. In how many ways can these 10 players be drafted?
We want to divide 12 children into any number of playgroups. However, in order to avoid some predictable disagreements, we want Adam and Brenda to be in different playgroups. How many ways are there to do this? (Playgroups have at least one child)
There are 30 total anagrams of the word memes. I listed all 30 and could only find 4 deranged anagrams. Why is it 11 and not 4? The only 4 I could find are EMSME, ESEMM< SMEME, EMESM
A burger chain wants to send codes for a free small drink to the members of its kids club. The coupon code will have one letter, followed by two digits, followed by two letters. The letters R , S , T , and U and the digit 3 will not be used. So, there are 22 letters and 9 digits that will be used. Assume that the letters and digits can be repeated. How many such coupon codes can be generated?
Find the number of ways to select 12 objects with repetition from 5 distinct types of objects with at least 1 objects of each type and at most 4 objects of each type.
2. (a) A sack contains 50 marbles of 4 different colors. Explain why there are at least 13 marbles of the same color. (b) If exactly 8 of the marbles are red, explain why there are at least 14 of the same color.
We are making 5-letter words from the set of letters a, b, c, d, e, f ..., in such a way that we have exactly the first 5 letters available so that we use all letters. that do not contain the sub- a. How many 5-letter words can we make from the letters without repeats word "bad" in consecutive letters? a. How many words don't contain the subword “bad” in not-necessarily-consecutive letters (but in order)? -> →