beamer-rl class
Salim BouRepository: https://github.com/seloumi/beamer-rl
Bug tracker: https://github.com/seloumi/beamer-rl/issues
ب ع ض ال مل ا ح ظ ا ت
ب
ع
ض
ال
مل
ا
ح
ظ
ا
ت
I
ال ف ئ ة ت ع ر ف خ ط ا ل أ م ي ر ي ) Amiri ( ض من ي ا ك خ ط أ س ا س ي لل ك تا ب ة sans serif ، يم ك ن ت غ ي ي ر ذ ل ك م ع ب د اي ة ال و ث ي ق ة با س ت ع م ا ل ال ت ع لي م ة \babelfont{sf}{<font name >} يم ك ن ا ض ا ف ة ك ل ا ل خي ا ر ا ت ال ت ي ٺت ي ح ه ا ال ف ئ ة beamer ع ن د ا س ت د ع ا ء ال ف ئ ة beamer-rl ك ما يم ك ن تم ر ي ر خ ي ا ر ا ت ا ض ا ف ي ة ل لح ز م ة babel ع ن د ا س ت د ع ا ء ال ف ئ ة beamer-rl ع ل ى ال ش ك ل :\documentclass[babel={<babel options >}]{beamer -rl}
ب ع ض ال مل ا ح ظ ا ت
ب
ع
ض
ال
مل
ا
ح
ظ
ا
ت
II
ال ف ئ ة beamer-rl ت ق و م ب ت ب ا د ل ل ك ل م ن ال ت ع لي م ت ي ن \blacktriangleright و \blacktriangleleft ف ي ح ال ة ن ص م ن ال يم ي ن لل ي س ا ر \blacktriangleright \blacktriangleleft LTR context J I RTL context I J ا ل خي ا ر arabic لل ف ئ ة يم ك ن م ن ا س ت د ع ا ء ق ا م و س ع ر ب ي لت ر ج م ة ب ع ض ال م ف ر د ا ت م ث لexample ،definition ،theorem .
. . .
ا ل حز م ة pgfpages-rl
ا
ل
حز
م
ة
pgfpages-rl
ا ل حز م ة pgfpages-rl ت ض ي ف ا ل ى ا ل حز م ة pgfpages ال ق د ر ة ع ل ى د ع م ال ص ف ح ا ت م ن ال يم ي ن ا ل ى ال ي س ا ر ) pagedir TRT ( ٺت ط ل ب ال م ع ا ل ج ة با س ت ع م ا ل LuaLATEX يم ك ن ا س ت ع م ا ل ه ا أي ض ا م ع ال ف ئ ا ت ا ل أ خ ر ى ع د ا ع ن ال ف ئ ة beamer-rl \documentclass{beamer -rl} \babelprovide[import=ar-DZ, main]{arabic} \usetheme{Warsaw}\usepackage{pgfpages -rl} % adapt pgfpages to TRT pagedir \setbeamertemplate{note page}[]
\setbeameroption{show notes on second screen=right} \begin{document}
...
أ م ثل ة ال ن ظ ر يا ت
ال
ن
ظ
ر
يا
ت
The proof uses reductio ad absurdum . ن ظ ر ي ة
There is no largest prime number . ب ر ه ا ن . 1 Suppose p
were the largest prime number .
2 Let q be the product of the first p numbers . 3 Then q + 1 is not divisible by any of them . 4 But q + 1 is greater than 1 , thus divisible by some prime number not in
أ م ثل ة ال ن ظ ر يا ت
ال
ن
ظ
ر
يا
ت
The proof uses reductio ad absurdum . ن ظ ر ي ة
There is no largest prime number . ب ر ه ا ن . 1 Suppose p
were the largest prime number .
2
Let q be the product of the first p numbers . 3 Then q + 1 is not divisible by any of them . 4 But q + 1 is greater than 1 , thus divisible by some prime number not in
the first p
أ م ثل ة ال ن ظ ر يا ت
ال
ن
ظ
ر
يا
ت
The proof uses reductio ad absurdum . ن ظ ر ي ة
There is no largest prime number . ب ر ه ا ن . 1 Suppose p
were the largest prime number .
2 Let q be the product of the first p numbers . 3 Then q + 1 is not divisible by any of them . 4 But q + 1 is greater than 1 , thus divisible by some prime number not in
أ م ثل ة ال ن ظ ر يا ت
ال
ن
ظ
ر
يا
ت
The proof uses reductio ad absurdum . ن ظ ر ي ة
There is no largest prime number . ب ر ه ا ن . 1 Suppose p
were the largest prime number .
2 Let q be the product of the first p numbers . 3 Then q + 1 is not divisible by any of them . 4 But q + 1 is greater than 1 , thus divisible by some prime number not in
the first p
أ م ثل ة ال ت ك ب ي ر
ال
ت
ك
ب
ي
ر
Image
\framezoom <1><2>[border=2](1cm,1cm)(2cm,2cm)أ م ثل ة ال ت ك ب ي ر
