olymmath

RMM 2011 Problem 4

  • Day 2

Given a positive integer n=∏i=1spiαin=\prod_{i=1}^{s} p_{i}^{\alpha_{i}}, we write Ω(n)\Omega(n) for the total number ∑i=1sαi\sum_{i=1}^{s} \alpha_{i} of prime factors of nn, counted with multiplicity. Let λ(n)=(−1)Ω(n)\lambda(n)=(-1)^{\Omega(n)} (so, for example, λ(12)=λ(22⋅31)=(−1)2+1=−1)\left.\lambda(12)=\lambda\left(2^{2} \cdot 3^{1}\right)=(-1)^{2+1}=-1\right).

Prove the following two claims: i) There are infinitely many positive integers nn such that λ(n)=λ(n+1)=+1;\lambda(n)=\lambda(n+1)=+1 ; ii) There are infinitely many positive integers nn such that λ(n)=λ(n+1)=−1\lambda(n)=\lambda(n+1)=-1. (ROMANIA) DAN SchwARZ

Dataset text NuminaMath olympiads. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator rmm/2011/p4 · Tag PDY5WKQ9MQ · Edit this page on GitHub · Keys: j next, k previous