0% found this document useful (0 votes)
10 views4 pages

Sample_Paper_Category_II[1]

The document outlines the rules and structure for the Xponential Mathematical Contest 2025, including exam duration, sections, and submission guidelines. It contains a series of mathematical problems across three sections, with varying levels of complexity and point values. Participants must adhere to technical requirements and invigilation rules during the exam.

Uploaded by

Amitava Pal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views4 pages

Sample_Paper_Category_II[1]

The document outlines the rules and structure for the Xponential Mathematical Contest 2025, including exam duration, sections, and submission guidelines. It contains a series of mathematical problems across three sections, with varying levels of complexity and point values. Participants must adhere to technical requirements and invigilation rules during the exam.

Uploaded by

Amitava Pal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Sample Paper Category II

Xponential Round Alpha

Mathematical Contest 2025


Rise Above the Rest at Xponential!

Rules and Regulations


General Information Exam Structure
⦿ Duration: 100 minutes ⦿ Section A: 10 questions × 2 marks each
⦿ Total Marks: 100 ⦿ Section B: 10 questions × 3 marks each
⦿ Sections: A (20 marks), B (30 marks), C (50 marks) ⦿ Section C: 10 questions × 5 marks each
⦿ Submission: Form Link provided ⦿ All answers are numerical

Technical Requirements Exam Environment


⦿ Device: Computer/laptop with stable internet connection ⦿ Quiet, private room
⦿ Browser: Latest version of Chrome/Firefox/Safari/Edge ⦿ Clear desk policy
⦿ Webcam: Functional webcam or phone camera required ⦿ Only permitted items:
⦿ Audio: Working microphone or phone mic required - Blank rough paper - Pen/pencil - Water bottle

Submission Process
⦿ Enter your answers in the provided link
⦿ Invigilation Rules will be summarized to you before exam
⦿ Breaking of any rule result in disqualification
⦿ No submissions will be accepted 10 mins after exam time is over

Section A

Problem 1
The Financial Algorithm : A stock trading algorithm analyzes two market indicators (a and b),

⦿ Their volatility product (a × b) equals 120 points


⦿ When morning indicator (a) gains 3 points and evening indicator (b) drops 4 points, they equalize (ratio 1:1)

Calculate the trading signal: 3a - 2b.

Problem 2
The Dual Heights Problem : Take a triangle ABC such that AC = 10 and BC = 15. Let AD be the height of the triangle when we take
BC as the base and BE be the height of the triangle when we take AC as the base. Given AD = 6, find BE.

Problem 3
The Password Analysis : A cybersecurity team is analyzing a set of 50 encrypted passwords. A password is flagged as potentially
vulnerable if,

⦿ Its last character is not 0 (must be 1-9)


⦿ The sum of its digits is divisible by 3

What percentage of passwords from 1 to 50 get flagged?

Problem 4
The Digital Archive Challenge : A data center has 96 storage units, each with two IDs (front/back), numbered 1-192. The
challenge,

⦿ System admin sets a target sum (1-699)


⦿ Player must select 25 units
⦿ Total of all 50 IDs (front and back of 25 units) must equal target

Find how many target values are achievable.

Problem 5
The Satellite Coverage Problem : Three satellites have circular coverage areas,

⦿ Primary: radius 5 units ⦿ Backup: radius x units ⦿ MainNet: radius 10 units

Network Protocol: MainNet's signal strength (area²) must be 4 times stronger than the interference pattern (product of Primary and
Backup areas)

Find: Required radius x of Backup satellite


Sample Paper Category II

Xponential Round Alpha

Mathematical Contest 2025


Rise Above the Rest at Xponential!

Problem 6
The Security Code : A spy finds a 4-digit code system where,

⦿ Looking at _ _ _ _ (four digits)


⦿ First and third digits add to an even number
⦿ Second and fourth digits add to an odd number

How many valid codes exist?

Problem 7
The Paper Challenge : Each time you fold a paper, it doubles in thickness

⦿ Starting thickness: 1 millimeter


⦿ Goal: Reach 3 meters or higher

How many folds will this take?

Problem 8
The Power Tower : For how many integers a in {-100,-99,...,99,100} is the quantity

an integer?

Problem 9
The Network Spread : A new computer virus spreads through a network of 55 systems where,

⦿ Minute 1: infects 1 new system


⦿ Minute 2: infects 2 new systems
⦿ Minute n: infects n new systems
⦿ Complete infection takes exactly 10 minutes

Example of one possible infection pattern:

⦿ Minute 1: System #7 (1 system)


⦿ Minute 2: Systems #3, #12 (2 systems)
⦿ Minute 3: Systems #1, #4, #9 (3 systems)
...and so on until all 55 are infected

If n represents the total possible infection patterns, find n.

Problem 10
The Resource Distribution : A cloud computing system needs to allocate 15 processing units across 4 servers (a, b, c, d). Each
server must receive at least 1 unit. Find the total possible allocation patterns mod 100.

Example:

⦿ (1,2,3,9) is one valid allocation


