A board has 2, 4, and 6 written on it. One repeatedly chooses values (not necessarily different) for x, y, and z from the board, and writes xyz + xy + yz + zx + x + y + z if and only if those numbers are not already on the board and are also less than or equals 2013. The person repeats this process until no more numbers can be written. How many numbers will be written at the end of this process?


Question and Answers Forum

All Questions Topic List
Algebra Questions
Previous in All Question Next in All Question
Previous in Algebra Next in Algebra
Question Number 202037 by syamilkamil1 last updated on 19/Dec/23

A board has 2, 4, and 6 written on it. One repeatedly chooses values (not necessarily different) for x, y, and z from the board, and writes xyz + xy + yz + zx + x + y + z if and only if those numbers are not already on the board and are also less than or equals 2013. The person repeats this process until no more numbers can be written. How many numbers will be written at the end of this process?
	Answered by nikif99 last updated on 20/Dec/23

	$J u s t 20 . S e e i m a g e f o r d e t a i l s .$ $P r o p o s i t i o n : I f a n u m b e r n >= 223 i s$ $w r i t t e n, i t c e a s e s p r o c e d u r e w i t h t h i s$ $n b e c a u s e n e x t r e s u l t e x c e e d s 2013 .$ $(x, y, z) = (2, 2, 223) \to 2 \times 2 \times 223 + 2 \times 2 +$ $2 \times 223 + 2 \times 223 + 2 + 2 + 223 = 2015 .$ $I n t h e r e g i o n A 1 . . C 11 a r e 10 p o s s i b l e$ $c a s e s w h e n o n l y 2, 4, 6 a r e w r i t t e n (s e e$ $c o l . E f o r s t a r t) .$ $F o r e a c h o f t h e s e c a s e s, a p p l i c a t i o n o f$ $t h e g i v e n f o r m u l a f o r e a c h r o w g i v e s$ $a s r e s u l t c o l u m n N, s o t h e r e s p e c t i v e$ $n u m b e r c a n b e w r i t t e n o n t h e b o a r d .$ $★ F o r t h e 2 n d r o u n d y o u a p p l y e a c h$ $n u m b e r f r o m t h e r a n g e N 2 . . N 11 t o t h e$ $c e l l N 1 (i n t h e e x a m p l e, N 6 = 62), w h i c h$ $c o p i e s p o s s i b l e t r i p l e t t e s t o t h e r a n g e$ $A 13 . . C 22 .$ $S o, y o u h a v e 10 n e w c a s e s t o a p p l y t h e$ $f o r m u l a (i f y o u o m i t 62 a n d u s e 2, 4, 6$ $o n l y, y o u a r e d r i v e n t o a r e p e t i t i o n) .$ $N e w t r i p l e t t e s o f r o w s 13 t o 22 l e a d t o$ $r e s u l t s N 13 . . N 22 . N o t a l l r e s u l t s a r e$ $a c c e p t a b l e s i n c e s o m e o f t h e m (m a r k e d$ $i n r e d) a r e > 2013 .$ $A c c e p t e d r e s u l t s a r e w r i t t e n v e r t i c a l l y$ $i n c o l s F t o M (i n o u r e x a m p l e, H) .$ $R e p e a t i n g t h e s a m e p r o c e d u r e f r o m ★$ $f o r a l l n u m b e r s i n N 2 . . N 11 y o u g e t$ $r e s u l t s i n c o l s F t o M .$ $I t i s i m p o s s i b l e t o f o l l o w 3 r d r o u n d$ $b e c a u s e a l l n u m b e r s i n c o l s F t o M$ $a r e > 223 (s e e p r o p o s i t i o n a b o v e) .$ $F i n a l l y, c o l l e c t i n g a l l p r o d u c e d n u m b e r s$ $y o u g e t f i n a l r e s u l t i n A 24 . . H 28 .$
	Commented by nikif99 last updated on 20/Dec/23

Terms of Service
Privacy Policy
Contact: info@tinkutara.com

Question and Answers Forum