¡@¡@¡@¡@

¡@
¡@
     
 

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

(¸ê®Æ¥ÑCDI´£¨Ñ)

L
L.H.S. ¥½¶µ
L'Hospital's rule ¬¥¥²¹Fªk«h
Lagrange interpolating polynomial ©Ô®æ®Ô¤é´¡­È¦h¶µ¥N
Lagrange theorem ©Ô®æ®Ô¤é©w²z
Lami's law ©Ô±K©w«ß
Laplace expansion ©Ô´¶©Ô´µ®i¦¡
last term ¥½¶µ
latent root ¥»©º®Ú; ­º³q®|
lattice point ®æÂI
latus rectum ¥¿µJ©¶; ­º³q®|
law «ß¡F©w«ß
law of conservation of momentum °Ê¶q¦uùÚ©w«ß
law of indices «ü¼Æ«ß¡F«ü¼Æ©w«ß
law of inference ±À½×«ß
law of trichotomy ¤T¤À«ß
leading coefficient ­º¶µ«Y¼Æ
leading diagonal ¥D¹ï¨¤½u
least common multiple, lowest common multiple (L.C.M) ³Ì¤p¤½­¿¼Æ¡F³Ì§C¤½­¿¦¡
least value ³Ì¤p­È
left hand limit ¥ª¤è·¥­­
lemma ¤Þ²z
lemniscate Âù¯Ã½u
length ªø(«×)
letter ¤å¦r¡F¦r¥À
like surd ¦PÃþ®Ú¦¡
like terms ¦PÃþ¶µ
limacon ½½¤û½u
limit ·¥­­
limit of sequence §Ç¦Cªº·¥­­
limiting case ·¥­­±¡ªp
limiting friction ³Ì¤jÀR¼¯À¿
limiting position ·¥­­¦ì¸m
line ½u¡F¦æ
line of action §@¥Î¤O½u
line of best-fit ³Ì¨ÎÀÀ¦Xúø
line of greatest slope ³Ì¤j±×²vªºª½úø¡F³Ì¤j±×²vúø
line of intersection ¥æ½uúø
line segment ½u¬q
linear ½u©Ê¡F¤@¦¸
linear convergence ½u©Ê¦¬íK©Ê
linear differeantial equation ½u©Ê·L¤À¤èµ{
linear equation ½u©Ê¤èµ{¡F¤@¦¸¤èµ{
linear equation in two unknowns ¤G¤¸¤@¦¸¤èµ{¡F¤G¤¸½u©Ê¤èµ{
linear inequality ¤@¦¸¤£µ¥¦¡¡F½u©Ê¤£µ¥¦¡
linear momentum ½u°Ê¶q
linear programming ½u©Ê³W¹º
linearly dependent ½u©Ê¬ÛÃöªº
linearly independent ½u©ÊµLÃöªº
literal coefficient ¤å¦r«Y¼Æ
literal equation ¤å¦r¤èµ{
load ­t²ü
loaded coin ¤£¤½¥¿¿ú¹ô
loaded die ¤£¤½¥¿»ë¤l
local maximum §½³¡·¥¤j(­È)
local minimum §½³¡·¥¤p(­È)
locus, loci ­y¸ñ
logarithm ¹ï¼Æ
logarithmic equation ¹ï¼Æ¤èµ{
logarithmic function ¹ï¼Æ¨ç¼Æ
logic ÅÞ¿è
logical deduction ÅÞ¿è±À½×¡FÅÞ¿è±À²z
logical step ÅÞ¿è¨BÆJ
long division method ªø°£ªk
loop °j¸ô
loss ½ß¥»¡FÁ«»k
loss per cent ½ß²v¡FÁ«»k¦Ê¤À²v
lower bound ¤U¬É
lower limit ¤U­­
lower quartile ¤U¥|¤À¦ì¼Æ
lower sum ¤U©M
lower triangular matrix ¤U¤T¨¤§Î¯x°}
lowest common multiple(L.C.M) ³Ì¤p¤½­¿¼Æ