⦿ (4,4,4,3) is another valid allocation
⦿ Order matters: (1,2,3,9) and (1,3,2,9) count as different patterns
Sample Paper Category I

Xponential Round Alpha

Mathematical Contest 2025


Rise Above the Rest at Xponential!

Section B
Problem 11
The Coefficient Quest : Find the coefficient of in the product

Problem 12
The Network Traffic : A network monitor tracks 35 time slots. What's the minimum number of high-traffic slots needed to ensure at
least 4 consecutive peak periods?

⦿ L L H H H L H L (H=High traffic, L=Low). This example has 8 tracks only.


⦿ Not sufficient (only 3 consecutive peaks)
⦿ Need to find minimum for 4 peaks

Problem 13
The Rocket Trajectory : A space agency's tracking system records a rocket's altitude,

⦿ At t=5 seconds: 25 kilometers


⦿ At t=6 seconds: 36 kilometers
⦿ At t=7 seconds: 49 kilometers

The path follows a smooth curve that can be modeled by a polynomial of degree 4. Mission Control needs the average of altitudes at
t=2 and t=10 seconds.

Problem 14
The Radar Coverage : A radar system scans points with center at (0,0), range of 5 units such that, only detects points with
whole-number coordinates [Must count points inside and on the boundary]. Find the total number of detectable points.

Example:

⦿ Point (3,4) is detectable (distance = 5)


⦿ Point (4,4) isn't (distance > 5)
⦿ (0,0), (0,1), (1,0) are all detectable

Problem 15
The Floor-Ceiling Puzzle : Solve for x in the equation: 5x+7=⌊2x⌋+⌈2x⌉

Problem 16
The Drone Flight : A drone maps a rectangular field where,

⦿ Total distance around edge is 80 units


⦿ Corner-to-corner flight path is 26 units

Find the area covered by the field.

Problem 17
The Score Combinations : A game awards points where total score must be 30 such that each point value can only be used once and
all numbers must be positive.

Example:

⦿ 16 + 14 is valid ⦿ 15 + 15 is not valid (15 used twice) ⦿ 1 + 2 + 27 is valid

Find the total number of valid scoring patterns.

Problem 18
The Digital Twin : A security system analyzes numbers n below 1000 where Sum of digits in n equals sum of digits in 3n. Find how
many numbers satisfy these conditions.

Problem 19
The Dividing Line Puzzle : In a triangular plot ABC,
⦿ Point D splits side BC in ratio 1:44
⦿ Point E splits side AC in ratio 1:55
⦿ Line AD crosses line BE at some point

If AD is split by BE in ratio p:q (simplified), find the average of p and q.


Problem 20
The Combination Equation : Find an integer r such that
Sample Paper Category II

Xponential Round Alpha

Mathematical Contest 2025


Rise Above the Rest at Xponential!

Section C
Problem 21 Problem 22
Factorial Sum : Find The Prime Puzzle : Solve the following equation where
⦿ p is prime
⦿ m, n and r are non-negative integers

where n! = n × (n-1) × ... × 2 × 1. Let p be the largest exponent Give the number of solutions.
of 11 that divides S. Find p/2. For example if S = 363 = 11^2 × 3
then your answer should be 2/2 = 1.

Problem 23 Problem 24
The Power Pattern Optimization : Given that a,b,c are positive The Divisor Challenge : How many positive integers from 1
real numbers such that a^2 + b^3 + c^4 = 1, suppose the maximum to 10000 have more divisors than their cube root?
possible value of a^4 + b^3 + c^2 can be expressed as p/q for
coprime positive integers p and q. Find p+q.

Problem 25 Problem 26
The Triple Threshold : Given any number n ≥ 2, let P(n) count Diophantine Equation : Solve the following equation in
pairs (a,b) of positive integers where: integers,

⦿ n/a is between 0 and 1


⦿ a/b is between 1 and 2
⦿ b/n is between 2 and 3
Write the answer as the number of solution pairs (a,b) where a,b
Find how many values of n make P(n) = 2146. are integers.

Problem 27 Problem 28
The Surface Path Problem : A lizard walks inside a The Dividing Line Puzzle : In a triangular plot ABC,
cylindrical pipe with an interior radius of 1 and a length of ⦿ Point D splits side BC in ratio 1:44
5. Ram marks two points on the interior surface of the pipe ⦿ Point E splits side AC in ratio 1:55
and places the lizard at one of the two points. The lizard ⦿ Line AD crosses line BE at some point
immediately walks to the other point taking the path of
shortest distance through the interior surface of the pipe. If AD is split by BE in ratio p:q (simplified), find the average
What is the maximum distance that the lizard can travel? of p and q.

Problem 29 Problem 30
The Triangle Line Intersection : ABC is a triangle with The Repeating Nines Sum : Find the sum of digits in N, where:
integer side lengths where,
N = 9 + 99 + 999 + ... + (50 nines)
⦿ BC = a
⦿ CA = b
⦿ AB = c
⦿ a, b, c must be between 1 and 20

Find the number of possible triangles (a,b,c) where the median


from point A is perpendicular to the angle bisector of angle ABC.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy