Á¦ ¸ñ : A representation and some properties for k-Fibonacci sequences, (dvi) , (ps), (PDF)
by J.-S. Kim, G.-Y. Lee, S.-G. Lee*
ÃÊ ·Ï : The k-Fibonacci sequence, g_{n}^{(k)} is defined as g_{1}^(k) = cdots = g_{k-2}^{k)} = 0, g_{k-1}^(k) = g_{k}^{k)} = 1 and for n > k >=2, g_{n}^{(k)} = g_{n-1}^(k) + g_{n-2}^{k)} + cdots + g_{n-k}^(k) .
In this talk, we give a combinatorial representation of g_{n}^(k) and introduce some properties for k-Fibonacci sequence.
|
ÀÌ»ó±¸ (¼º±Õ°ü´ë) |
Contents |
ABSTRACT
1. ¼ÒÇÁÆ®¿þ¾î °³¹ß
2. ¹Ù²ï ¼¼»óÀ» º¸¿©ÁÖ´Â µµ±¸ (ÀÚ¹Ù)
3. ¿ì¸®°¡ Á¢±ÙÇØ º» »õ·Î¿î ¹æÇâ
4. ¿ì¸®°¡ ÇØ ¿Â ÀÏÀº?
5. °á·Ð

¼ÒÇÁÆ®¿þ¾î °³¹ß¿¡¼ÀÇ ¿ì¸® ³ë·Â : http://math.skku.ac.kr/algebra/mshm/
±³À°¿ë : Mathrix
: À©µµ¿ì¿ë ÇÑ±Û ¼±Çü´ë¼ö ÇнÀ¿ë ÇÁ·Î±×·¥ (µ¨ÆÄÀÌ)
±³À°¿ë : HLINPRAC
: ¼±Çü´ë¼ö ½Ç½À¿ë ÇÁ·Î±×·¥ (ÆÄ½ºÄ®)
¿¬±¸¿ë : Signmat8 :
L-matrix¿Í Barely L-matrixÀÇ Sign nonsigurality µî
(C-¾ð¾î)
¹Ù²ï ¼¼»óÀ» º¸¿©ÁÖ´Â
µµ±¸ :
(Wellman, Cannon, Heal)
(Wellman)
¿ì¸®°¡ Á¢±ÙÇØ º» »õ·Î¿î
¹æÇâ
¼±Çü´ë¼öÇÐÀ»
¾îµð±îÁö JAVA·Î ÇÒ ¼ö ÀÖ³ª?
¿ì¸®°¡ ÇØ ¿Â ÀÏÀº?
4Â÷Çà·Ä
°è»ê ÀÚ¹Ù ½ºÅ©¸³Æ® (1), (2),
(3),
(4) by Sang-Gu Lee
ÀϹÝÀûÀÎ Çà·Ä °è»ê¿ë ÀÚ¹Ù Applet
°á·Ð
±³À°Àû ¸ñÇ¥¸¦ ´Þ¼ºÇϱâ À§ÇÑ µµ±¸ÀÇ ÁÖ¿ä features
ÀÌ·± micro-learning ȯ°æÀ» À§Çؼ ÇÊ¿äÇÑ programming ¾ð¾î´Â
¿ì¸®°¡ »ç¿ëÇÒ ¾ð¾î´Â ¼öÇÐÀ» ÇÁ·Î±×·¥ÇÒ ¸¸Å powerful Çϰí flexible (Àû¾îµµ C ³ª FORTRAN °°ÀÌ) ÇØ¾ß ÇÑ´Ù. °æÇè»ó GUI ¿¡ ÀûÇÕÇÑ programming ¾ð¾î´Â (C++ ³ª SmallTalk °°Àº) Object Oriented ÀÌ´Ù. Web¿¡¼ ÀÌ·± °ÍÀÌ °¡´ÉÇÏ°Ô ÇÏ´Â ¾ð¾î Áß ÇöÀç »ç¿ë °¡´ÉÇÑ ¾ð¾î´Â ¿ÀÁ÷ Çϳª JAVA »ÓÀÌ´Ù. (java.sun.com)
THANK YOU!
