Study guide
6.2 Number Series, Letter Series, Coding-Decoding & Direction Tests
UGC NET National Eligibility Test
Track your progress as you read
Finished sections get a check mark.
1 Introduction & UGC NET Exam Structure
1.1 Exam Format, Scoring & Qualification Rules 1.2 Paper 1 Blueprint, Unit Weighting & High-Yield Strategy 1.3 CBT Interface Navigation, Pacing & Error Traps
2 Unit 1: Teaching Aptitude
2.1 Concept, Objectives & Levels of Teaching 2.2 Learner Characteristics & Factors Affecting Teaching 2.3 Teacher-Centred vs. Learner-Centred & Digital Teaching Methods 2.4 Evaluation Systems, CBCS & Computer-Based Assessment 2.5 Teaching Support Systems: Traditional, Modern & ICT-Based
3 Unit 2: Research Aptitude
3.1 Meaning, Types & Characteristics of Research 3.2 Steps of Research & Experimental Methodologies 3.3 Thesis Writing, Formatting Styles & Shodhganga 3.4 Research Ethics, UGC Plagiarism Regulations 2018 & Academic Integrity
4 Unit 3: Reading Comprehension
4.1 Academic Text Analysis & Core Question Archetypes 4.2 Logical Inferences, Authorial Stance & Contextual Vocabulary 4.3 High-Density Passage Walkthroughs & Question Deconstruction
5 Unit 4: Communication
5.1 Meaning, Types & Models of Communication 5.2 Verbal, Non-Verbal & Classroom Communication Dynamics 5.3 Psychological, Semantic, Cultural & Organizational Barriers 5.4 Mass Media, Digital Communication & Societal Impact
6 Unit 5: Mathematical Reasoning & Aptitude
6.1 Types of Reasoning: Verbal, Non-Verbal, Deductive, Inductive & Analogical 6.2 Number Series, Letter Series, Coding-Decoding & Direction Tests 6.3 Blood Relations, Order & Ranking, Family Tree Logic 6.4 Mathematical Aptitude: Fractions, Percentages, Profit & Loss 6.5 Ratios, Proportions, Mixtures & Averages 6.6 Time & Work, Speed-Time-Distance, Simple & Compound Interest
7 Unit 6: Logical Reasoning & Indian Logic
7.1 Structure of Arguments, Deductive vs. Inductive Reasoning, Syllogisms 7.2 Classical Square of Opposition, Categorical Propositions & Connotation/Denotation 7.3 Venn Diagrams, Moods & Figures, Formal and Informal Fallacies 7.4 Indian Logic: Six Pramanas 7.5 Structure of Anumana & Hetvabhasa
8 Unit 7: Data Interpretation
8.1 Sources, Acquisition & Graphical Representation 8.2 Tabular Data Analysis & Quantitative Calculation Shortcuts 8.3 Pie Charts, Bar Charts & Multi-Variable Data Sets 8.4 Data and Governance, Common NTA Traps & Error Prevention
9 Unit 8: Information & Communication Technology (ICT)
9.1 ICT Terminology, Acronyms, Hardware & Memory Hierarchy 9.2 Binary, Octal, Decimal, Hexadecimal Conversions & File Formats 9.3 Internet, Intranet, TCP/IP, Protocols, Email Mechanics & Cyber Security 9.4 Digital Initiatives in Higher Education 9.5 Audio & Video Conferencing: Protocols, Codecs & Educational Deployment 9.6 ICT and Governance: e-Governance Models, Digital India & Service Delivery
10 Unit 9: People, Development & Environment
10.1 Millennium Development Goals (MDGs) & Sustainable Development Goals (SDGs) 10.2 Air, Water, Soil & Noise Pollution and Health Impacts 10.3 Solid Waste, Hazardous Waste, Climate Change & Global Warming 10.4 Solar, Wind, Hydro, Biomass & India's Clean Energy Targets 10.5 Environmental Protection Act 1986, NAPCC & International Accords 10.6 Natural Hazards, Disasters & Mitigation Strategies
11 Unit 10: Higher Education System
11.1 Institutions of Higher Learning in Ancient India 11.2 Evolution of Higher Learning in Pre & Post-Independence India 11.3 Apex Regulatory Bodies, Accreditations & Institutional Classifications 11.4 National Education Policy (NEP 2020) & Institutional Transformation 11.5 Professional, Technical & Skill-Based Education 11.6 Value Education & Environmental Education
12 Paper 2 Strategy, Mock Testing & Exam Day Execution
12.1 Paper 2 Subject Strategy & Core Discipline Methodologies 12.2 Full 150-Question Timed Simulation Strategy, Error Logging & Endurance 12.3 NTA Exam-Day Protocols, CBT Test-Taking Rules & Score Maximization
6.2 Number Series, Letter Series, Coding-Decoding & Direction Tests
Key Takeaways Explain This Topic AI
Number series patterns are diagnosed through a systematic hierarchy: common difference (arithmetic), common ratio (geometric), difference of differences (two-tier), perfect squares and cubes ( n 2 ± k , n 3 ± k n^2 \pm k, n^3 \pm k n 2 ± k , n 3 ± k ), and alternating twin sequences.
Alphabet letter series and coding problems rely on forward positional values ( A = 1 A=1 A = 1 to Z = 26 Z=26 Z = 26 ), reverse positions ( 27 − forward position 27 - \text{forward position} 27 − forward position ), the EJOTY benchmark ( 5 , 10 , 15 , 20 , 25 5, 10, 15, 20, 25 5 , 10 , 15 , 20 , 25 ), and the 13 complementary opposite-letter pairs (summing to 27).
Coding-decoding archetypes span letter shifting, opposite-letter substitution, matrix position coding, and sentence deciphering through common word elimination across statements.
Direction sense problems are resolved by standard 8-point compass navigation, applying the Pythagorean theorem ( d = Δ x 2 + Δ y 2 d = \sqrt{\Delta x^2 + \Delta y^2} d = Δ x 2 + Δ y 2 ) for shortest straight-line displacement.
Shadow problems follow rigid solar geometry: at sunrise, shadows cast due West (falling to the left of a person facing North); at sunset, shadows cast due East; at 12:00 noon, shadows are vertically negligible.
Last updated: August 2026
Number Series, Letter Series, Coding-Decoding & Direction Tests
Quick Answer: Mathematical and verbal reasoning in UGC NET Paper 1 evaluates logical pattern identification and spatial reasoning. Master number series by checking differences, ratios, two-tier differences, squares ( n 2 ± k n^2 \pm k n 2 ± k ), and cubes ( n 3 ± k n^3 \pm k n 3 ± k ). For letter series and coding, memorize forward positional values ( A = 1 A=1 A = 1 to Z = 26 Z=26 Z = 26 ), the EJOTY benchmark ( 5 , 10 , 15 , 20 , 25 5, 10, 15, 20, 25 5 , 10 , 15 , 20 , 25 ), and opposite-letter pairs summing to 27 27 27 . For direction sense, trace movements on an 8 8 8 -point compass and compute displacement using Pythagoras' theorem: d = ( Δ x ) 2 + ( Δ y ) 2 d = \sqrt{(\Delta x)^2 + (\Delta y)^2} d = ( Δ x ) 2 + ( Δ y ) 2 .
1. Number Series Patterns and Diagnostic Hierarchy
Number series questions present a sequence of numbers following a specific mathematical rule. The objective is to identify the underlying pattern to find a missing term or identify the wrong term. Approaching an unfamiliar series requires a structured diagnostic hierarchy. [ Step 1: Growth Rate Inspection ]
- / \
- Gradual Increase/Decrease Rapid / Exponential Growth
- | |
- [ Check Differences (AP) ] [ Check Ratios (GP / Cubes) ]
- | |
- [ Check Two-Tier Differences ] [ Check Powers: n² ± k, n³ ± k ]
- \
- [ Check Alternating / Twin Series & Fibonacci ]
- Primary Sequence Archetypes
Arithmetic Progressions (Constant or Progressive Difference):
Constant Difference: Each consecutive term differs by a fixed constant d d d . Example: 7 , 12 , 17 , 22 , 27 ( d = + 5 ) \text{Example: } 7, 12, 17, 22, 27 \quad (d = +5) Example: 7 , 12 , 17 , 22 , 27 ( d = + 5 )
Progressive Difference: The difference increases or decreases systematically. Example: 2 , 5 , 10 , 17 , 26 ( + 3 , + 5 , + 7 , + 9 ⟹ differences are consecutive odd numbers ) \text{Example: } 2, 5, 10, 17, 26 \quad (+3, +5, +7, +9 \implies \text{differences are consecutive odd numbers}) Example: 2 , 5 , 10 , 17 , 26 ( + 3 , + 5 , + 7 , + 9 ⟹ differences are consecutive odd numbers )
Geometric Progressions (Constant or Progressive Multipliers):
Constant Ratio: Terms grow by a constant multiplier r r r . Example: 6 , 18 , 54 , 162 , 486 ( × 3 ) \text{Example: } 6, 18, 54, 162, 486 \quad (\times 3) Example: 6 , 18 , 54 , 162 , 486 ( × 3 )
Progressive Multiplier: Multiplier increments with each term. Example: 3 , 3 , 6 , 18 , 72 , 360 ( × 1 , × 2 , × 3 , × 4 , × 5 ) \text{Example: } 3, 3, 6, 18, 72, 360 \quad (\times 1, \times 2, \times 3, \times 4, \times 5) Example: 3 , 3 , 6 , 18 , 72 , 360 ( × 1 , × 2 , × 3 , × 4 , × 5 )
Difference of Differences (Two-Tier and Three-Tier Series): When the first difference yields no obvious pattern, calculate the second-order differences. Series: 1 , 4 , 11 , 23 , 41 , 66 \text{Series: } 1, 4, 11, 23, 41, 66 Series: 1 , 4 , 11 , 23 , 41 , 66
First difference: + 3 , + 7 , + 12 , + 18 , + 25 +3, +7, +12, +18, +25 + 3 , + 7 , + 12 , + 18 , + 25
Second difference: + 4 , + 5 , + 6 , + 7 +4, +5, +6, +7 + 4 , + 5 , + 6 , + 7 (Constant + 1 +1 + 1 second difference)
Next first difference = 25 + 8 = 33 ⟹ Next term = 66 + 33 = 99 = 25 + 8 = 33 \implies \text{Next term} = 66 + 33 = 99 = 25 + 8 = 33 ⟹ Next term = 66 + 33 = 99 .
Square and Cube Formats ( n 2 ± k n^2 \pm k n 2 ± k and n 3 ± k n^3 \pm k n 3 ± k ):
Squares: n 2 , n 2 + 1 , n 2 − 1 , n 2 + n n^2, n^2 + 1, n^2 - 1, n^2 + n n 2 , n 2 + 1 , n 2 − 1 , n 2 + n . Example: 2 , 5 , 10 , 17 , 26 , 37 ⟹ ( 1 2 + 1 , 2 2 + 1 , 3 2 + 1 , 4 2 + 1 , 5 2 + 1 , 6 2 + 1 ) \text{Example: } 2, 5, 10, 17, 26, 37 \implies (1^2+1, 2^2+1, 3^2+1, 4^2+1, 5^2+1, 6^2+1) Example: 2 , 5 , 10 , 17 , 26 , 37 ⟹ ( 1 2 + 1 , 2 2 + 1 , 3 2 + 1 , 4 2 + 1 , 5 2 + 1 , 6 2 + 1 ) Example: 0 , 6 , 20 , 42 , 72 ⟹ ( 1 2 − 1 , 3 2 − 3 , 5 2 − 5 , 7 2 − 7 , 9 2 − 9 ) \text{Example: } 0, 6, 20, 42, 72 \implies (1^2-1, 3^2-3, 5^2-5, 7^2-7, 9^2-9) Example: 0 , 6 , 20 , 42 , 72 ⟹ ( 1 2 − 1 , 3 2 − 3 , 5 2 − 5 , 7 2 − 7 , 9 2 − 9 )
Cubes: n 3 , n 3 + 1 , n 3 − 1 , n 3 + n , n 3 − n n^3, n^3 + 1, n^3 - 1, n^3 + n, n^3 - n n 3 , n 3 + 1 , n 3 − 1 , n 3 + n , n 3 − n . Example: 0 , 6 , 24 , 60 , 120 , 210 ⟹ ( 1 3 − 1 , 2 3 − 2 , 3 3 − 3 , 4 3 − 4 , 5 3 − 5 , 6 3 − 6 ) \text{Example: } 0, 6, 24, 60, 120, 210 \implies (1^3-1, 2^3-2, 3^3-3, 4^3-4, 5^3-5, 6^3-6) Example: 0 , 6 , 24 , 60 , 120 , 210 ⟹ ( 1 3 − 1 , 2 3 − 2 , 3 3 − 3 , 4 3 − 4 , 5 3 − 5 , 6 3 − 6 ) Example: 2 , 9 , 28 , 65 , 126 , 217 ⟹ ( 1 3 + 1 , 2 3 + 1 , 3 3 + 1 , 4 3 + 1 , 5 3 + 1 , 6 3 + 1 ) \text{Example: } 2, 9, 28, 65, 126, 217 \implies (1^3+1, 2^3+1, 3^3+1, 4^3+1, 5^3+1, 6^3+1) Example: 2 , 9 , 28 , 65 , 126 , 217 ⟹ ( 1 3 + 1 , 2 3 + 1 , 3 3 + 1 , 4 3 + 1 , 5 3 + 1 , 6 3 + 1 )
Alternating / Interleaved (Twin) Series: Two distinct sequences interwoven at odd and even indices. Whenever a series alternates between increasing and decreasing, test for two parallel series. Series: 4 , 20 , 8 , 17 , 12 , 14 , 16 , 11 , [ ? ] \text{Series: } 4, 20, 8, 17, 12, 14, 16, 11, [?] Series: 4 , 20 , 8 , 17 , 12 , 14 , 16 , 11 , [ ?]
Odd positions: 4 , 8 , 12 , 16 , … ( + 4 progression ) 4, 8, 12, 16, \dots (+4 \text{ progression}) 4 , 8 , 12 , 16 , … ( + 4 progression )
Even positions: 20 , 17 , 14 , 11 , … ( − 3 progression ) 20, 17, 14, 11, \dots (-3 \text{ progression}) 20 , 17 , 14 , 11 , … ( − 3 progression )
Next term (position 9, odd): 16 + 4 = 20 16 + 4 = 20 16 + 4 = 20 .
Fibonacci and Generalized Additive Series: Each term is the sum of the preceding two terms: T n = T n − 1 + T n − 2 T_n = T_{n-1} + T_{n-2} T n = T n − 1 + T n − 2 . Standard Fibonacci: 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 \text{Standard Fibonacci: } 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 Standard Fibonacci: 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , 34 , 55 Generalized Additive: 3 , 5 , 8 , 13 , 21 , 34 , 55 \text{Generalized Additive: } 3, 5, 8, 13, 21, 34, 55 Generalized Additive: 3 , 5 , 8 , 13 , 21 , 34 , 55 Three-term Additive (Tribonacci): 1 , 2 , 4 , 7 , 13 , 24 , 44 ( 1 + 2 + 4 = 7 ; 2 + 4 + 7 = 13 ) \text{Three-term Additive (Tribonacci): } 1, 2, 4, 7, 13, 24, 44 \quad (1+2+4=7; 2+4+7=13) Three-term Additive (Tribonacci): 1 , 2 , 4 , 7 , 13 , 24 , 44 ( 1 + 2 + 4 = 7 ; 2 + 4 + 7 = 13 )
2. Alphabet Letter Series and Coding Mastery
Alphabet-based reasoning requires rapid retrieval of numerical positions and structural relationships between letters.
Positional Indexing Frameworks
Forward Positional Values ( 1 1 1 to 26 26 26 ): A = 1 , B = 2 , C = 3 , … , Z = 26 A=1, B=2, C=3, \dots, Z=26 A = 1 , B = 2 , C = 3 , … , Z = 26 .
Reverse Positional Values ( 26 26 26 to 1 1 1 ): A = 26 , B = 25 , C = 24 , … , Z = 1 A=26, B=25, C=24, \dots, Z=1 A = 26 , B = 25 , C = 24 , … , Z = 1 .
Formula for Reverse Position: Reverse Position = 27 − Forward Position \text{Reverse Position} = 27 - \text{Forward Position} Reverse Position = 27 − Forward Position
Memory Benchmarks: The EJOTY and CFILORUX Rules
- Rule Letter Sequence Numerical Positions
- EJOTY E – J – O – T – Y Multiples of 5 5 5 : 5 , 10 , 15 , 20 , 25 5, 10, 15, 20, 25 5 , 10 , 15 , 20 , 25
CFILORUX C – F – I – L – O – R – U – X Multiples of 3 3 3 : 3 , 6 , 9 , 12 , 15 , 18 , 21 , 24 3, 6, 9, 12, 15, 18, 21, 24 3 , 6 , 9 , 12 , 15 , 18 , 21 , 24
DHLPTX D – H – L – P – T – X Multiples of 4 4 4 : 4 , 8 , 12 , 16 , 20 , 24 4, 8, 12, 16, 20, 24 4 , 8 , 12 , 16 , 20 , 24
Complementary Opposite-Letter Pairs (Sum = 27 = 27 = 27 )
Two letters are opposites when their forward and reverse positions match. Their positional values always sum to 27 27 27 ( 1 + 26 = 27 , 2 + 25 = 27 1+26=27, 2+25=27 1 + 26 = 27 , 2 + 25 = 27 , etc.).
Pair Positions Mnemonic Anchor Pair Positions Mnemonic Anchor
A – Z 1 + 26 = 27 1 + 26 = 27 1 + 26 = 27 AZ ad / Amazon H – S 8 + 19 = 27 8 + 19 = 27 8 + 19 = 27 H igh S chool
B – Y 2 + 25 = 27 2 + 25 = 27 2 + 25 = 27 BY e / Boy I – R 9 + 18 = 27 9 + 18 = 27 9 + 18 = 27 I ndian R ailway
C – X 3 + 24 = 27 3 + 24 = 27 3 + 24 = 27 C ru X / Crax J – Q 10 + 17 = 27 10 + 17 = 27 10 + 17 = 27 J ungle Q ueen
D – W 4 + 23 = 27 4 + 23 = 27 4 + 23 = 27 D e W / Down K – P 11 + 16 = 27 11 + 16 = 27 11 + 16 = 27 K an P ur / PK
E – V 5 + 22 = 27 5 + 22 = 27 5 + 22 = 27 EV ening / Love L – O 12 + 15 = 27 12 + 15 = 27 12 + 15 = 27 LO ve
F – U 6 + 21 = 27 6 + 21 = 27 6 + 21 = 27 FU ll / Fair Unfair M – N 13 + 14 = 27 13 + 14 = 27 13 + 14 = 27 M a N
- G – T 7 + 20 = 27 7 + 20 = 27 7 + 20 = 27 G T R oad — — —
- 3. Coding-Decoding Archetypes and Solution Strategies
Letter Shifting (Direct Positional Transformation): Letters shift forward ( + k +k + k ) or backward ( − k -k − k ) by fixed, progressive, or alternating increments.
Constant Shift: If TEACHER is coded as VGCEJGT , every letter is shifted by + 2 +2 + 2 ( T → V , E → G , A → C T \rightarrow V, E \rightarrow G, A \rightarrow C T → V , E → G , A → C ).
Progressive Shift: If LIGHT is coded as MJJLW , the shifts are + 1 , + 2 , + 3 , + 4 , + 5 +1, +2, +3, +4, +5 + 1 , + 2 , + 3 , + 4 , + 5 .
Alternating Shift: + 1 , − 1 , + 1 , − 1 +1, -1, +1, -1 + 1 , − 1 , + 1 , − 1 or + 2 , − 2 , + 2 , − 2 +2, -2, +2, -2 + 2 , − 2 , + 2 , − 2 .
Opposite Letter / Reverse Coding: Replacing letters with their complementary opposite letters ( A ↔ Z , B ↔ Y A \leftrightarrow Z, B \leftrightarrow Y A ↔ Z , B ↔ Y ).
If KING is coded as PRMT ( K ↔ P , I ↔ R , N ↔ M , G ↔ T K \leftrightarrow P, I \leftrightarrow R, N \leftrightarrow M, G \leftrightarrow T K ↔ P , I ↔ R , N ↔ M , G ↔ T ).
Positional Rearrangement (Cross-Pairing / Transposition): The letters within the word are rearranged without changing their identity.
Pairs Swapped: SYSTEM → \rightarrow → SY-ST-EM → \rightarrow → YS-TS-ME ⟹ \implies ⟹ YSTSME .
Half-Word Reversal: BREAKTHROUGH (12 letters) → \rightarrow → split into two halves of 6 letters and reverse each half independently.
Mathematical & Numerical Coding: Words are converted into numbers based on place values, sums, products, or letter counts.
Sum of Place Values: If CAT = 3 + 1 + 20 = 24 = 3 + 1 + 20 = 24 = 3 + 1 + 20 = 24 , then DOG = 4 + 15 + 7 = 26 = 4 + 15 + 7 = 26 = 4 + 15 + 7 = 26 .
Sum of Reverse Place Values: CAT = 24 + 26 + 7 = 57 = 24 + 26 + 7 = 57 = 24 + 26 + 7 = 57 .
Sum Multiplied by Word Length: Value = ( ∑ positions ) × number of letters \text{Value} = (\sum \text{positions}) \times \text{number of letters} Value = ( ∑ positions ) × number of letters .
Sentence Deciphering via Common Word Elimination: Identify unique code-word correspondences by comparing multiple statements.
- Statement 1: "pit dar na" means "you are good"
- Statement 2: "dar tok pa" means "good and bad"
- Statement 3: "na tim si" means "they are late"
Deduction: Comparing (1) and (2), common word is "good" and common code is "dar" ⟹ good = dar \implies \text{good} = \text{dar} ⟹ good = dar .
Comparing (1) and (3), common word is "are" and common code is "na" ⟹ are = na \implies \text{are} = \text{na} ⟹ are = na .
From (1), remaining code is "pit" and remaining word is "you" ⟹ you = pit \implies \text{you} = \text{pit} ⟹ you = pit .
Loading diagram... 8-Point Compass Navigation and Rotational System
4. Direction Sense Tests and Spatial Geometry
Direction sense problems test spatial orientation, tracking vector displacements, turns, and solar shadow orientations.
The Standard 8-Point Compass
Four Cardinal Directions: North (N) , South (S) , East (E) , West (W) at 90 ∘ 90^\circ 9 0 ∘ separations.
Four Intercardinal / Ordinal Directions: North-East (NE) , South-East (SE) , South-West (SW) , North-West (NW) at 45 ∘ 45^\circ 4 5 ∘ bisectors.
Turn Conventions
Right Turn: Always rotate 90 ∘ 90^\circ 9 0 ∘ Clockwise (CW) relative to the current facing vector.
Left Turn: Always rotate 90 ∘ 90^\circ 9 0 ∘ Counter-Clockwise (CCW) relative to the current facing vector.
If a person is facing North: Right turn → \rightarrow → East; Left turn → \rightarrow → West.
If a person is facing South: Right turn → \rightarrow → West; Left turn → \rightarrow → East.
If a person is facing East: Right turn → \rightarrow → South; Left turn → \rightarrow → North.
If a person is facing West: Right turn → \rightarrow → North; Left turn → \rightarrow → South.
Shortest Distance / Displacement Calculation
To find the straight-line displacement from starting point ( 0 , 0 ) (0,0) ( 0 , 0 ) to final point ( x , y ) (x, y) ( x , y ) , resolve all movements into net horizontal ( Δ x ) (\Delta x) ( Δ x ) and net vertical ( Δ y ) (\Delta y) ( Δ y ) vectors, then apply the Pythagorean Theorem : d = ( Δ x ) 2 + ( Δ y ) 2 d = \sqrt{(\Delta x)^2 + (\Delta y)^2} d = ( Δ x ) 2 + ( Δ y ) 2
Common Pythagorean Triples ( a , b , c a, b, c a , b , c where a 2 + b 2 = c 2 a^2 + b^2 = c^2 a 2 + b 2 = c 2 )
( 3 , 4 , 5 ) ⟹ ( 6 , 8 , 10 ) , ( 9 , 12 , 15 ) , ( 30 , 40 , 50 ) (3, 4, 5) \implies (6, 8, 10), (9, 12, 15), (30, 40, 50) ( 3 , 4 , 5 ) ⟹ ( 6 , 8 , 10 ) , ( 9 , 12 , 15 ) , ( 30 , 40 , 50 )
( 5 , 12 , 13 ) ⟹ ( 10 , 24 , 26 ) , ( 15 , 36 , 39 ) (5, 12, 13) \implies (10, 24, 26), (15, 36, 39) ( 5 , 12 , 13 ) ⟹ ( 10 , 24 , 26 ) , ( 15 , 36 , 39 )
- ( 8 , 15 , 17 ) ⟹ ( 16 , 30 , 34 ) (8, 15, 17) \implies (16, 30, 34) ( 8 , 15 , 17 ) ⟹ ( 16 , 30 , 34 )
- ( 7 , 24 , 25 ) (7, 24, 25) ( 7 , 24 , 25 ) and ( 9 , 40 , 41 ) (9, 40, 41) ( 9 , 40 , 41 )
- Solar Shadow Principles
Shadow analysis is determined strictly by the sun's celestial position:
- Solar Time Sun's Direction Direction of Cast Shadow Facing North Facing South Facing East Facing West
- Morning (Sunrise) East West Shadow to Left Shadow to Right Shadow Behind Shadow in Front
- Evening (Sunset) West East Shadow to Right Shadow to Left Shadow in Front Shadow Behind
12:00 Noon Directly Overhead Directly Below No horizontal shadow No horizontal shadow No horizontal shadow No horizontal shadow
Tip
Quick Shadow Rule: At sunrise, shadows always point West. If a person's shadow falls to their left, they must be facing North ( 90 ∘ 90^\circ 9 0 ∘ clockwise from West). If their shadow falls to their right, they must be facing South ( 90 ∘ 90^\circ 9 0 ∘ counter-clockwise from West).